Trapezoidal rule

The trapezoidal rule works by approximating the region under the graph of the function

The trapezoidal rule may be viewed as the result obtained by averaging the left and right Riemann sums, and is sometimes defined this way.

The integral can be even better approximated by partitioning the integration interval, applying the trapezoidal rule to each subinterval, and summing the results.

the formula can be simplified for calculation efficiency by factoring

The approximation becomes more accurate as the resolution of the partition increases (that is, for larger

As discussed below, it is also possible to place error bounds on the accuracy of the value of a definite integral estimated using a trapezoidal rule.

A 2016 Science paper reports that the trapezoid rule was in use in Babylon before 50 BCE for integrating the velocity of Jupiter along the ecliptic.

equally spaced panels, considerable simplification may occur.

The error of the composite trapezoidal rule is the difference between the value of the integral and the numerical result:

It follows that if the integrand is concave up (and thus has a positive second derivative), then the error is negative and the trapezoidal rule overestimates the true value.

This can also be seen from the geometric picture: the trapezoids include all of the area under the curve and extend over it.

Similarly, a concave-down function yields an underestimate because area is unaccounted for under the curve, but none is counted above.

If the interval of the integral being approximated includes an inflection point, the sign of the error is harder to identify.

Further terms in this error estimate are given by the Euler–Maclaurin summation formula.

Several techniques can be used to analyze the error, including:[4] It is argued that the speed of convergence of the trapezoidal rule reflects and can be used as a definition of classes of smoothness of the functions.

Summing all of the local error terms we find

The trapezoidal rule converges rapidly for periodic functions.

This is an easy consequence of the Euler-Maclaurin summation formula, which says that if

[9] Due to the periodicity, the derivatives at the endpoint cancel and we see that the error is

A similar effect is available for peak-like functions, such as Gaussian, Exponentially modified Gaussian and other functions with derivatives at integration limits that can be neglected.

[10] The evaluation of the full integral of a Gaussian function by trapezoidal rule with 1% accuracy can be made using just 4 points.

[11] Simpson's rule requires 1.8 times more points to achieve the same accuracy.

[11][12] Although some effort has been made to extend the Euler-Maclaurin summation formula to higher dimensions,[13] the most straightforward proof of the rapid convergence of the trapezoidal rule in higher dimensions is to reduce the problem to that of convergence of Fourier series.

For very large dimension, the shows that Monte-Carlo integration is most likely a better choice, but for 2 and 3 dimensions, equispaced sampling is efficient.

This is exploited in computational solid state physics where equispaced sampling over primitive cells in the reciprocal lattice is known as Monkhorst-Pack integration.

Still, error bounds for such rough functions can be derived, which typically show a slower convergence with the number of function evaluations

Interestingly, in this case the trapezoidal rule often has sharper bounds than Simpson's rule for the same number of function evaluations.

Simpson's rule is another member of the same family, and in general has faster convergence than the trapezoidal rule for functions which are twice continuously differentiable, though not in all specific cases.

However, for various classes of rougher functions (ones with weaker smoothness conditions), the trapezoidal rule has faster convergence in general than Simpson's rule.

[11][12] For non-periodic functions, however, methods with unequally spaced points such as Gaussian quadrature and Clenshaw–Curtis quadrature are generally far more accurate; Clenshaw–Curtis quadrature can be viewed as a change of variables to express arbitrary integrals in terms of periodic integrals, at which point the trapezoidal rule can be applied accurately.

The function f ( x ) (in blue) is approximated by a linear function (in red).
An animation that shows what the trapezoidal rule is and how the error in approximation decreases as the step size decreases
Illustration of "chained trapezoidal rule" used on an irregularly-spaced partition of .
An animation showing how the trapezoidal rule approximation improves with more strips for an interval with and . As the number of intervals increases, so too does the accuracy of the result.