Bulirsch–Stoer algorithm: Difference between revisions

Revision as of 13:36, 15 December 2008

Revision as of 05:09, 16 January 2009

Line 1:

{{orphan|date=November 2008}}

In [[numerical analysis]], the '''Bulirsch-Stoer Algorithmalgorithm''' is a method of [[numerical integration]] which combines three powerful ideas, [[Richardson extrapolation]], the use of [[rational function extrapolation]] in Richardson-type applications, and the [[modified midpoint method]], to obtain numerical solutions to [[ordinary differential equation|ordinary differential equations]] (ODEs) with high accuracy and comparatively little computational effort. It ist named after [[Roland Bulirsch]] and [[Josef Stoer]]. It is sometimes called '''Gragg-Bulirsch-Stoer Algorithm''' because of the importance of a result about the error function of the modified midpoint method, due to [[William B. Gragg]].

==Underlying ideas==

Line 7:

The idea of Richardson extrapolation is to consider a numerical calculation whose accuracy depends on the used stepsize <math>h</math> as an (unknown) [[analytic function]] of the stepsize <math>h</math>, performing the numerical calculation with various values of <math>h</math>, fitting a (chosen) analytic function to the resulting points, and then evaluating the fitting function for <math>h = 0</math>, thus trying to approximate the result of the calculation with infinitely fine steps.

Bulirsch and Stoer recognized that using [[rational function|rational functions]]s as fitting functions for Richardson extrapolation in numerical integration is superior to using [[polynomial function|polynomial functions]]s because rational functions are able to approximate functions with poles rather well (compared to polynomial functions), given that there are enough higher-power terms in the denominator to account for nearby poles. While a polynomial interpolation or extrapolation only yields good results if the nearest pole is rather far outside a circle around the known data points in the complex plane, rational function interpolation or extrapolation can have remarkable accuracy even in the presence of nearby poles.

The modified midpoint method by itself is a second-order method, and therefore generally inferior to fourth-order methods like the [[Runge-Kutta methods|fourth-order Runge-Kutta method]]. However, it has the advantage of requiring only one derivative evaluation per substep (asymptotically for a large number of substeps), and, in addition, as discovered by Gragg, the error of a modified midpoint step of size <math>''H</math>'', consisting of <math>''n</math>'' substeps of size <math>''h'' = ''H''/''n</math>'' each, and expressed as a power series in <math>''h</math>'', contains only even powers of <math>''h</math>''. This makes the modified midpoint method extremely useful to the Bulirsch-Stoer method as the accuracy increases two orders at a time when the results of separate attempts to cross the interval <math>''H</math>'' with increasing numbers of substeps are combined.

==References==

<references/>

* William H. Press, Brian P. Flannery, Saul A. Teukolsky, William T. Vetterling. ''[[Numerical Recipes|Numerical Recipes in C]]''. Cambridge University Press, 1988. (See chapter 15.)