trapezoidal rule
≈ 14 min read
Names in other languages
- FrançaisMéthode des trapèzes
- СрпскиTrapezoidno pravilo
- Englishtrapezoidal rule
- РусскийМетод трапеций
- PolskiWzór trapezów
- 한국어사다리꼴 공식
- 简体中文梯形公式
- 繁體中文梯形公式
- 中文梯形公式
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In calculus, the trapezoidal rule (informally trapezoid rule; or in British English trapezium rule) is a technique for numerical integration, i.e. 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. This is easily calculated by noting that the area of the region is made up of a rectangle with width (b - a) and height f(a) , and a triangle of width (b-a) and height f(b) - f(a) .
Therefore, \begin{align} \int_a^b f(x) \, dx &\approx \underbrace{(b - a) \cdot f(a)}_{\text{Area of rectangle}} + \underbrace{\tfrac{1}{2} (b - a) \cdot [f(b) - f(a)]}_{\text{Area of triangle}} \\ &= (b - a) \cdot \left(f(a) + \tfrac{1}{2} f(b) - \tfrac{1}{2} f(a)\right) \\ &= (b - a) \cdot \left(\tfrac{1}{2} f(a) + \tfrac{1}{2} f(b)\right) \\ &= \frac{1}{2} (b - a) [f(a) + f(b)]. \end{align} The rule can also be derived by replacing the integrand with the equation of the line joining points \big(a, f(a)\big) and \big(b, f(b)\big) , which using the two point form of the equation of a line, is y = (x - a)\,\frac{f(b) - f(a)}{b - a} + f(a).…
In calculus, the trapezoidal rule (informally trapezoid rule; or in British English trapezium rule) is a technique for numerical integration, i.e. 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. This is easily calculated by noting that the area of the region is made up of a rectangle with width (b - a) and height f(a) , and a triangle of width (b-a) and height f(b) - f(a) .
Therefore, \begin{align} \int_a^b f(x) \, dx &\approx \underbrace{(b - a) \cdot f(a)}_{\text{Area of rectangle}} + \underbrace{\tfrac{1}{2} (b - a) \cdot [f(b) - f(a)]}_{\text{Area of triangle}} \\ &= (b - a) \cdot \left(f(a) + \tfrac{1}{2} f(b) - \tfrac{1}{2} f(a)\right) \\ &= (b - a) \cdot \left(\tfrac{1}{2} f(a) + \tfrac{1}{2} f(b)\right) \\ &= \frac{1}{2} (b - a) [f(a) + f(b)]. \end{align} The rule can also be derived by replacing the integrand with the equation of the line joining points \big(a, f(a)\big) and \big(b, f(b)\big) , which using the two point form of the equation of a line, is y = (x - a)\,\frac{f(b) - f(a)}{b - a} + f(a).
Therefore, \begin{align} \int_a^b f(x) \, dx &\approx \int_a^b (x - a)\,\frac{f(b) - f(a)}{b - a} + f(a) \, dx \\ &= \left[\frac{1}{2} (x - a)^2 \,\frac{f(b) - f(a)}{b - a} + xf(a) \right]_{x=a}^{x=b} \\ &= \left[\frac{1}{2} (b - a)^2 \,\frac{f(b) - f(a)}{b - a} + bf(a) \right] - af(a) \\ &= \frac{1}{2} (b - a) [f(b) - f(a)] + (b - a) f(a) \\ &= \frac{1}{2} (b - a) [f(a) + f(b)], \end{align} as before.
[[File:Integration num trapezes notation.svg|thumb|Illustration of "chained trapezoidal rule" used on an irregularly spaced partition of [a, b] 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 \{x_k\} be a partition of [a, b] such that a = x_0 and \Delta x_k be the length of the k -th subinterval (that is, \Delta x_k = x_k - x_{k-1} ), then \int_a^b f(x) \, dx \approx \sum_{k=1}^N \frac{f(x_{k-1}) + f(x_k)}{2} \Delta x_k. 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 approximation becomes more accurate as the resolution of the partition increases (that is, for larger N , all \Delta x_k decrease).
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 \Delta x \left(\frac{f(x_0) + f(x_N)} 2 + \sum_{k=1}^{N-1} f(x_k) \right).
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. \int_a^b f(x) \,dx \approx \sum_{k=1}^N \frac{f(x_{k-1}) + f(x_k)}{2} \Delta x_k, where \Delta x_k = x_k - x_{k-1}, or more a computationally efficient formula \int_a^b f(x) \,dx \approx \frac{1}{2} \biggl(f(x_0) \Delta_{+1} x_0 + f(x_N) \Delta_{-1} x_N + \sum_{k=1}^{N-1} f(x_k) \Delta_{\pm1} x_k\biggr), where \Delta_{+1} x_0 = x_1 - x_0, \Delta_{-1} x_N = x_N - x_{N-1}, \Delta_{\pm1} x_k = x_{k+1} - x_{k-1} are the corresponding forward, backward, and central differences.
Let \Delta x = \frac{b - a}{N} and x_k = a + k \Delta x for k = 0, 1, \ldots, N. The approximation to the integral becomes \begin{align} \int_a^b f(x) \,dx &\approx \frac{\Delta x}{2} \sum_{k=1}^N [f(x_{k-1}) + f(x_{k})] \\ &= \Delta x \biggl( \tfrac12f(x_0) + \tfrac12f(x_N) + \sum_{k=1}^{N-1} f(x_k) \biggr). \end{align} Sometimes this expression is written as \Delta x \!\! \mathop{\ \sum\vphantom\big)'}_{k=0}^{N} f(x_k), where the symbol indicates that the first and last terms are halved.
Error analysis
The error of the composite trapezoidal rule is the difference between the value of the integral and the numerical result: \text{E} = \int_a^b f(x)\,dx - \frac{b-a}{N} \left[ {f(a) + f(b) \over 2} + \sum_{k=1}^{N-1} f \left( a+k \frac{b-a}{N} \right) \right] There exists a number ξ between a and b, such that \text{E} = -\frac{(b-a)^3}{12N^2} 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 sign of the error is harder to identify. An asymptotic error estimate for N → ∞ is given by \text{E} = -\frac{(b-a)^2}{12N^2} \big[ f'(b)-f'(a) \big] + O(N^{-3}).
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. First suppose that h=\frac{b-a}{N} and a_k=a+(k-1)h .
Let g_k(t) = \frac{1}{2} t[f(a_k)+f(a_k+t)] - \int_{a_k}^{a_k+t} f(x) \, dx be the function such that |g_k(h)| is the error of the trapezoidal rule on one of the intervals, [a_k, a_k+h] . Then {dg_k \over dt}={1 \over 2}[f(a_k)+f(a_k+t)]+{1\over2}t\cdot f'(a_k+t)-f(a_k+t), and {d^2g_k \over dt^2}={1\over 2}t\cdot f(a_k+t). Now suppose that \left| f(x) \right| \leq \left| f(\xi) \right|, which holds if f is sufficiently smooth.
It then follows that \left| f(a_k+t) \right| \leq f(\xi) which is equivalent to -f(\xi) \leq f(a_k+t) \leq f(\xi) , or -\frac{f(\xi)t}{2} \leq g_k(t) \leq \frac{f(\xi)t}{2}. 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{f(\xi)t^2}{4} \leq g_k'(t) \leq \frac{f(\xi)t^2}{4} and -\frac{f(\xi)t^3}{12} \leq g_k(t) \leq \frac{f(\xi)t^3}{12} Letting t = h we find -\frac{f(\xi)h^3}{12} \leq g_k(h) \leq \frac{f(\xi)h^3}{12}.
Summing all of the local error terms we find \sum_{k=1}^{N} g_k(h) = \frac{b-a}{N} \left[ {f(a) + f(b) \over 2} + \sum_{k=1}^{N-1} f \left( a+k \frac{b-a}{N} \right) \right] - \int_a^b f(x)dx. But we also have - \sum_{k=1}^N \frac{f(\xi)h^3}{12} \leq \sum_{k=1}^N g_k(h) \leq \sum_{k=1}^N \frac{f(\xi)h^3}{12} and \sum_{k=1}^N \frac{f(\xi)h^3}{12}=\frac{f(\xi)h^3N}{12}, so that -\frac{f(\xi)h^3N}{12} \leq \frac{b-a}{N} \left[ {f(a) + f(b) \over 2} + \sum_{k=1}^{N-1} f \left( a+k \frac{b-a}{N} \right) \right]-\int_a^bf(x)dx \leq \frac{f(\xi)h^3N}{12}.
Therefore the total error is bounded by \text{error} = \left|\int_a^b f(x)\,dx - \frac{b-a}{N} \left[ {f(a) + f(b) \over 2} + \sum_{k=1}^{N-1} f \left( a+k \frac{b-a}{N} \right) \right]\right | \le \frac{f(\xi)h^3N}{12}=\frac{f(\xi)(b-a)^3}{12N^2}. \sum_{k=0}^{N-1} f(kh)h = \int_0^T f(x)\,dx + \sum_{k=1}^{\lfloor p/2\rfloor} \frac{B_{2k}}{(2k)!} \left(f^{(2k - 1)}(T) - f^{(2k - 1)}(0)\right) - (-1)^p h^p \int_0^T\tilde{B}_{p}(x/T)f^{(p)}(x) \, dx, where h := T/N, and \tilde{B}_p 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.
Algorithm
The following pseudocode describes the Trapezoidal rule. input: Real valued function, f Lower limit of integration, a Upper limit of integration, b Number of intervals, n output: An approximation of \int_{a}^{b} f(x) \,dx h ← (b - a) / n sum ← f(a) + f(b) for i ← 1 to n - 1 do x ← a + (i × h) sum ← sum + (2 × f(x)) end for return (h / 2) × sum
Numerical examples
Approximating the natural logarithm of 3
Since \int_1^3 \frac{1}{x} \,dx = \ln 3 - \ln 1 = \ln 3, we can use the trapezoidal rule to approximate the integral, thereby generating an approximation of \ln 3 .
Applying the rule with n = 3 segments gives \ln 3 = \int_1^3 \frac{1}{x} \,dx \approx \frac{1}{3} \left(1 + \frac{6}{5} + \frac{6}{7} + \frac{1}{3}\right) \ln 3 = \int_1^3 \frac{1}{x} \,dx \approx \frac{1}{6} \left(1 + \frac{3}{2} + \frac{6}{5} + 1 + \frac{6}{7} + \frac{3}{4} + \frac{1}{3}\right) = \frac{2789}{2520} \approx 1.10674603, which has absolute error of 8.13 \times 10^{-3} and a relative error of 0.74036\% . Suppose we wish to determine the number of intervals required to approximate \ln 3 to within an accuracy of 10^{-4} .
The error term is -\frac{(b-a)^3}{12N^2} f(\xi) where a=1 , b=3 , f(x)=\frac{1}{x} and \xi is some number between 1 and 3 . Since f(x) = 2x^{-3} is a decreasing function, on the internal [1,3] its maximum occurs at x=1 , which is f(1) = 2 . We therefore have \left| -\frac{(b-a)^3}{12N^2} f(\xi) \right| \le \frac{(3 - 1)^3}{12N^2} \times 2 = \frac{4}{3N^2}. We seek N such that \frac{4}{3N^2} \le 10^{-4} which gives N^{2} \ge \frac{40000}{3}.
Solving for N gives N \ge \sqrt{\frac{40000}{3}} \approx 115.47, so N=116 intervals are required to guarantee an accuracy of 10^{-4} .
Approximating the integral of a product
The following integral is given: \int_{0.1}^{1.3} 5xe^{- 2x} \,dx.
Solution {{ordered list |list-style-type=lower-alpha | The solution using the composite trapezoidal rule with 3 segments is applied as follows. \int_a^b f(x) \,dx \approx \frac{b - a}{2n} \left[ f(a) + 2\sum_{i=1}^{n-1} f(a + ih) + f(b) \right]. \begin{align} n &= 3, \\ a &= 0.1, \\ b &= 1.3, \\ h &= \frac{b - a}{n} = \frac{1.3 - 0.1}{3} = 0.4. \end{align} Using the composite trapezoidal rule formula, \int_a^b f(x) \,dx \approx \frac{b - a}{2n} \left[ f(a) + 2\left\{ \sum_{i=1}^{n-1} f(a + ih) \right\} + f(b) \right]. \begin{align} I &\approx \frac{1.3 - 0.1}{6} \left[ f(0.1) + 2\sum_{i=1}^{3-1} f(0.1 + 0.4i) + f(1.3) \right] \\ I &\approx \frac{1.3 - 0.1}{6} \left[ f(0.1) + 2\sum_{i=1}^2 f(0.1 + 0.4i) + f(1.3) \right] \\ &= 0.2 [f(0.1) + 2f(0.5) + 2f(0.9) + f(1.3)] \\ &= 0.2 \left[5 \times 0.1 \times e^{-2(0.1)} + 2(5 \times 0.5 \times e^{-2(0.5)}) + 2(5 \times 0.9 \times e^{-2(0.9)}) + 5 \times 1.3 \times e^{-2(1.3)}\right]\\ &= 0.84385. \end{align} | The exact value of the above integral can be found by integration by parts and is \int_{0.1}^{1.3} 5xe^{-2x} \,dx = 0.89387, so the true error is \begin{align} E_t &= (\text{true value}) - (\text{approximate value}) \\ &= 0.89387 - 0.84385 \\ &= 0.05002. \end{align} | The absolute relative true error is \begin{align} |\varepsilon_t| &= \left| \frac{\text{true error}}{\text{true value}} \right| \times 100\% \\ &= \left| \frac{0.05002}{0.89387} \right| \times 100\% \\ &= 5.5959\%. \end{align} }}
See also
Gaussian quadrature Newton–Cotes formulas Rectangle method Romberg's method Simpson's rule Clenshaw–Curtis quadrature Tai's model
Notes
References
External links
I. P. Mysovskikh, Trapezium formula, Encyclopedia of Mathematics, ed. M. Hazewinkel Notes on the convergence of trapezoidal-rule quadrature An implementation of trapezoidal quadrature provided by Boost.Math
Text derived from https://en.wikipedia.org/w/index.php?oldid=1378446929 under CC BY-SA 4.0; modifications have been made.