On 5/1/2013 2:53 PM, Wes wrote:
> In AP-Calc, we often have to integrate functions with absolute value
> which typically have cusps. Cusps can really trip up Romberg integration.
Anything that trips up approximation by polynomials
can really trip up these methods.
However, if you split up the domain so that "cusps"
are at the endpoints of each part, then add the results,
Romberg will do much better. Infinite endpoint arguments
are also best handled with a change of variable
to produce a finite-range equivalent.
In fact, Kahan's HP Romberg implementation has no difficulty
even with infinite function values at the endpoints
(provided that the result of integration remains finite);
how does GQ or G-K do with that?
> I've never known a student with any brand calculator
> who ever bothered with the MODE digits settings
> [which indirectly specifies when to stop iterating,
> based on reasonably expected error bounds]
Are they going to start bothering if G-K replaces Romberg?
> I will love to see that in the new generation, the numeric
> integration gives the exact same result as the symbolic one
> after replacing the numbers.
"Replacing the numbers" presumes that you can get a symbolic result
at all, and numeric methods were devised for situations in which
you can't do symbolic integration, but still need numeric answers,
with user-specifiable influence over execution time vs. precision.
The very idea of "exactly equal" also requires the very same lack of
specifying a more generous error tolerance. Kahan's original Romberg methods
seem to be very good at giving correct answers within specified
tolerances (and error bound estimates) to reasonable problems,
whenever exact answers are known, except when there appear to be
slight bugs in the numeric integration implementation,
which I believe I once proved to exist in HP34C and HP15C.
[r->] [OFF]