Gauss–Kronrod quadrature formula

Gauss–Kronrod quadrature formula

In numerical mathematics, the Gauss–Kronrod quadrature formula is a method for numerical integration (calculating approximate values of integrals). Gauss–Kronrod quadrature is a variant of Gaussian quadrature, in which the evaluation points are chosen so that an accurate approximation can be computed by re-using the information produced by the computation of a less accurate approximation. It is an example of what is called a nested quadrature rule: for the same set of function evaluation points, it has two quadrature rules, one higher-order and one lower-order (the latter called an "embedded" rule), and the difference between these two approximations is used to estimate the calculational error of the integration.

These formulas are named after Alexander Kronrod, who invented them in the 1960s, and Carl Friedrich Gauss. Gauss–Kronrod quadrature is used in the QUADPACK library, the NAG Numerical Libraries and Matlab.

Description

The problem in numerical integration is to approximate definite integrals of the form

:int_a^b f(x),dx.

Such integrals can be approximated, for example, by "n"-point Gaussian quadrature

:int_a^b f(x),dx approx sum_{i=1}^n w_i f(x_i).

where "w""i", "x""i" are the weights and points at which to evaluate the function "f"("x").

If the interval ["a", "b"] is subdivided, the Gauss evaluation points of the new subintervals never coincide with the previous evaluation points (except at zero for odd numbers), and thus the integrand must be evaluated at every point. Gauss–Kronrod formulas are extensions of Gauss quadrature formulas generated by adding n+1 points to an n-point rule in such a way that the resulting rule is of order 3n+1. This allows for computing higher-order estimates while re-using the function values of a lower-order estimate. The difference between a Gauss quadrature rule and its Kronrod extension are often used as an estimate of the approximation error.

Example

A popular example combines a 7-point Gauss rule with a 15-point Kronrod rule Harv|Kahaner|Moler|Nash|1989|loc=§5.5. Because the Gauss points are incorporated into the Kronrod points, a total of only 15 function evaluations yields both a quadrature estimate and an error estimate.

:

harvtxt|Patterson|1968 showed how to find further extensions of this type.

References

*
* (Authorized translation from the Russian)
* (Reference guide for QUADPACK)
*. Erratum in "Math. Comput." 23: 892.

External links

* QUADPACK (part of SLATEC): description [http://www.netlib.org/slatec/src/qpdoc.f] , source code [http://www.netlib.org/slatec/src] . QUADPACK is a collection of algorithms, in Fortran, for numerical integration based on Gauss-Kronrod rules. SLATEC (at Netlib) is a large public domain library for numerical computing.


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Clenshaw–Curtis quadrature — and Fejér quadrature are methods for numerical integration, or quadrature , that are based on an expansion of the integrand in terms of Chebyshev polynomials. Equivalently, they employ a change of variables x = cos θ and use a discrete… …   Wikipedia

  • Alexander Kronrod — Infobox Scientist name = Aleksandr Semenovich Kronrod image size = 180px caption = A.S. Kronrod birth date = birth date|1921|10|22|mf=y birth place = Moscow, Russia death date = death date and age|1986|10|6|1921|10|22|mf=y deathplace =… …   Wikipedia

  • Adaptive quadrature — In applied mathematics, adaptive quadrature is a process in which the integral of a function f(x) is approximated using static quadrature rules on adaptively refined subintervals of the integration domain. Generally, adaptive algorithms are just… …   Wikipedia

  • Gaussian quadrature — In numerical analysis, a quadrature rule is an approximation of the definite integral of a function, usually stated as a weighted sum of function values at specified points within the domain of integration.(See numerical integration for more on… …   Wikipedia

  • Tanh-sinh quadrature — is a method for numerical integration introduced by Hidetosi Takahasi and Masatake Mori in 1974.[1] It uses the change of variables to transform an integral on the interval x ∈ (−1, +1) to an integral on the entire real line… …   Wikipedia

  • List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia

  • List of mathematics articles (G) — NOTOC G G₂ G delta space G networks Gδ set G structure G test G127 G2 manifold G2 structure Gabor atom Gabor filter Gabor transform Gabor Wigner transform Gabow s algorithm Gabriel graph Gabriel s Horn Gain graph Gain group Galerkin method… …   Wikipedia

  • List of Russian mathematicians — Andrey Kolmogorov, a preeminent 20th century mathematician. This list of Russian mathematicians includes the famous mathematicians from the Russian Empire, the Soviet Union and the Russian Federation. This list is incomplete; you can help by …   Wikipedia

  • List of Russian IT developers — This list of Russian IT developers includes the famous hardware engineers, computer scientists and programmers from the Russian Empire, the Soviet Union and the Russian Federation. See also the Category:Russian computer scientists and… …   Wikipedia

  • Integral — This article is about the concept of integrals in calculus. For the set of numbers, see integer. For other uses, see Integral (disambiguation). A definite integral of a function can be represented as the signed area of the region bounded by its… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”