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.
The problem in numerical integration is to approximate definite integrals of the form
Such integrals can be approximated, for example, by n-point Gaussian quadrature
where wi, xi 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 points to an -point rule in such a way that the resulting rule is of order . 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.
A popular example combines a 7-point Gauss rule with a 15-point Kronrod rule . 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.
| Gauss nodes | Weights | |
|---|---|---|
| ±0.94910 79123 42759 | ∗ | 0.12948 49661 68870 |
| ±0.74153 11855 99394 | ∗ | 0.27970 53914 89277 |
| ±0.40584 51513 77397 | ∗ | 0.38183 00505 05119 |
| 0.00000 00000 00000 | ∗ | 0.41795 91836 73469 |
| Kronrod nodes | Weights | |
| ±0.99145 53711 20813 | 0.02293 53220 10529 | |
| ±0.94910 79123 42759 | ∗ | 0.06309 20926 29979 |
| ±0.86486 44233 59769 | 0.10479 00103 22250 | |
| ±0.74153 11855 99394 | ∗ | 0.14065 32597 15525 |
| ±0.58608 72354 67691 | 0.16900 47266 39267 | |
| ±0.40584 51513 77397 | ∗ | 0.19035 05780 64785 |
| ±0.20778 49550 07898 | 0.20443 29400 75298 | |
| 0.00000 00000 00000 | ∗ | 0.20948 21410 84728 |