Re: Re: Re: NIntegrate

*To*: mathgroup at smc.vnet.net*Subject*: [mg3025] Re: [mg3008] Re: [mg2987] Re: NIntegrate*From*: CHAN MUN CHOONG <sci20312 at leonis.nus.sg>*Date*: Wed, 24 Jan 1996 03:33:27 -0500

On Mon, 22 Jan 1996, Richard Mercer wrote: > > as I recall, NIntegrate approximates an integral in > > exactly the same way that a person would, through > > trapezoidal approximation. > > > > > so for the function f[x] it selects points on f[x] and > > finds the area of all the trapizoids formed by connecting > > these points to eachother and the x axis over the > > specified range of x {x,a,b}. > > > > > Mathmatica continues to refine these trapezoids by making > > them thinner, and there by getting a more accurate > > approximation. It continues to refine the approximations > > untill it reaches the prescribed accuracy. > > I hope not! The trapezoidal approximation is not very accurate, in fact > less accurate than Riemann sums using midpoints. Even as a "person", I > would use Simpson's Rule, which is much more accurate for the same > amount of work. > > At the very least NIntegrate would use an adaptive Simpson's Rule, > using smaller intervals where the function changes rapidly. I suspect > (but do not know) it uses more sophisticated methods as well. > > Richard Mercer > > Actually NIntegrate uses the adaptive Gauss quadrature method called Gauss Kronrod points. At least that's what wri told me the last time. Can be very sure that it's better than Simpson's Rule. ==== [MESSAGE SEPARATOR] ====