Simpson's rule

Simpson's rule can be derived by approximating the integrand f (x) (in blue) by the quadratic interpolant P (x) (in red).

In numerical analysis, Simpson's rule is a method for numerical integration, the numerical approximation of definite integrals. Specifically, it is the following approximation:

$\int _{a}^{b}f(x)\,dx\approx {\frac {b-a}{6}}\left[f(a)+4f\left({\frac {a+b}{2}}\right)+f(b)\right]$.

The method is credited to the mathematician Thomas Simpson (1710–1761) of Leicestershire, England.

Derivation

Simpson's rule can be derived in various ways.

Quadratic interpolation

One derivation replaces the integrand $f(x)$ by the quadratic polynomial $P(x)$ which takes the same values as $f(x)$ at the end points a and b and the midpoint m = (a+b) / 2. One can use Lagrange polynomial interpolation to find an expression for this polynomial,

$P(x)=f(a){\frac {(x-m)(x-b)}{(a-m)(a-b)}}+f(m){\frac {(x-a)(x-b)}{(m-a)(m-b)}}+f(b){\frac {(x-a)(x-m)}{(b-a)(b-m)}}.$

An easy (albeit tedious) calculation shows that

$\int _{a}^{b}P(x)\,dx={\frac {b-a}{6}}\left[f(a)+4f\left({\frac {a+b}{2}}\right)+f(b)\right].$

Averaging the midpoint and the trapezoidal rules

Another derivation constructs Simpson's rule from two simpler approximations: the midpoint rule

$M=(b-a)f\left({\frac {a+b}{2}}\right)$

and the trapezoidal rule

$T={\tfrac {1}{2}}(b-a)(f(a)+f(b)).$

The errors in these approximations are

$-{\tfrac {1}{24}}(b-a)^{3}f''(a)+O((b-a)^{4})\quad {\text{and}}\quad {\tfrac {1}{12}}(b-a)^{3}f''(a)+O((b-a)^{4}),$

respectively. It follows that the leading error term vanishes if we take the weighted average

${\frac {2M+T}{3}}.$

This weighted average is exactly Simpson's rule.

Using another approximation (for example, the trapezoidal rule with twice as many points), it is possible to take a suitable weighted average and eliminate another error term. This is Romberg's method.

Undetermined coefficients

The third derivation starts from the ansatz

${\frac {1}{b-a}}\int _{a}^{b}f(x)\,dx\approx \alpha f(a)+\beta f\left({\frac {a+b}{2}}\right)+\gamma f(b).$

The coefficients α, β and γ can be fixed by requiring that this approximation be exact for all quadratic polynomials. This yields Simpson's rule.

Error

The error in approximating an integral by Simpson's rule is

$\left|{\frac {(b-a)^{5}}{2880}}f^{(4)}(\xi )\right|,$

where $\xi$ is some number between $a$ and $b$.

The error is asymptotically proportional to $(b-a)^{5}$. However, the above derivations suggest an error proportional to $(b-a)^{4}$. Simpson's rule gains an extra order because the points at which the integrand is evaluated are distributed symmetrically in the interval [a, b].

Note that Simpson's rule provides exact results for any polynomial of degree three or less, since the error term involves the fourth derivative of f.

Composite Simpson's rule

If the interval of integration $[a,b]$ is in some sense "small", then Simpson's rule will provide an adequate approximation to the exact integral. By small, what we really mean is that the function being integrated is relatively smooth over the interval $[a,b]$. For such a function, a smooth quadratic interpolant like the one used in Simpson's rule will give good results.

However, it is often the case that the function we are trying to integrate is not smooth over the interval. Typically, this means that either the function is highly oscillatory, or it lacks derivatives at certain points. In these cases, Simpson's rule may give very poor results. One common way of handling this problem is by breaking up the interval $[a,b]$ into a number of small subintervals. Simpson's rule is then applied to each subinterval, with the results being summed to produce an approximation for the integral over the entire interval. This sort of approach is termed the composite Simpson's rule.

Suppose that the interval $[a,b]$ is split up in $n$ subintervals, with $n$ an even number. Then, the composite Simpson's rule is given by

$\int _{a}^{b}f(x)\,dx\approx {\frac {h}{3}}{\bigg [}f(x_{0})+2\sum _{j=1}^{n/2-1}f(x_{2j})+4\sum _{j=1}^{n/2}f(x_{2j-1})+f(x_{n}){\bigg ]},$

where $x_{j}=a+jh$ for $j=0,1,...,n-1,n$ with $h=(b-a)/n$; in particular, $x_{0}=a$ and $x_{n}=b$. The above formula can also be written as

$\int _{a}^{b}f(x)\,dx\approx {\frac {h}{3}}{\bigg [}f(x_{0})+4f(x_{1})+2f(x_{2})+4f(x_{3})+2f(x_{4})+\cdots +4f(x_{n-1})+f(x_{n}){\bigg ]}.$

The error committed by the composite Simpson's rule is bounded (in absolute value) by

${\frac {h^{4}}{180}}(b-a)\max _{\xi \in [a,b]}|f^{(4)}(\xi )|,$

where $h$ is the "step length", given by $h=(b-a)/n.$

This formulation splits the interval $[a,b]$ in subintervals of equal length. In practice, it is often advantageous to use subintervals of different lengths, and concentrate the efforts on the places where the integrand is less well-behaved. This leads to the adaptive Simpson's method.

Alternative extended Simpson's rule

This is another formulation of a composite Simpson's rule: instead of applying Simpson's rule to disjoint segments of the integral to be approximated, Simpson's rule is applied to overlapping segments, yielding:

$\int _{a}^{b}f(x)\,dx\approx {\frac {h}{48}}{\bigg [}17f(x_{0})+59f(x_{1})+43f(x_{2})+49f(x_{3})+48\sum _{i=4}^{n-4}f(x_{i})+49f(x_{n-3})+43f(x_{n-2})+59f(x_{n-1})+17f(x_{n}){\bigg ]}.$

Simpson's 3/8 rule

Simpson's 3/8 rule is another method for numerical integration proposed by Thomas Simpson. It is based upon a cubic interpolation rather than a quadratic interpolation. Simpson's 3/8 rule is as follows:

$\int _{a}^{b}f(x)\,dx\approx {\frac {3h}{8}}\left[f(a)+3f\left({\frac {2a+b}{3}}\right)+3f\left({\frac {a+2b}{3}}\right)+f(b)\right]={\frac {(b-a)}{8}}\left[f(a)+3f\left({\frac {2a+b}{3}}\right)+3f\left({\frac {a+2b}{3}}\right)+f(b)\right].$

The error of this method is:

$\left|{\frac {(b-a)^{5}}{6480}}f^{(4)}(\xi )\right|,$

where $\xi$ is some number between $a$ and $b$. Thus, the 3/8 rule is about twice as accurate as the standard method, but it uses one more function value. A composite 3/8 rule also exists, similarly as above.

MATLAB implementation

Simpson's rule can be implemented in MATLAB as follows:

function [I]=simpson(f,a,b,J,N)
%does a simpson integration of the function f.
%f is the function to be integrated. 
%a,b are the indexes of the segment to be integrated
%J is the scale of the index (the jacobian). N is the number of subsections.

	h=(b-a)/N;  %h is the length of each segment
	n=0:N-1;	
	P=f(a+round(n*h))+4*f(a+round(h*(n+0.5)))+f(a+round(h*(n+1)));
	I=sum(P)*h*J/6;
end

Python implementation

Here is an implementation of the Composite Simpson's rule in Python.

def simpson(f, a, b, N=100):
    "Approximate the definite integral of f from a to b, using Composite Simpson's rule"
    h = float(b-a)/N # this is factored out of the loop just for efficiency
    return  h/3 * ( f(a) + sum(2**(k%2+1) * f(a + h*k) for k in range(1,N)) + f(b) )

See also

• Rectangle method
• Trapezoidal rule

References

• Atkinson, Kendall A. (1989). An Introduction to Numerical Analysis (2nd edition ed.). John Wiley & Sons. ISBN 0-471-50023-2. {{cite book}}: |edition= has extra text (help)
• Burden, Richard L. and Faires, J. Douglas (2000). Numerical Analysis (7th edition ed.). Brooks/Cole. ISBN 0-534-38216-9. {{cite book}}: |edition= has extra text (help)CS1 maint: multiple names: authors list (link)
• Matthews, John H. (2004). "Simpson's 3/8 Rule for Numerical Integration". Numerical Analysis - Numerical Methods Project. California State University, Fullerton. Retrieved 11 November 2008.
• Press, William H., Brian P. Flannery, William T. Vetterling, and Saul A. Teukolsky (1989). Numerical Recipes in Pascal: The Art of Scientific Computing. Cambridge University Press. ISBN 0521375169.{{cite book}}: CS1 maint: multiple names: authors list (link)
• Süli, Endre and Mayers, David (2003). An Introduction to Numerical Analysis. Cambridge University Press. ISBN 0-521-81026-4 (hardback), ISBN 0-521-00794-1 (paperback). {{cite book}}: Check |isbn= value: invalid character (help)CS1 maint: multiple names: authors list (link)
• Kaw, Autar; Kalu, Egwu (2008), Numerical Methods with Applications (1st ed.), [1] {{citation}}: External link in |publisher= (help).

External links

• Weisstein, Eric W. "Simpson's Rule". MathWorld.
• Simpson's Rule for Numerical Integration
• Application of Simpson's Rule - Earthwork Excavation
• Simpson's 1/3rd rule of integration - Notes, PPT, Mathcad, Matlab, Mathematica, Maple at Numerical Methods for STEM undergraduate
• A detailed description of a computer implementation is described by Dorai Sitaram in Teach Yourself Scheme in Fixnum Days, Appendix C

---

Code for Simpson's rule at PlanetMath.