Talk:Numerical integration: Difference between revisions
→f(x) = x cases.
(→Copying Bad Code: woops wrote few weeks ago about the evilness of copy-pasting - should add translating mindlessly! :/) |
|||
Line 29:
::** [0,268435456] -- 2^55.
::At only 32 steps each, these should take minimal time to compute, while poking the boundaries of 32-bit and 64-bit precision. (You could possibly reduce it to 2 or 4 steps, or even 1 step if you don't care a great deal about the precision of the other methods. (I could be way off here. I haven't actively applied calculus since I took Calc 2 in college about eight years ago. --[[User:Short Circuit|Michael Mol]] 15:31, 12 September 2010 (UTC)
Computation time didn't bother me, but I think the choice of n being up in the millions causes multiple digits of precision to be lost in accumulated representation error. The result is that differences between methods are obscured by the common effect of accumulated representation error. I agree, 32 would be a fine number. So would 4, or 10, or even 1000. —[[User:Sonia|Sonia]] 22:40, 14 January 2011 (UTC)
| |||