Jump to content

Gauss–Legendre method

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 114.182.149.6 (talk) at 07:08, 8 February 2015. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In numerical analysis and scientific computing, the Gauss–Legendre methods are a family of numerical methods for ordinary differential equations. Gauss–Legendre methods are implicit Runge–Kutta methods. More specifically, they are collocation methods based on the points of Gauss–Legendre quadrature. The Gauss–Legendre method based on s points has order 2s.[1]

All Gauss–Legendre methods are A-stable.[2]

The Gauss–Legendre method of order two is the implicit midpoint rule. Its Butcher tableau is:

1/2 1/2
1

The Gauss–Legendre method of order four has Butcher tableau:

The Gauss–Legendre method of order six has Butcher tableau:

The computational cost of higher-order Gauss–Legendre methods is usually too high, and thus, they are rarely used.[3]

Notes

  1. ^ Iserles 1996, p. 47
  2. ^ Iserles 1996, p. 63
  3. ^ Iserles 1996, p. 47

References

  • Iserles, Arieh (1996), A First Course in the Numerical Analysis of Differential Equations, Cambridge University Press, ISBN 978-0-521-55655-2.