logo

Newton-Cotes Integration Formulas 📂Numerical Analysis

Newton-Cotes Integration Formulas

Definition 1

Assume that f:[a,b]Rf : [a,b] \to \mathbb{R} is integrable over [a,b][a,b] and [a,b][a,b] is divided into nodes with a constant interval of h:=ban\displaystyle h:= {{b-a} \over {n}}, like in a=x0<<xn=ba = x_{0} < \cdots < x_{n} = b. The numerical integration operator InpI_{n}^{p} defined as follows is called the Newton-Cotes formula. Inp(f):=i=0nwif(xi) I_{n}^{p} (f) := \sum_{i=0}^{n} w_{i} f ( x_{i} )


  • For i=0,1,,ni=0,1,\cdots , n, xi:=a+ihx_{i} := a + i h, and lil_{i} represents the polynomial li(x):=ij(xxjxixj)\displaystyle l_{i} (x) := \prod_{i \ne j} \left( {{ x - x_{j} } \over { x_{i} - x_{j} }} \right) used in the Lagrange formula.
  • The weight wiw_{i} is defined as wi:=abli(x)dx\displaystyle w_{i} := \int_{a}^{b} l_{i} (x) dx.

Error

If fCn+2[a,b]f \in C^{n+2} [a,b], then Cn:={1(n+2)!0nμ2(μ1)(μn)dμ,n is even1(n+1)!0nμ(μ1)(μn)dμ,n is odd C_{n} := \begin{cases} \displaystyle {{1} \over {(n+2)! }} \int_{0}^{n} \mu^2 ( \mu - 1 ) \cdots ( \mu - n ) d \mu & , n \text{ is even} \\ \displaystyle {{1} \over {(n+1)! }} \int_{0}^{n} \mu ( \mu - 1 ) \cdots ( \mu - n ) d \mu & , n \text{ is odd} \end{cases} and for some ξ[a,b] \xi \in [a,b], Enp(f)={Cnhn+3f(n+2)(ξ),n is evenCnhn+2f(n+1)(ξ),n is odd E_{n}^{p} (f) = \begin{cases} C_{n} h^{n+3} f^{(n+2)} ( \xi ) & , n \text{ is even} \\ C_{n} h^{n+2} f^{(n+1)} ( \xi ) & , n \text{ is odd} \end{cases}

Specialization

If the Trapezoidal Rule uses the 11th polynomial interpolation and the Simpson’s Rule uses 22th polynomial interpolation, it is natural to consider generalizing for the ppth degree. The Newton-Cotes integration formula includes all rules that can be made by increasing the degree of the polynomial used for approximation.

Trapezoidal Rule

  • (1) p=1p=1: I1(f):=h[f(a)+f(b)]I^{1} (f) := h [ f(a) + f(b) ]

Simpson’s Rule

  • (2) p=2p=2: I2(f):=h3[f(a)+4f(a+b2)+f(b)]I^{2} (f) := {{h} \over {3}} \left[ f(a) + 4 f \left( {{a + b} \over {2}} \right) + f(b) \right]

383-8 Rule

  • (3) p=3p=3: I3(f):=3h8[f(a)+3f(a+h)+3f(bh)+f(b)]I^{3} (f) := {{3h} \over {8}} \left[ f(a) + 3 f ( a + h ) + 3 f ( b - h ) + f(b) \right]

Boole’s Rule

  • (4) p=4p=4: I4(f):=2h45[7f(a)+32f(a+h)+12f(a+b2)+32f(bh)+7f(b)]I^{4} (f) := {{2h} \over {45}} \left[ 7 f(a) + 32 f ( a + h ) + 12 f \left( {{a + b} \over {2}} \right) + 32 f(b - h) + 7 f(b) \right]

  1. Atkinson. (1989). An Introduction to Numerical Analysis(2nd Edition): p263. ↩︎