Trapezoidal Method

In calculus, the trapezoidal rule (also known as the trapezoid rule or trapezium rule; see Trapezoid for more information on terminology) is a technique for approximating the definite integral.
$\int_a^b f(x) \, dx.$

The trapezoidal rule works by approximating the region under the graph of the function
$f(x)$ as a trapezoid and calculating its area. It follows that
$\int_^ f(x) \, dx \approx (b-a) \cdot \tfrac(f(a)+f(b)).$

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. In practice, this "chained" (or "composite") trapezoidal rule is usually what is meant by "integrating with the trapezoidal rule". Let $\$ be a partition of ,b/math> such that $a=x_0 < x_1 < \cdots < x_ < x_N = b$ and $\Delta x_k$ be the length of the $k$-th subinterval (that is, $\Delta x_k = x_k - x_$), then
$\int_a^b f(x) \, dx \approx \sum_^N \frac \Delta x_k.$
When the partition has a regular spacing, as is often the case, that is, when all the $\Delta x_k$ have the same value $\Delta x,$ the formula can be simplified for calculation efficiency by factoring $\Delta x$ out:.
$\int_a^b f(x) \, dx \approx \frac \left(f(x_0) + 2f(x_1) + 2f(x_2) + 2f(x_3) + 2f(x_4) + \cdots + 2f(x_) + f(x_N)\right).$

The approximation becomes more accurate as the resolution of the partition increases (that is, for larger $N$, all $\Delta x_k$ decrease).

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.

History

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.

Numerical implementation

Non-uniform grid

When the grid spacing is non-uniform, one can use the formula
$\int_^ f(x)\, dx \approx \sum_^N \frac \Delta x_k ,$
wherein $\Delta x_k = x_ - x_ .$

Uniform grid

For a domain discretized into $N$ equally spaced panels, considerable simplification may occur. Let
$\Delta x_k = \Delta x = \frac$
the approximation to the integral becomes
\begin
\int_^ f(x)\, dx
&\approx \frac \sum_^ \left( f(x_) + f(x_) \right) \\ pt&= \frac ( f(x_0) + 2f(x_1) + 2f(x_2) + 2f(x_3) + \dotsb + 2f(x_) + f(x_N) ) \\ pt&= \Delta x \left( \sum_^ f(x_k) + \frac \right).
\end

Error analysis

The error of the composite trapezoidal rule is the difference between the value of the integral and the numerical result:
\text = \int_a^b f(x)\,dx - \frac \left + \sum_^ f \left( a+k \frac \right) \right/math>

There exists a number ''ξ'' between ''a'' and ''b'', such that
$\text = -\frac f''(\xi)$

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 error is harder to identify.

An asymptotic error estimate for ''N'' → ∞ is given by
\text = -\frac \big f'(b)-f'(a) \big+ O(N^).
Further terms in this error estimate are given by the Euler–Maclaurin summation formula.

Several techniques can be used to analyze the error, including:
#Fourier series
#Residue calculus
# Euler–Maclaurin summation formula
#Polynomial interpolation

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.

Proof

First suppose that $h=\frac$ and $a_k=a+(k-1)h$. Let g_k(t) = \frac t (a_k)+f(a_k+t)- \int_^ f(x) \, dx be the function such that $, g_k(h),$ is the error of the trapezoidal rule on one of the intervals, _k, a_k+h. Then
= (a_k)+f(a_k+t)t\cdot f'(a_k+t)-f(a_k+t),
and
$=t\cdot f''(a_k+t).$

Now suppose that $\left, f''(x) \ \leq \left, f''(\xi) \,$ which holds if $f$ is sufficiently smooth. It then follows that
$\left, f''(a_k+t) \ \leq f''(\xi)$
which is equivalent to
$-f''(\xi) \leq f''(a_k+t) \leq f''(\xi)$, or $-\frac \leq g_k''(t) \leq \frac.$

Since $g_k'(0)=0$ and $g_k(0)=0$,
$\int_0^t g_k''(x) dx = g_k'(t)$ and $\int_0^t g_k'(x) dx = g_k(t).$

Using these results, we find
$-\frac \leq g_k'(t) \leq \frac$
and
$-\frac \leq g_k(t) \leq \frac$

Letting $t = h$ we find
$-\frac \leq g_k(h) \leq \frac.$

Summing all of the local error terms we find
\sum_^ g_k(h) = \frac \left + \sum_^ f \left( a+k \frac \right) \right- \int_a^b f(x)dx.

But we also have
$- \sum_^N \frac \leq \sum_^N g_k(h) \leq \sum_^N \frac$
and
$\sum_^N \frac=\frac,$

so that

-\frac \leq \frac \left + \sum_^ f \left( a+k \frac \right) \right\int_a^bf(x)dx \leq \frac.

Therefore the total error is bounded by

\text = \int_a^b f(x)\,dx - \frac \left + \sum_^ f \left( a+k \frac \right) \right= \frac=\frac.

Periodic and peak functions

The trapezoidal rule converges rapidly for periodic functions. This is an easy consequence of the Euler-Maclaurin summation formula, which says that
if $f$ is $p$ times continuously differentiable with period $T$
$\sum_^ f(kh)h = \int_0^T f(x)\,dx + \sum_^ \frac (f^(T) - f^(0)) - (-1)^p h^p \int_0^T\tilde_(x/T)f^(x) \, dx$
where $h:=T/N$ and $\tilde_$ is the periodic extension of the $p$th Bernoulli polynomial. Due to the periodicity, the derivatives at the endpoint cancel and we see that the error is $O(h^p)$.

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. The evaluation of the full integral of a Gaussian function by trapezoidal rule with 1% accuracy can be made using just 4 points. Simpson's rule requires 1.8 times more points to achieve the same accuracy.

Although some effort has been made to extend the Euler-Maclaurin summation formula to higher dimensions, 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. This line of reasoning shows that if $f$ is periodic on a $n$-dimensional space with $p$ continuous derivatives, the speed of convergence is $O(h^)$. 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''.

"Rough" functions

For functions that are not in ''C''², the error bound given above is not applicable. Still, error bounds for such rough functions can be derived, which typically show a slower convergence with the number of function evaluations $N$ than the $O(N^)$ behaviour given above. Interestingly, in this case the trapezoidal rule often has sharper bounds than Simpson's rule for the same number of function evaluations.

Applicability and alternatives

The trapezoidal rule is one of a family of formulas for numerical integration called Newton–Cotes formulas, of which the midpoint rule is similar to the trapezoid rule. 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.

Moreover, the trapezoidal rule tends to become extremely accurate when periodic functions are integrated over their periods, which can be analyzed in various ways. A similar effect is available for peak functions.

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.

Example

The following integral is given:
$\int_^$

Solution

See also

* Gaussian quadrature
* Newton–Cotes formulas
* Rectangle method
* Romberg's method
* Simpson's rule
*

Notes

References

*
*
*
*
*

External links

Trapezium formula. I.P. Mysovskikh
''Encyclopedia of Mathematics'', ed. M. Hazewinkel
Notes on the convergence of trapezoidal-rule quadrature

{{Calculus topics

Numerical integration (quadrature)