Newton–Cotes formulas

Newton–Cotes formula for $n=2$

In numerical analysis, the Newton–Cotes formulas, also called the Newton–Cotes quadrature rules or simply Newton–Cotes rules, are a group of formulas for numerical integration (also called quadrature) based on evaluating the integrand at equally spaced points. They are named after Isaac Newton, who originated the formulas, and Roger Cotes, who expanded upon Newton's work.

Newton–Cotes formulas can be useful if the value of the integrand at equally spaced points is given. If it is possible to change the points at which the integrand is evaluated, then other methods such as Gaussian quadrature and Clenshaw–Curtis quadrature are probably more suitable.

Description

It is assumed that the value of a function f defined on $[a,b]$ is known at $n+1$ equally spaced points: $a\le x_0<x_1<\dots <x_n\le b$. There are two classes of Newton–Cotes quadrature: they are called "closed" when $x_0=a$ and $x_n=b$, i.e. they use the function values at the interval endpoints, and "open" when $x_0>a$ and $x_n<b$, i.e. they do not use the function values at the endpoints. Newton–Cotes formulas using $n+1$ points can be defined (for both classes) as $$\underset{a}{\overset{b}{\int }}f(x)dx\approx \sum _{i=0}^n{w}_{i}f(x_i),$$ where

• for a closed formula, $x_i=a+ih$, with $h=\frac{b-a}{n}$,
• for an open formula, $x_i=a+(i+1)h$, with $h=\frac{b-a}{n+2}$.

The number h is called step size, $w_i$ are called weights. The weights can be computed as the integral of Lagrange basis polynomials. They depend only on $x_i$ and not on the function f. Let $L(x)$ be the interpolation polynomial in the Lagrange form for the given data points $(x_0,f(x_0)),(x_1,f(x_1)),\dots ,(x_n,f(x_n))$, then $$\underset{a}{\overset{b}{\int }}f(x)dx\approx \underset{a}{\overset{b}{\int }}L(x)dx=\underset{a}{\overset{b}{\int }}(\sum _{i=0}^{n}f(x_i)l_i(x))dx=\sum _{i=0}^{n}f(x_i)\underset{w_i}{\underbrace{\underset{a}{\overset{b}{\int }}{l}_i(x)dx}}.$$

Instability for high degree

A Newton–Cotes formula of any degree n can be constructed. However, for large n a Newton–Cotes rule can sometimes suffer from catastrophic Runge's phenomenon where the error grows exponentially for large n. Methods such as Gaussian quadrature and Clenshaw–Curtis quadrature with unequally spaced points (clustered at the endpoints of the integration interval) are stable and much more accurate, and are normally preferred to Newton–Cotes. If these methods cannot be used, because the integrand is only given at the fixed equidistributed grid, then Runge's phenomenon can be avoided by using a composite rule, as explained below.

Alternatively, stable Newton–Cotes formulas can be constructed using least-squares approximation instead of interpolation. This allows building numerically stable formulas even for high degrees.

Closed Newton–Cotes formulas

This table lists some of the Newton–Cotes formulas of the closed type. For $0\le i\le n$, let $x_i=a+ih$ where $h=\frac{b-a}{n}$, and $f_i=f(x_i)$.

Closed Newton–Cotes Formulas

n	Step size h	Common name	Formula	Error term
1	$b-a$	Trapezoidal rule	$\frac{1}{2}h(f_0+f_1)$	$-\frac{1}{12}{h}^3{f}^{(2)}(\xi )$
2	$\frac{b-a}{2}$	Simpson's rule	$\frac{1}{3}h(f_0+4f_1+f_2)$	$-\frac{1}{90}{h}^5{f}^{(4)}(\xi )$
3	$\frac{b-a}{3}$	Simpson's 3/8 rule	$\frac{3}{8}h(f_0+3f_1+3f_2+f_3)$	$-\frac{3}{80}{h}^5{f}^{(4)}(\xi )$
4	$\frac{b-a}{4}$	Boole's rule	$\frac{2}{45}h(7f_0+32f_1+12f_2+32f_3+7f_4)$	$-\frac{8}{945}{h}^7{f}^{(6)}(\xi )$

Boole's rule is sometimes mistakenly called Bode's rule, as a result of the propagation of a typographical error in Abramowitz and Stegun, an early reference book.

The exponent of the step size h in the error term gives the rate at which the approximation error decreases. The order of the derivative of f in the error term gives the lowest degree of a polynomial which can no longer be integrated exactly (i.e. with error equal to zero) with this rule. The number $\xi$ must be taken from the interval (a,b), therefore, the error bound is equal to the error term when $f(\xi )=\max (f(x)),a<x<b$.

Open Newton–Cotes formulas

This table lists some of the Newton–Cotes formulas of the open type. For $0\le i\le n$, let $x_i=a+(i+1)h$ where $h=\frac{b-a}{n+2}$, and $f_i=f(x_i)$.

Open Newton–Cotes Formulas

n	Step size h	Common name	Formula	Error term
0	$\frac{b-a}{2}$	Rectangle rule, or midpoint rule	$2h{f}_0$	$\frac{1}{3}{h}^3{f}^{(2)}(\xi )$
1	$\frac{b-a}{3}$		$\frac{3}{2}h(f_0+f_1)$	$\frac{3}{4}{h}^3{f}^{(2)}(\xi )$
2	$\frac{b-a}{4}$	Milne's rule	$\frac{4}{3}h(2f_0-f_1+2f_2)$	$\frac{14}{45}{h}^5{f}^{(4)}(\xi )$
3	$\frac{b-a}{5}$		$\frac{5}{24}h(11f_0+f_1+f_2+11f_3)$	$\frac{95}{144}{h}^5{f}^{(4)}(\xi )$

Composite rules

For the Newton–Cotes rules to be accurate, the step size h needs to be small, which means that the interval of integration $[a,b]$ must be small itself, which is not true most of the time. For this reason, one usually performs numerical integration by splitting $[a,b]$ into smaller subintervals, applying a Newton–Cotes rule on each subinterval, and adding up the results. This is called a composite rule. See Numerical integration.

See also

• Quadrature (mathematics)
• Interpolation
• Spline interpolation

References

• M. Abramowitz and I. A. Stegun, eds. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. New York: Dover, 1972. (See Section 25.4.)
• George E. Forsythe, Michael A. Malcolm, and Cleve B. Moler. Computer Methods for Mathematical Computations. Englewood Cliffs, NJ: Prentice–Hall, 1977. (See Section 5.1.)
• Josef Stoer and Roland Bulirsch. Introduction to Numerical Analysis. New York: Springer-Verlag, 1980. (See Section 3.1.)

External links

• Newton–Cotes formulas on www.math-linux.com
• Newton–Cotes Integration, numericalmathematics.com