Gauss-Kronrod Numerical Integration Calculator

Gauss-Kronrod Numerical Integration Calculator

Emerging AI Skill PRO

Enter Calculation

Formula

∫abf(x)dx≈b−a2∑i=1nwif(b−a2xi+a+b2)\int_{\text{a}}^{\text{b}} {f(x)}\,dx \;\approx\; \frac{b-a}{2}\sum_{i=1}^{\text{n}} w_i\, f\!\left(\frac{b-a}{2}x_i + \frac{a+b}{2}\right)
Usage stats

Advertisement

Results

Integral value
3.1415926536
approximated value of the definite integral
Estimated error 0.000000002664
Method Gauss-Kronrod (embedded Gauss-Legendre comparison)

Report an error on this page

What is the Gauss-Kronrod Numerical Integration Calculator?

This tool computes the definite integral of a function f(x) over a finite interval [a, b] using Gauss-type quadrature. It evaluates the integrand at carefully chosen nodes, multiplies by precomputed weights, and sums the contributions. A higher-order estimate K is compared against a lower-order Gauss-Legendre estimate G to produce an error bound \(|K - G|\), giving you confidence in the result.

Definite integral shown as the shaded area under a curve between two vertical limits
The definite integral equals the signed area under f(x) between the limits a and b.

How to use it

Enter a math expression in x (for example 4/(1+x^2) or sin(x)), set the lower limit a and upper limit b, and choose the number of points n for the rule (odd, from 3 to 99). More points give higher accuracy for smooth integrands. Supported syntax includes + - * / ^, parentheses, and sin, cos, tan, asin, acos, atan, exp, ln, log, sqrt, abs, sinh, cosh, tanh, plus the constants pi and e.

The formula

Quadrature rules are defined on [-1, 1] as the weighted sum of integrand values. To integrate over [a, b], an affine change of variable is applied: \(x(t) = \frac{b-a}{2}\cdot t + \frac{a+b}{2}\) with \(dx = \frac{b-a}{2}\cdot dt\). Therefore the integral equals (b-a)/2 times the sum of weights w_i times f at the mapped nodes.

$$\int_{\text{a}}^{\text{b}} f(x)\,dx \;\approx\; \frac{b-a}{2}\sum_{i=1}^{\text{n}} w_i\, f\!\left(\frac{b-a}{2}x_i + \frac{a+b}{2}\right)$$

The Gauss-Legendre nodes are the roots of the Legendre polynomial, found here by Newton's method, with weights \(w_i = \frac{2}{(1 - t_i^2)\cdot P'_m(t_i)^2}\).

Advertisement
Curve sampled at several unevenly spaced points with dots and weight arrows
Gauss-Kronrod evaluates f(x) at optimally placed nodes, each scaled by a weight.

Worked example

For f(x) = sin(x) on [0, pi], the exact integral is

$$[-\cos(x)]_{0}^{\pi} = -\cos(\pi) + \cos(0) = 1 + 1 = 2.$$

The calculator returns approximately 2 with a tiny estimated error. Similarly f(x) = 4/(1+x^2) on [0, 1] returns \(\pi = 3.14159265\), since \(4\cdot\arctan(1) = \pi\).

Advertisement

Interpreting the Integral and Error Estimate

The integral value is a signed area. Where f(x) lies above the x-axis it adds to the total, and where f(x) lies below the x-axis it subtracts. For example, \(\int_{-1}^{1} x\,dx = 0\) because the positive and negative halves cancel, even though the region between the curve and the axis is clearly not empty. If you need the total (unsigned) area, integrate |f(x)| instead, or split the interval at each root of f and add the absolute values of the pieces.

A Gauss-Kronrod rule evaluates the integrand with two related rules that share nodes: a lower-order Gauss rule G and a higher-order Kronrod rule K. The reported integral is normally the Kronrod value K, and the error indicator is based on the difference:

$$E \approx |K - G|$$

This is a conservative indicator. It measures the error of the lower-order rule G, so for smooth integrands it usually overestimates the true error of K, which is typically much smaller. Treat it as an upper-scale hint rather than the exact error.

Reading the error estimate

  • Small error (relative to the size of the result): G and K agree, which suggests the quadrature has converged and the integrand is well approximated by a polynomial on the interval.
  • Large error: G and K disagree, which often points to a singularity (for example \(1/\sqrt{x}\) at an endpoint), rapid oscillation (for example \(\sin(100x)\)), or a jump discontinuity or kink inside [a, b].

What to do when the error is large

  1. Split the interval at the troublesome point (a discontinuity, kink, or singularity) and integrate each piece separately, then add the results. Adaptive subdivision applies this idea repeatedly.
  2. Increase n by choosing a higher-order Kronrod option. This helps for smooth but strongly varying or moderately oscillatory functions.
  3. For endpoint singularities, consider a change of variables or splitting off the singular part, since raising n alone converges slowly.
  4. Check that the function expression is entered correctly and is defined everywhere on [a, b].

Important: the error estimate is a heuristic, not a rigorous guarantee. A small |K − G| can occasionally occur by coincidence, for instance when a narrow spike falls between nodes and both rules miss it. If the result matters, confirm it by re-running with a different n or with split subintervals and checking that the answers agree.

FAQ

Why must n be odd? The embedded Gauss-Kronrod pair reuses \(m = \frac{n-1}{2}\) Gauss nodes, which requires an odd total node count.

What does the error estimate mean? It is the absolute difference between the high-order and low-order estimates; a small value indicates convergence.

What about singularities? Integrable endpoint singularities reduce accuracy. Non-finite evaluations are skipped, and a = b returns exactly 0.

Last updated:

Most popular in Math and Statistics

View all Math and Statistics calculators