# Numerical integration

Numerical integration is used to calculate a numerical approximation for the value ${\displaystyle S}$, the area under the curve defined by ${\displaystyle f(x)}$.

In analysis, numerical integration comprises a broad family of algorithms for calculating the numerical value of a definite integral, and by extension, the term is also sometimes used to describe the numerical solution of differential equations. This article focuses on calculation of definite integrals. The term numerical quadrature (often abbreviated to quadrature) is more or less a synonym for numerical integration, especially as applied to one-dimensional integrals. Some authors refer to numerical integration over more than one dimension as cubature;[1] others take quadrature to include higher-dimensional integration.

The basic problem in numerical integration is to compute an approximate solution to a definite integral

${\displaystyle \int _^f(x)\,dx}$

to a given degree of accuracy. If f(x) is a smooth function integrated over a small number of dimensions, and the domain of integration is bounded, there are many methods for approximating the integral to the desired precision.

## History

The term "numerical integration" first appears in 1915 in the publication A Course in Interpolation and Numeric Integration for the Mathematical Laboratory by David Gibb.[2]

Quadrature is a historical mathematical term that means calculating area. Quadrature problems have served as one of the main sources of mathematical analysis. Mathematicians of Ancient Greece, according to the Pythagorean doctrine, understood calculation of area as the process of constructing geometrically a square having the same area (squaring). That is why the process was named quadrature. For example, a quadrature of the circle, Lune of Hippocrates, The Quadrature of the Parabola. This construction must be performed only by means of compass and straightedge.

The ancient Babylonians used the trapezoidal rule to integrate the motion of Jupiter along the ecliptic.[3]

Antique method to find the Geometric mean

For a quadrature of a rectangle with the sides a and b it is necessary to construct a square with the side ${\displaystyle x={\sqrt }}$ (the Geometric mean of a and b). For this purpose it is possible to use the following fact: if we draw the circle with the sum of a and b as the diameter, then the height BH (from a point of their connection to crossing with a circle) equals their geometric mean. The similar geometrical construction solves a problem of a quadrature for a parallelogram and a triangle.

The area of a segment of a parabola

Problems of quadrature for curvilinear figures are much more difficult. The quadrature of the circle with compass and straightedge had been proved in the 19th century to be impossible. Nevertheless, for some figures (for example the Lune of Hippocrates) a quadrature can be performed. The quadratures of a sphere surface and a parabola segment done by Archimedes became the highest achievement of the antique analysis.

• The area of the surface of a sphere is equal to quadruple the area of a great circle of this sphere.
• The area of a segment of the parabola cut from it by a straight line is 4/3 the area of the triangle inscribed in this segment.

For the proof of the results Archimedes used the Method of exhaustion of Eudoxus.

In medieval Europe the quadrature meant calculation of area by any method. More often the Method of indivisibles was used; it was less rigorous, but more simple and powerful. With its help Galileo Galilei and Gilles de Roberval found the area of a cycloid arch, Grégoire de Saint-Vincent investigated the area under a hyperbola (Opus Geometricum, 1647), and Alphonse Antonio de Sarasa, de Saint-Vincent's pupil and commentator, noted the relation of this area to logarithms.

John Wallis algebrised this method: he wrote in his Arithmetica Infinitorum (1656) series that we now call the definite integral, and he calculated their values. Isaac Barrow and James Gregory made further progress: quadratures for some algebraic curves and spirals. Christiaan Huygens successfully performed a quadrature of some Solids of revolution.

The quadrature of the hyperbola by Saint-Vincent and de Sarasa provided a new function, the natural logarithm, of critical importance.

With the invention of integral calculus came a universal method for area calculation. In response, the term quadrature has become traditional, and instead the modern phrase "computation of a univariate definite integral" is more common.

## Reasons for numerical integration

There are several reasons for carrying out numerical integration.

1. The integrand f(x) may be known only at certain points, such as obtained by sampling. Some embedded systems and other computer applications may need numerical integration for this reason.
2. A formula for the integrand may be known, but it may be difficult or impossible to find an antiderivative that is an elementary function. An example of such an integrand is f(x) = exp(−x2), the antiderivative of which (the error function, times a constant) cannot be written in elementary form.
3. It may be possible to find an antiderivative symbolically, but it may be easier to compute a numerical approximation than to compute the antiderivative. That may be the case if the antiderivative is given as an infinite series or product, or if its evaluation requires a special function that is not available.

## Methods for one-dimensional integrals

Numerical integration methods can generally be described as combining evaluations of the integrand to get an approximation to the integral. The integrand is evaluated at a finite set of points called integration points and a weighted sum of these values is used to approximate the integral. The integration points and weights depend on the specific method used and the accuracy required from the approximation.

An important part of the analysis of any numerical integration method is to study the behavior of the approximation error as a function of the number of integrand evaluations. A method that yields a small error for a small number of evaluations is usually considered superior. Reducing the number of evaluations of the integrand reduces the number of arithmetic operations involved, and therefore reduces the total round-off error. Also, each evaluation takes time, and the integrand may be arbitrarily complicated.

A 'brute force' kind of numerical integration can be done, if the integrand is reasonably well-behaved (i.e. piecewise continuous and of bounded variation), by evaluating the integrand with very small increments.

### Quadrature rules based on interpolating functions

A large class of quadrature rules can be derived by constructing interpolating functions that are easy to integrate. Typically these interpolating functions are polynomials. In practice, since polynomials of very high degree tend to oscillate wildly, only polynomials of low degree are used, typically linear and quadratic.

Illustration of the rectangle rule.

The simplest method of this type is to let the interpolating function be a constant function (a polynomial of degree zero) that passes through the point ${\displaystyle \left({\frac },f\left({\frac }\right)\right)}$. This is called the midpoint rule or rectangle rule

${\displaystyle \int _^f(x)\,dx\approx (b-a)f\left({\frac }\right).}$
Illustration of the trapezoidal rule.

The interpolating function may be a straight line (an affine function, i.e. a polynomial of degree 1) passing through the points ${\displaystyle \left(a,f(a)\right)}$ and ${\displaystyle \left(b,f(b)\right)}$. This is called the trapezoidal rule

${\displaystyle \int _^f(x)\,dx\approx (b-a)\left({\frac }\right).}$
Illustration of Simpson's rule.

For either one of these rules, we can make a more accurate approximation by breaking up the interval ${\displaystyle [a,b]}$ into some number ${\displaystyle n}$ of subintervals, computing an approximation for each subinterval, then adding up all the results. This is called a composite rule, extended rule, or iterated rule. For example, the composite trapezoidal rule can be stated as

${\displaystyle \int _^f(x)\,dx\approx {\frac }\left(+\sum _^\left(f\left(a+k{\frac }\right)\right)+\right),}$

where the subintervals have the form ${\displaystyle [a+kh,a+(k+1)h]\subset [a,b],}$ with ${\displaystyle h={\frac }}$ and ${\displaystyle k=0,\ldots ,n-1.}$ Here we used subintervals of the same length ${\displaystyle h}$ but one could also use intervals of varying length ${\displaystyle \left(h_\right)_}$.

Interpolation with polynomials evaluated at equally spaced points in ${\displaystyle [a,b]}$ yields the Newton–Cotes formulas, of which the rectangle rule and the trapezoidal rule are examples. Simpson's rule, which is based on a polynomial of order 2, is also a Newton–Cotes formula.

Quadrature rules with equally spaced points have the very convenient property of nesting. The corresponding rule with each interval subdivided includes all the current points, so those integrand values can be re-used.

If we allow the intervals between interpolation points to vary, we find another group of quadrature formulas, such as the Gaussian quadrature formulas. A Gaussian quadrature rule is typically more accurate than a Newton–Cotes rule, which requires the same number of function evaluations, if the integrand is smooth (i.e., if it is sufficiently differentiable). Other quadrature methods with varying intervals include Clenshaw–Curtis quadrature (also called Fejér quadrature) methods, which do nest.

Gaussian quadrature rules do not nest, but the related Gauss–Kronrod quadrature formulas do.

### Generalized midpoint rule formula

A generalized midpoint rule formula is given by

${\displaystyle \int _^=\sum _^{\sum _^{\infty }{{\frac {{{\left({-1}\right)}^}+1}{{{\left(\right)}^}\left(\right)!}}{{\left.{}\left(x\right)}\right|}_}}}}}}$

or

${\displaystyle \int _^=\lim _\sum _^{\sum _^{{\frac {{{\left({-1}\right)}^}+1}{{{\left(\right)}^}\left(\right)!}}{{\left.{}\left(x\right)}\right|}_}}}}},}$

where ${\displaystyle f^{(n)}(x)}$ denotes ${\displaystyle n}$-th derivative. For example, substituting ${\displaystyle M=1}$ and

${\displaystyle f(x)={\frac {\theta }x^}}}$

in the generalized midpoint rule formula, we obtain an equation of the inverse tangent

${\displaystyle \tan ^{-1}(\theta )=i\sum _^{\infty }{\frac }\left({\frac {\left(1+2i/\theta \right)^}}-{\frac {\left(1-2i/\theta \right)^}}\right)=2\sum _^{\infty }{{\frac }{\frac {{_}\left(\theta \right)}^\left(\theta \right)+b_^\left(\theta \right)}}},}$

where ${\displaystyle i={\sqrt {-1}}}$ is imaginary unit and

${\displaystyle {\begin&a_(\theta )=2/\theta ,\\&b_(\theta )=1,\\&a_(\theta )=a_(\theta )\,\left(1-4/\theta ^\right)+4b_(\theta )/\theta ,\\&b_(\theta )=b_(\theta )\,\left(1-4/\theta ^\right)-4a_(\theta )/\theta .\end}}$

Since at each odd ${\displaystyle n}$ the numerator of the integrand becomes ${\displaystyle (-1)^+1=0}$, the generalized midpoint rule formula can be reorganized as

${\displaystyle \int _^=2\sum _^{\sum _^{\infty }{{\frac {{{\left(\right)}^}\left(\right)!}}{{\left.{}(x)}\right|}_}}}}}\,\,.}$

The following example of Mathematica code generates the plot showing difference between inverse tangent and its approximation truncated at ${\displaystyle M=5}$ and ${\displaystyle N=10}$:

f[theta_, x_] := theta/(1 + theta^2*x^2); aTan[theta_, M_, nMax_] :=   2*Sum[(Function[x, Evaluate[D[f[theta, x], {x, 2*n}]]][(m - 1/2)/  M])/((2*n + 1)!*(2*M)^(2*n + 1)), {m, 1, M}, {n, 0, nMax}]; Plot[{ArcTan[theta] - aTan[theta, 5, 10]}, {theta, -Pi, Pi},   PlotRange -> All]

For a function ${\displaystyle g(t)}$ defined over interval ${\displaystyle (a,b)}$, its integral is

${\displaystyle \int _^=\int _^=(b-a)\int _^.}$

Therefore, we can apply the generalized midpoint integration formula above by assuming that ${\displaystyle f(x)=(b-a)\,g((b-a)x+a)}$.

If f(x) does not have many derivatives at all points, or if the derivatives become large, then Gaussian quadrature is often insufficient. In this case, an algorithm similar to the following will perform better:

def calculate_definite_integral_of_f(f, initial_step_size): '''  This algorithm calculates the definite integral of a function  from 0 to 1, adaptively, by choosing smaller steps near  problematic points.  ''' x = 0.0 h = initial_step_size accumulator = 0.0 while x < 1.0: if x + h > 1.0: h = 1.0 - x # At end of unit interval, adjust last step to end at 1. if error_too_big_in_quadrature_of_f_over_range(f, [x,x+h]): h = make_h_smaller(h) else: accumulator += quadrature_of_f_over_range(f, [x,x+h]) x += h if error_too_small_in_quadrature_of_over_range(f, [x,x+h]): h = make_h_larger(h) # Avoid wasting time on tiny steps. return accumulator

Some details of the algorithm require careful thought. For many cases, estimating the error from quadrature over an interval for a function f(x) isn't obvious. One popular solution is to use two different rules of quadrature, and use their difference as an estimate of the error from quadrature. The other problem is deciding what "too large" or "very small" signify. A local criterion for "too large" is that the quadrature error should not be larger than t · h where t, a real number, is the tolerance we wish to set for global error. Then again, if h is already tiny, it may not be worthwhile to make it even smaller even if the quadrature error is apparently large. A global criterion is that the sum of errors on all the intervals should be less than t. This type of error analysis is usually called "a posteriori" since we compute the error after having computed the approximation.

Heuristics for adaptive quadrature are discussed by Forsythe et al. (Section 5.4).

### Extrapolation methods

The accuracy of a quadrature rule of the Newton-Cotes type is generally a function of the number of evaluation points. The result is usually more accurate as the number of evaluation points increases, or, equivalently, as the width of the step size between the points decreases. It is natural to ask what the result would be if the step size were allowed to approach zero. This can be answered by extrapolating the result from two or more nonzero step sizes, using series acceleration methods such as Richardson extrapolation. The extrapolation function may be a polynomial or rational function. Extrapolation methods are described in more detail by Stoer and Bulirsch (Section 3.4) and are implemented in many of the routines in the QUADPACK library.

### Conservative (a priori) error estimation

Let ${\displaystyle f}$ have a bounded first derivative over ${\displaystyle [a,b],}$ i.e. ${\displaystyle f\in C^([a,b]).}$ The mean value theorem for ${\displaystyle f,}$ where ${\displaystyle x\in [a,b),}$ gives

${\displaystyle (x-a)f'(\xi _)=f(x)-f(a),}$

for some ${\displaystyle \xi _\in (a,x]}$ depending on ${\displaystyle x}$. If we integrate in ${\displaystyle x}$ from ${\displaystyle a}$ to ${\displaystyle b}$ on both sides and take the absolute values, we obtain

${\displaystyle \left|\int _^f(x)\,dx-(b-a)f(a)\right|=\left|\int _^(x-a)f'(v_)\,dx\right|.}$

We can further approximate the integral on the right-hand side by bringing the absolute value into the integrand, and replacing the term in ${\displaystyle f'}$ by an upper bound

${\displaystyle \left|\int _^f(x)\,dx-(b-a)f(a)\right|\leq {(b-a)^ \over 2}\sup _\left|f'(x)\right|,}$

(1 )

where the supremum was used to approximate. Hence, if we approximate the integral ${\displaystyle \int _^f(x)\,dx}$ by the quadrature rule ${\displaystyle (b-a)f(a)}$ our error is no greater than the right hand side of 1. We can convert this into an error analysis for the Riemann sum (*), giving an upper bound of

${\displaystyle \over 2}\sup _\left|f'(x)\right|}$

for the error term of that particular approximation. (Note that this is precisely the error we calculated for the example ${\displaystyle f(x)=x}$.) Using more derivatives, and by tweaking the quadrature, we can do a similar error analysis using a Taylor series (using a partial sum with remainder term) for f. This error analysis gives a strict upper bound on the error, if the derivatives of f are available.

This integration method can be combined with interval arithmetic to produce computer proofs and verified calculations.

### Integrals over infinite intervals

Several methods exist for approximate integration over unbounded intervals. The standard technique involves specially derived quadrature rules, such as Gauss-Hermite quadrature for integrals on the whole real line and Gauss-Laguerre quadrature for integrals on the positive reals.[4] Monte Carlo methods can also be used, or a change of variables to a finite interval; e.g., for the whole line one could use

${\displaystyle \int _{-\infty }^{\infty }f(x)\,dx=\int _{-1}^{+1}f\left({\frac }}\right){\frac }{(1-t^)^}}\,dt,}$

and for semi-infinite intervals one could use

${\displaystyle {\begin\int _^{\infty }f(x)\,dx&=\int _^f\left(a+{\frac }\right){\frac {(1-t)^}},\\\int _{-\infty }^f(x)\,dx&=\int _^f\left(a-{\frac }\right){\frac }},\end}}$

as possible transformations.

## Multidimensional integrals

The quadrature rules discussed so far are all designed to compute one-dimensional integrals. To compute integrals in multiple dimensions, one approach is to phrase the multiple integral as repeated one-dimensional integrals by applying Fubini's theorem (the tensor product rule). This approach requires the function evaluations to grow exponentially as the number of dimensions increases. Three methods are known to overcome this so-called curse of dimensionality.

A great many additional techniques for forming multidimensional cubature integration rules for a variety of weighting functions are given in the monograph by Stroud.[5]

### Monte Carlo

Monte Carlo methods and quasi-Monte Carlo methods are easy to apply to multi-dimensional integrals. They may yield greater accuracy for the same number of function evaluations than repeated integrations using one-dimensional methods.[citation needed]

A large class of useful Monte Carlo methods are the so-called Markov chain Monte Carlo algorithms, which include the Metropolis-Hastings algorithm and Gibbs sampling.

### Sparse grids

Sparse grids were originally developed by Smolyak for the quadrature of high-dimensional functions. The method is always based on a one-dimensional quadrature rule, but performs a more sophisticated combination of univariate results. However, whereas the tensor product rule guarantees that the weights of all of the cubature points will be positive if the weights of the quadrature points were positive, Smolyak's rule does not guarantee that the weights will all be positive.

Bayesian Quadrature is a statistical approach to the numerical problem of computing integrals and falls under the field of probabilistic numerics. It can provide a full handling of the uncertainty over the solution of the integral expressed as a Gaussian Process posterior variance. It is also known to provide very fast convergence rates which can be up to exponential in the number of quadrature points n.[6]

## Connection with differential equations

The problem of evaluating the integral

${\displaystyle F(x)=\int _^f(u)\,du}$

can be reduced to an initial value problem for an ordinary differential equation by applying the first part of the fundamental theorem of calculus. By differentiating both sides of the above with respect to the argument x, it is seen that the function F satisfies

${\displaystyle {\frac }=f(x),\quad F(a)=0.}$

Methods developed for ordinary differential equations, such as Runge–Kutta methods, can be applied to the restated problem and thus be used to evaluate the integral. For instance, the standard fourth-order Runge–Kutta method applied to the differential equation yields Simpson's rule from above.

The differential equation F ' (x) = ƒ(x) has a special form: the right-hand side contains only the dependent variable (here x) and not the independent variable (here F). This simplifies the theory and algorithms considerably. The problem of evaluating integrals is thus best studied in its own right.