In numerical analysis, Simpson's rule (named after Thomas Simpson) is a way to get an approximation of an integral:
by approximating f(x) by the quadratic polynomial P(x)
which takes the same values as f(x) at a, b, and the midpoint
m=(a+b)/2. One can use Lagrange polynomial interpolation
to find an expression for this polynomial,
.
Simpson's rule then follows by an easy (albeit tedious) calculation:
![\int_{a}^{b} f(x) dx\approx \int_{a}^{b} P(x) dx =\frac{b-a}{6}\left[f(a) + 4f\left(\frac{a+b}{2}\right)+f(b)\right].](a/../upload/math/21de16e1482ea5808b6b5974a9d5055b.png)
The error in approximating an integral by Simpson's rule is
with h = (b - a) / 2 and ξ some number between a and b.
We see that Simpson's rule provides an adequate approximation if the interval of integration [a,b] is small, which does not happen most of the time. The obvious solution is to split the interval of integration in small subintervals, apply Simpson's rule on each subinterval, and add up the results. In this way one obtains the composite Simpson's rule
![\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],](a/../upload/math/4024d50a16ecfb7727688a2c78a78c73.png)
where n is the number of subintervals in which one splits [a,b] with n an even number, h = (b - a) / n is the length of each subinterval, and xi = a + ih for 
,
in particular, x0 = a and xn = b.
See also: Newton-Cotes formulas.
References
- Richard L. Burden, J. Douglas Faires (2000), "Numerical Analysis, (7th Ed)", Brooks/Cole. ISBN 0534382169