Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
34 views7 pages

Sec4 3 Numerical - Integration

The document describes numerical integration techniques called quadrature formulas. These approximate integrals by computing them as sums. The three main formulas discussed are: 1) The Trapezoidal Rule, which approximates the integral of a function as the area of trapezoids under the function. It has a degree of precision of 1. 2) Simpson's Rule, which uses a third degree interpolating polynomial to approximate the integral. It has a higher degree of precision of 3. 3) Closed and open Newton-Cotes formulas, which are generalizations of Trapezoidal and Simpson's rules using more interpolation points. Their degree of precision depends on whether the number of points is even or odd.

Uploaded by

Florin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
34 views7 pages

Sec4 3 Numerical - Integration

The document describes numerical integration techniques called quadrature formulas. These approximate integrals by computing them as sums. The three main formulas discussed are: 1) The Trapezoidal Rule, which approximates the integral of a function as the area of trapezoids under the function. It has a degree of precision of 1. 2) Simpson's Rule, which uses a third degree interpolating polynomial to approximate the integral. It has a higher degree of precision of 3. 3) Closed and open Newton-Cotes formulas, which are generalizations of Trapezoidal and Simpson's rules using more interpolation points. Their degree of precision depends on whether the number of points is even or odd.

Uploaded by

Florin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

4.

3 Numerical Integration
Numerical quadrature: Numerical method to compute ∫ ( ) approximately by a sum ∑ ( ) .
The interpolation nodes are given as:
( ( ))
𝑃𝑁 (𝑥)
( ( ))
( ( ))

( ( ))
Here By Lagrange Interpolation Theorem (Thm 3.3):
( ) ( ) ( )
( ) ∑ ( ) ( ) ( ( )) (1)
( )

( )
∫ ( ) ∫ ∑ ( ) ( ) ∫ ( ) ( ) ( ( ))
( )

Quadrature formula: ∫ ( ) ∑ ( ) with ∫ ( ) .


( )
Error: ( ) ( )
∫ ( ) ( ) ( ( ))

1
The Trapezoidal Rule (obtained by first Lagrange interpolating polynomial)

Let ; and (see Figure 1)

Figure 1 Trapezoidal Rule

( )
∫ ( ) ∫ [ ( ) ( ) ] ∫ ( )( ) ( ( ))
( ) ( )
Thus

( ) [ ( ) ( )] ( )( )

.
Error term

Note: for Trapezoidal rule.

2
The Simpson’s (1/3) Rule (error obtained by third Taylor polynomial)
Let ; and (see Figure 2)
( )
( ) ( ) ( )( ) ( )
( )
( ) ( )
( ) ( )

𝑝(𝑥) ( )
∫ ( ) ∫ ( ( ) ( )( ) ( )
( )
( ) ( ( ))
𝑓(𝑥) ( ) ( ) )
( )
( )
( ) ( )
𝑥 𝑎 𝑥 𝑥 𝑏
Figure 2 Simpson's Rule

( )
Now approximate ( ) [ ( ) ( ) ( )] ( )
Thus

( ) ( )
∫ ( ( ) ( ) ( )) ( )

Error term

Note: for Simpson’s rule.

3
Precision
Definition: The degree of accuracy or precision of a quadrature formula is the largest positive integer such that the formula
is exact for , for each .

Trapezoidal rule has degree of accuracy one.

∫ ; ∫ [ ] Trapezoidal rule is exact for (or ).

∫ = . ∫ [ ] . Trapezoidal rule is exact for .

∫ . ∫ [ ] Trapezoidal rule is NOT exact for .

Simpson’s rule has degree of accuracy three.

Remark: The degree of precision of a quadrature formula is if and only if the error is zero for all polynomials of degree
, but is NOT zero for some polynomial of degree .

Closed Newton-Cotes Formulas


𝑃𝑁 (𝑥) Let and . for .

∫ ( ) ∑ ( ) with ∫ ( ) .
Here ( ) is the ith Lagrange base polynomial of degree N.

Figure 3 Closed Newton-Cotes Formulas


4
Theorem 4.2 Suppose that ∑ ( ) is the (n+1)-point closed Newton-Cotes formula with and .
( )
( )
There exists ( ) for which ∫ ( ) ∑ ( ) ∫ ( ) ( ) ,
( )

if is even and [ ], and


( )
( )
∫ ( ) ∑ ( ) ∫ ( ) ( )
( )

if is odd and [ ].
Remark: is even, degree of precision is is odd, degree of precision is
Examples. N=1: Trapezoidal rule; N=2: Simpson’s rule.
N=3: Simpson’s Three-Eighths rule

( ) ( )
∫ ( ( ) ( ) ( ) ( )) ( ) where ; .

f(x)

𝑃𝑛 (𝑥)

a=x x x b=x
-1 0 n n+1

Figure 4 Open Newton-Cotes Formula 5


Open Newton-Cotes Formula
See Figure 4. Let ; and for . This implies .
Theorem 4.3 Suppose that ∑ ( ) is the (n+1)-point open Newton-Cotes formula with and
( )
( )
. There exists ( ) for which ∫ ( ) ∑ ( ) ∫ ( ) ( ) ,
( )

if is even and [ ], and


( )
( )
∫ ( ) ∑ ( ) ∫ ( ) ( )
( )

if is odd and [ ].
Examples of open Newton-Cotes formulas
n=0: Midpoint rule (Figure 5)

( ) ( ) ( )
∫ ( )
f(x)
where .
𝑝 (𝑥)

a=x x
-1
0 b=x
1
0

Figure 5 Midpoint rule


6
( ) ( )
n=1: ∫ [ ( ) ( )] ( ) where .

( ) ( ) ( ) ( )] ( )
n=2: ∫ [ ( ) where .

You might also like