|
|
|
|
|
Simpson's RuleIn numerical analysis, Simpson's rule (named after Thomas Simpson) is a way to get an approximation of an integral: -
by approximating by the quadratic polynomial which takes the same values as at a, b, and the midpoint m=(a+b)/2. One can use Lagrange polynomial interpolation to find an expression for this polynomial, -
f(m)\frac{(x-a)(x-b)}{(m-a)(m-b)}+ f(b)\frac{(x-a)(x-m)}{(b-a)(b-m)} . Simpson's rule then follows by an easy (albeit tedious) calculation: -
The error in approximating an integral by Simpson's rule is -
with and some number between and . We see that Simpson's rule provides an adequate approximation if the interval of integration 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 -
\frac{h}{3}\biggf(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 is the number of subintervals in which one splits with an even number, is the length of each subinterval, and for , in particular, and . See also: Newton-Cotes formulas. References - Richard L. Burden, J. Douglas Faires (2000), "Numerical Analysis, (7th Ed)", Brooks/Cole. ISBN 0534382169
|
 |
|
| Copyright 2005-2009 OnPedia.com. All Rights Reserved |
|
|