Legendre-Gauss Quadrature formula: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Dmitrii Kouznetsov
imported>Dmitrii Kouznetsov
(→‎Example: describe figure)
Line 46: Line 46:
!-->
!-->
[[Image:GaulegExample.png|right|300px|thumb|Fig.1.  Example of estimate of precision: Logarithm of residual versus number <math>N</math> of terms in the right hand side of equation (1) for various integrands <math>f(x)</math>.]]
[[Image:GaulegExample.png|right|300px|thumb|Fig.1.  Example of estimate of precision: Logarithm of residual versus number <math>N</math> of terms in the right hand side of equation (1) for various integrands <math>f(x)</math>.]]
In Fig.1, the [[decimal logarithm]] of the modulus of the residual of the appdoximation of integral with Gaussian quadrature is shown versus number of terms in the sum, for four examples of the integrand.
: <math> f(x)=x^{16} </math> (black)
: <math> f(x)=\sqrt{1+x^2} </math> (red)
: <math> f(x)=1/(1+x^2) </math> (green)
: <math> f(x)=1/(3+x) </math> (blue)
The first of these functions is integrated "exactly" at <math>N>8</math>, and the residual is determined by the rounding errors at the [[long double]] arithmetic.
The second function (red) has [[branch points]] at the end of the interval; therefore, the approximation does not improve quickly at the increase of number terms in the sum. The last two functions are analytic within the range of integration; the residual decreases exponentially, and the precision of evaluation of the integral is limited only by the rounding errors.


==Extension to other interval==
==Extension to other interval==

Revision as of 07:56, 18 June 2008

Template:Copyedit

Legendre-Gauss Quadratude formiula is the approximation of the integral

(1)

with special choice of nodes and weights , characterised in that, if the finction is polynomial of order smallet than , then the exact equality takes place in equation (1).

Legendre-Gauss quadratude formula is special case of Gaussian quadratures of more general kind, which allow efficient approximation of a function with known asumptiotic behavior at the edges of the interval of integration.

Nodes and weights

Nodes in equation (1) are zeros of the Polynomial of Legendre :

(2)
(3)

Weight in equaiton (1) can be expressed with

(4)

There is no straightforward espression for the nodes ; they can be approximated with many decimal digits through only few iterations, solving numerically equation (2) with initial approach

(5)

These formulas are described in the books [1] [2]

Precision of the approximation

Example

Fig.1. Example of estimate of precision: Logarithm of residual versus number of terms in the right hand side of equation (1) for various integrands .

In Fig.1, the decimal logarithm of the modulus of the residual of the appdoximation of integral with Gaussian quadrature is shown versus number of terms in the sum, for four examples of the integrand.

(black)
(red)
(green)
(blue)

The first of these functions is integrated "exactly" at , and the residual is determined by the rounding errors at the long double arithmetic. The second function (red) has branch points at the end of the interval; therefore, the approximation does not improve quickly at the increase of number terms in the sum. The last two functions are analytic within the range of integration; the residual decreases exponentially, and the precision of evaluation of the integral is limited only by the rounding errors.

Extension to other interval

is straightforward. Should I copypast the obvious formulas here?

References

  1. Abramovitz, Milton; I. Stegun (1964). Handbook of mathematical functions. National Bureau of Standards. ISBN 0-486-61272-4. 
  2. W.H.Press, S.A.Teukolsky, W.T.Vetterling, B.P.Flannery (1988). Numerical Resipes in C. Cambridge University Press. ISBN 0-521-43108-5.