0% found this document useful (0 votes)
1 views11 pages

Final

The document presents solutions to systems of equations using the Gauss elimination and Gauss-Jordan elimination methods, detailing the steps and calculations involved. It also includes finite difference formulas for the first and second derivatives, providing various methods for numerical differentiation. The document concludes with an example illustrating the application of these methods.
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)
1 views11 pages

Final

The document presents solutions to systems of equations using the Gauss elimination and Gauss-Jordan elimination methods, detailing the steps and calculations involved. It also includes finite difference formulas for the first and second derivatives, providing various methods for numerical differentiation. The document concludes with an example illustrating the application of these methods.
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/ 11

Problem 4.

4: Gauss Elimination Method


Solve the following system of equations using the Gauss elimination method.
Given system of equations:
2x₁ + x₂ − x₃ + 2x₄ = 0
x₁ − 2x₂ + x₃ − 4x₄ = 3
3x₁ − x₂ − 2x₃ − x₄ = −3
−x₁ + 2x₂ + x₃ − 2x₄ = 13
The system of equations in matrix form is:
2 1 −1 2 x1 0
1 −2 1 −4 x2 3
[ ] [x ] = [ ]
3 −1 −2 −1 3 −3
−1 2 1 −2 x4 13
a21 1 a31 3 a −1
With m21 = = = 0.5, m31 = = = 1.5, m41 = 41 = = −0.5, the
a11 2 a11 2 a11 2
first pass with Gaussian elimition yields:
2 1 −1 2 x1 0
0 −2.5 1.5 −5 2 x 3
[ ] [x ] = [ ]
0 −2.5 −0.5 −4 3 −3
0 2.5 0.5 −1 x4 13
a′32 −2.5 a′42 2.5
Next, with m32 = = = 1, m42 = = = −1, the second pass with
a′22 −2.5 a′22 −2.5
Gaussian elimination yields:
2 1 −1 2 x1 0
0 −2.5 1.5 −5 x2 3
[ ] [x ] = [ ]
0 0 −2 1 3 −6
0 0 2 −6 x4 16
a′′
43 2
Next, with m43 = = = −1, the third pass with Gaussian elimination
a′′
33 −2
yields:
2 1 −1 2 x1 0
0 −2.5 1.5 −5 x2 3
[ ] [x ] = [ ]
0 0 −2 1 3 −6
0 0 0 −5 x4 10
10 −6−1(−2)
Using back substitution, x4 = = −2, x3 = = 2, x2 =
−5 −2
3−(−5)(−2)−(1.5)(2) 0−(2)(−2)−(−1)(2)−(1)(4)
= 4, x1 = = 1. Thus, the solution is
−2.5 2
[x1 x2 x3 x4 ] = [1 4 2 −2]
Problem 4.9: Gauss–Jordan Elimination Method
Solve the following system of equations using the Gauss–Jordan elimination
method.
Given system of equations:
4x₁ + 3x₂ + 2x₃ + x₄ = 17
2x₁ − x₂ + 2x₃ − 4x₄ = 11
x₁ + 2x₂ − 2x₃ − x₄ = 8
−2x₁ + 4x₂ + 5x₃ − x₄ = 15
First, form the augmented matrix:
4 3 2 1 17
2 −1 2 −4 11
[ ]
1 2 −2 −1 8
−2 4 5 −1 15
The pivot element a11 = 4. Normalize row 1 by dividing by 4.
1 0.75 0.5 0.25 4.25 ←
2 −1 2 −4 11 ← −(2)[1 0.75 0.5 0.25 4.25]
[ ] =
1 2 −2 −1 8 ← −(1)[1 0.75 0.5 0.25 4.25]
−2 4 5 −1 15 ← −(−2)[1 0.75 0.5 0.25 4.25]
1 0.75 0.5 0.25 4.25
0 −2.5 1 −4.5 2.5
[ ]
0 1,25 −2.5 −1.25 3.75
0 5.5 6 −0.5 23.5
Normalize row 2 by dividing by -2.5 and eliminate above/below:

1 0.75 0.5 0.25 4.25 ← −(0.75)[0 1 −0.4 1.8 −1]


0 1 −0.4 1.8 −1 ←
[ ] =
0 1,25 −2.5 −1.25 3.75 ← −(1.25)[0 1 −0.4 1.8 −1]
0 5.5 6 −0.5 23.5 ← −(5.5)[0 1 −0.4 1.8 −1]
1 0 0.8 −1.1 5
0 1 −0.4 1.8 −1
[ ]
0 0 −2 −3.5 5
0 0 8.2 −10.4 29
Normalize row 3 by dividing by -2 and eliminate above/below:
1 0 0.8 −1.1 5 ← −(0.8)[0 0 1 1.75 −2.5]
0 1 −0.4 1.8 −1 ← −(−0.4)[0 0 1 1.75 −2.5]
[ ] =
0 0 1 1.75 −2.5 ←
0 0 8.2 −10.4 29 ← −(8.2)[0 0 1 1.75 −2.5]
1 0 0 −2.5 7
0 1 0 2.5 −2
[ ]
0 0 1 1.75 −2.5
0 0 0 −24.75 49.5
Normalize row 4 by dividing by -24.75 and eliminate above:
1 0 0 −2.5 7 ← −(−2.5)[0 0 0 1 −2]
0 1 0 2.5 −2 ← −(2.5)[0 0 0 1 −2]
[ ] =
0 0 1 1.75 −2.5 ← −(1.75)[0 0 0 1 −2]
0 0 0 1 −2 ←
1 0 0 0 2
0 1 0 0 3
[ ]
0 0 1 0 1
0 0 0 1 −2
Final solution: x₁ = 2, x₂ = 3, x₃ = 1, x₄ = −2
Chapter 8:
8.1 Finite Difference Formulas of First Derivative
8.1.1 Two-point forward difference formula for first derivative

′(
f ′′ (xi ) 2 f ′′′ (xi ) 3 f (4) (xi ) 4
f(xi+1 ) = f(xi ) + f xi )h + h + h + h +⋯
2! 3! 4!
where h = xi+1 − xi
Note: above is also Taylor series formula of f(xi+1 ).
Rewritten as:

′(
f ′′ (ξ) 2
f(xi+1 ) = f(xi ) + f xi )h + h
2!
where ξ is a value of x between xi and xi+1
′( )
f(xi+1 ) − f(xi ) f ′′ (ξ)
→ f xi = − h
h 2!
f ′′ (ξ)
truncation error = − h = O ( h)
2!
′( )
f(xi+1 ) − f(xi )
→ f xi = + O(h)
h
8.1.2 Two-point backward difference formula for first derivative
′′ ( ) ′′′ ( ) (4) ( )
f x i f x i f xi 4
f(xi−1 ) = f(xi ) − f ′ (xi )h + h2 − h3 + h +⋯
2! 3! 4!

f ′′ (ξ) 2
f(xi−1 ) = f(xi ) − f (xi )h + h
2!
′( )
f(xi ) − f(xi−1 ) f ′′ (ξ)
→ f xi = + h
h 2!
f ′′ (ξ)
truncation error = h = O ( h)
2!
f(xi ) − f(xi−1 )
→ f ′ (x i ) = + O(h)
h
8.1.3 Two-point central difference formula for first derivative

′(
f ′′ (xi ) 2 f ′′′ (ξ1 ) 3
f(xi+1 ) = f(xi ) + f xi )h + h + h
2! 3!

f ′′ (xi ) 2 f ′′′ (ξ2 ) 3
f(xi−1 ) = f(xi ) − f (xi )h + h − h
2! 3!
′′′ ( ) ′′′ ( )
f ξ 1 f ξ2 3
f(xi+1 ) − f(xi−1 ) = 2f ′ (xi )h + h3 + h
3! 3!
′( )
f(xi+1 ) − f(xi−1 ) f ′′′ (ξ1 ) f ′′′ (ξ2 ) 2
→ f xi = −( + )h
2h 2.3! 2.3!
f(xi+1 ) − f(xi−1 )
→ f ′ (x i ) = + O ( h2 )
2h
f ′′′ (ξ1 ) f ′′′ (ξ2 ) 2
truncation error = − ( + ) h = O(h2 )
2.3! 2.3!
8.1.4 Three-point forward and backward difference formulas for first derivative
Forward:

′(
f ′′ (xi ) 2 f ′′′ (ξ1 ) 3
f(xi+1 ) = f(xi ) + f xi )h + h + h
2! 3!

f ′′ (xi ) 2
f ′′′ (ξ2 )
f(xi+2 ) = f(xi ) + f (xi )2h + (2h) + (2h)3
2! 3!

f ξ1 3 f ′′′ (ξ2 )
′′′ ( )
4f(xi+1 ) − f(xi+2 ) = 3f(xi ) + 2f (xi )h + 4 h − (2h)3
3! 3!
′ 2
4f(xi+1 ) − f(xi+2 ) = 3f(xi ) + 2f (xi )h − 2hO(h )
−3f(xi ) + 4f(xi+1 ) − f(xi+2 )
f ′ (x i ) = + O(h2 )
2h
Similar, three point backward
3f(xi ) − 4f(xi−1 ) + f(xi−2 )
f ′ (x i ) = + O(h2 )
2h
Example 8-3: f(x) = x 3 . Calculate the first derivative at point x = 3 numerically
with the 3-point forward difference formula, using:
a. points x = 3, x = 4, x = 5
x 3 4 5
f′(x) 27 64 125
−3f(3) + 4f(4) − f(5) −3.27 + 4.64 − 125
f ′ (3) = = = 25
2.1 2
25 − 27
error = | | . 100% = 7.41%
27
8.2 Finite Difference Formulas of Second Derivative
8.2.1 Three-point central difference formula for the second derivative
f ′′ (xi ) 2 f ′′′ (xi ) 3 f (4) (xi ) 4
′(
f(xi+1 ) = f(xi ) + f xi )h + h + h + h +⋯
2! 3! 4!

f ′′ (xi ) 2 f ′′′ (xi ) 3 f (4) (xi ) 4
f(xi−1 ) = f(xi ) − f (xi )h + h − h + h +⋯
2! 3! 4!
f ′′ (xi ) 2 f (4) (xi ) 4
f(xi+1 ) + f(xi−1 ) = 2f(xi ) + 2 h +2 h +⋯
2! 4!
′′ ( )
f(xi−1 ) − 2f(xi ) + f(xi+1 )
f xi = 2
+ O(h2 )
h
8.2.2 Three-point forward and backward difference formula for the second
derivative
Forward:

′′ (
f(xi ) − 2f(xi+1 ) + f(xi+2 )
f xi ) = 2
+ O(h2 )
h
Backward:
f(xi−2 ) − 2f(xi−1 ) + f(xi )
f ′′ (xi ) = 2
+ O(h2 )
h

First derivative
Method Formula Truncatio
n Error
2-point f(xi+1 ) − f(xi ) O(h)
f ′ (x i ) =
forward h
3-point ′(
−3f(xi ) + 4f(xi+1 ) − f(xi+2 ) O ( h2 )
)
f xi =
forward 2h
2-point f(xi ) − f(xi−1 ) O(h)
f ′ (x i ) =
backwar h
d
3-point ′(
3f(xi ) − 4f(xi−1 ) + f(xi−2 ) O ( h2 )
f xi ) =
backwar 2h
d
2-point ′(
f(xi+1 ) − f(xi−1 ) O ( h2 )
)
f xi =
central 2h
4-point ′(
f(xi−2 ) − 8f(xi−1 ) + 8f(xi+1 ) − f(xi+2 ) O(h4 )
f xi ) =
central 12h
Second derivative
Method Formula Truncatio
n Error
3-point f(xi ) − 2f(xi+1 ) + f(xi+2 ) O(h)
f ′′ (xi ) =
forward h2
4-point ′′ (
2f(xi ) − 5f(xi+1 ) + 4f(xi+2 ) − f(xi+3 ) O ( h2 )
f )
xi =
forward h2
3-point f(xi−2 ) − 2f(xi−1 ) + f(xi ) O(h)
f ′′ (xi ) =
backwar h2
d
4-point ′′ (
2f(xi ) − 5f(xi−1 ) + 4f(xi−2 ) − f(xi−3 ) O ( h2 )
f xi ) =
backwar h2
d
3-point ′′ (
f(xi−1 ) − 2f(xi ) + f(xi+1 ) O ( h2 )
f )
xi =
central h2
5-point f ′′ (xi ) O(h4 )
central −f(xi−2 ) + 16f(xi−1 ) − 30f(xi ) + 16f(xi+1 ) − f(xi+2 )
=
12h2
Third derivative
Method Formula Truncatio
n Error
4-point −f(xi ) + 3f(xi+1 ) − 3f(xi+2 ) + f(xi+3 ) O(h)
f ′′′ (xi ) =
forward h3
5-point f ′′′ (xi ) O ( h2 )
forward −5f(xi ) + 18f(xi+1 ) − 24f(xi+2 ) + 14f(xi+3 )
−3f(xi+4 )
=
2h3
4-point −f(xi−3 ) + 3f(xi−2 ) − 3f(xi−1 ) + f(xi ) O(h)
f ′′′ (xi ) =
backwar h3
d
5-point f ′′′ (xi ) O ( h2 )
backwar 3f(xi−4 ) − 14f(xi−3 ) + 24f(xi−2 ) − 18f(xi−1 )
d +5f(xi )
=
2h3
4-point −f(xi−2 ) + 2f(xi−1 ) − 2f(xi+1 ) + f(xi+2 ) O ( h2 )
f ′′′ (xi ) =
central 2h3
6-point f(xi−3 ) − 8f(xi−2 ) + 13f(xi−1 ) − 13f(xi+1 ) O(h4 )
central +8f(xi+2 ) − f(xi+3 )
f ′′′ (xi ) =
8h3

Chapter 9: Integration
9.1.1 Rectangle method
𝑏 𝑏
𝐼(𝑓 ) = ∫ 𝑓(𝑥 )𝑑𝑥 = ∫ 𝑓(𝑎)𝑑𝑥 = 𝑓(𝑎)(𝑏 − 𝑎)
𝑎 𝑎
𝑏
𝑜𝑟 𝐼(𝑓 ) = ∫ 𝑓(𝑏)𝑑𝑥 = 𝑓(𝑏)(𝑏 − 𝑎)
𝑎

9.1.2 Composite rectangle


Domain [𝑎, 𝑏] is divided into N subintervals by 𝑁 + 1 points 𝑥1 , 𝑥2 , … , 𝑥𝑁+1
where 𝑥1 = 𝑎, 𝑥𝑁+1 = 𝑏
𝑏
𝐼(𝑓 ) = ∫ 𝑓 (𝑥 )𝑑𝑥
𝑎
= 𝑓 (𝑥1 )(𝑥2 − 𝑥1 ) + 𝑓 (𝑥2 )(𝑥3 − 𝑥2 ) + ⋯ + 𝑓 (𝑥𝑁 )(𝑥𝑁+1 − 𝑥𝑁 )
𝑁

= ∑[𝑓(𝑥𝑖 )(𝑥𝑖+1 − 𝑥𝑖 )]
𝑖=1

When the subintervals have the same width h:


𝑏 𝑁

𝐼(𝑓 ) = ∫ 𝑓(𝑥 )𝑑𝑥 = ℎ ∑ 𝑓(𝑥𝑖 )


𝑎 𝑖=1

9.2.1 Midpoint
𝑏 𝑏
𝑎+𝑏 𝑎+𝑏
𝐼 (𝑓 ) = ∫ 𝑓 (𝑥 )𝑑𝑥 = ∫ 𝑓 ( ) 𝑑𝑥 = 𝑓 ( ) (𝑏 − 𝑎)
𝑎 𝑎 2 2
9.2.2 Composite Midpoint
Domain [𝑎, 𝑏] is divided into N subintervals by 𝑁 + 1 points 𝑥1 , 𝑥2 , … , 𝑥𝑁+1
where 𝑥1 = 𝑎, 𝑥𝑁+1 = 𝑏
𝑏
𝐼 (𝑓 ) = ∫ 𝑓 (𝑥 )𝑑𝑥
𝑎
𝑥1 + 𝑥2 𝑥2 + 𝑥3
= 𝑓( ) (𝑥2 − 𝑥1 ) + 𝑓 ( ) (𝑥3 − 𝑥2 ) + ⋯
2 2
𝑥𝑁 + 𝑥𝑁+1
+𝑓( ) (𝑥𝑁+1 − 𝑥𝑁 )
2
𝑁
𝑥𝑖 + 𝑥𝑖+1
= ∑[𝑓( )(𝑥𝑖+1 − 𝑥𝑖 )]
2
𝑖=1

When the subintervals have the same width h:


𝑏 𝑁
𝑥𝑖 + 𝑥𝑖+1
𝐼(𝑓 ) = ∫ 𝑓(𝑥 )𝑑𝑥 = ℎ ∑ 𝑓( )
𝑎 2
𝑖=1

9.3.1 Trapezoidal
𝑏 𝑏
𝑓(𝑏) − 𝑓(𝑎)
𝐼(𝑓 ) = ∫ 𝑓(𝑥 )𝑑𝑥 = ∫ (𝑓(𝑎) + (𝑥 − 𝑎) )𝑑𝑥
𝑎 𝑎 𝑏 − 𝑎
1 𝑓 (𝑎 ) + 𝑓 (𝑏 )
= 𝑓 (𝑎)(𝑏 − 𝑎) + [𝑓 (𝑏) − 𝑓 (𝑎)](𝑏 − 𝑎) = (𝑏 − 𝑎)
2 2
9.3.2 Composite Trapezoidal
Domain [𝑎, 𝑏] is divided into N subintervals by 𝑁 + 1 points 𝑥1 , 𝑥2 , … , 𝑥𝑁+1
where 𝑥1 = 𝑎, 𝑥𝑁+1 = 𝑏
𝑏
𝐼 (𝑓 ) = ∫ 𝑓 (𝑥 )𝑑𝑥
𝑎
𝑓(𝑥1 ) + 𝑓(𝑥2 ) 𝑓 (𝑥2 ) + 𝑓 (𝑥3 )
= ( )
𝑥2 − 𝑥1 + (𝑥3 − 𝑥2 ) + ⋯
2 2
𝑓(𝑥𝑁 ) + 𝑓 (𝑥𝑁+1 )
+ (𝑥𝑁+1 − 𝑥𝑁 )
2
𝑁
1
= ∑[𝑓 (𝑥𝑖 ) + 𝑓(𝑥𝑖+1 )](𝑥𝑖+1 − 𝑥𝑖 )]
2
𝑖=1

When the subintervals have the same width h:


𝑏 𝑁 𝑁−1
ℎ ℎ
𝐼(𝑓 ) = ∫ 𝑓 (𝑥 )𝑑𝑥 = ∑[𝑓 (𝑥𝑖 ) + 𝑓(𝑥𝑖+1 )] = [𝑓 (𝑎) + 𝑓 (𝑏)] + ℎ ∑ 𝑓(𝑥𝑖 )
𝑎 2 2
𝑖=1 𝑖=2

9.4.1 Simpson’s 1/3 method


𝑎+𝑏 𝑎−𝑏
Domain [𝑎, 𝑏], 𝑥1 = 𝑎, 𝑥3 = 𝑏, 𝑥2 = ,ℎ =
2 2
𝑏

𝐼 (𝑓 ) = ∫ 𝑓 (𝑥 )𝑑𝑥 = [𝑓 (𝑥1 ) + 4𝑓 (𝑥2 ) + 𝑓(𝑥3 )]
𝑎 3
ℎ 𝑎+𝑏
= [𝑓 (𝑎) + 4𝑓 ( ) + 𝑓 (𝑏 )]
3 2
9.4.2 Composite Simpson’s 1/3 method
Domain [𝑎, 𝑏] is divided into even number N subintervals with equal width ℎ =
𝑏−𝑎
by 𝑁 + 1 points 𝑥1 , 𝑥2 , … , 𝑥𝑁+1 , where 𝑥1 = 𝑎, 𝑥𝑁+1 = 𝑏,
𝑁
𝑥3 𝑥5 𝑥𝑁+1
𝐼(𝑓 ) = ∫ 𝑓 (𝑥 )𝑑𝑥 + ∫ 𝑓 (𝑥 )𝑑𝑥 + ⋯ + + ∫ 𝑓 (𝑥 )𝑑𝑥
𝑎 𝑥3 𝑥𝑁−1
𝑁 𝑥𝑖+1
= ∑ ∫ 𝑓 (𝑥 )𝑑𝑥
𝑖=2,4,6,… 𝑥𝑖−1


𝐼 (𝑓 ) = [𝑓 (𝑥1 ) + 4𝑓 (𝑥2 ) + 𝑓 (𝑥3 ) + 𝑓(𝑥3 ) + 4𝑓 (𝑥4 ) + 𝑓 (𝑥5 ) + ⋯ + 𝑓(𝑥𝑁−1 )
3
+ 4𝑓 (𝑥𝑁 ) + 𝑓 (𝑥3 )]
𝑁 𝑁−1

= [𝑓(𝑎) + 4 ∑ 𝑓 (𝑥𝑖 ) + 2 ∑ 𝑓 (𝑥𝑖 ) + 𝑓 (𝑏)]
3
𝑖=2,4,6,… 𝑖=3,5,7,…

9.4.3 Simpson’s 3/8 method


𝑎−𝑏
Domain [𝑎, 𝑏], 4𝑝𝑜𝑖𝑛𝑡𝑠: 𝑥1 = 𝑎, 𝑥4 = 𝑏, 𝑥2 = 𝑎 + ℎ, 𝑥3 = 𝑎 + 2ℎ, ℎ =
3
𝑏
3ℎ
𝐼 (𝑓 ) = ∫ 𝑓 (𝑥 )𝑑𝑥 = [𝑓 (𝑎) + 3𝑓 (𝑥2 ) + 3𝑓(𝑥3 ) + 𝑓(𝑏)]
𝑎 8
9.4.4 Composite Simpson’s 3/8 method
Domain [𝑎, 𝑏] is divided into 𝑁 (𝑁 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 3) subintervals with equal
𝑏−𝑎
width ℎ = by 𝑁 + 1 points 𝑥1 , 𝑥2 , … , 𝑥𝑁+1 , where 𝑥1 = 𝑎, 𝑥𝑁+1 = 𝑏,
𝑁
𝑥4 𝑥7 𝑥𝑁+1
𝐼(𝑓 ) = ∫ 𝑓 (𝑥 )𝑑𝑥 + ∫ 𝑓 (𝑥 )𝑑𝑥 + ⋯ + + ∫ 𝑓 (𝑥 )𝑑𝑥
𝑎 𝑥4 𝑥𝑁−2
𝑁−2 𝑥𝑖+3
= ∑ ∫ 𝑓 (𝑥 )𝑑𝑥
𝑖=1,4,7,… 𝑥𝑖

When the subintervals have the same width h:


3ℎ
𝐼 (𝑓 ) = [𝑓 (𝑥1 ) + 3𝑓(𝑥2 ) + 3𝑓 (𝑥3 ) + 𝑓(𝑥4 ) + 𝑓 (𝑥4 ) + 3𝑓 (𝑥5 ) + 3𝑓(𝑥6 )
8
+ 𝑓 (𝑥7 ) + ⋯ + 𝑓(𝑥𝑁−2 ) + 3𝑓(𝑥𝑁−1 ) + 3𝑓(𝑥𝑁 ) + 𝑓(𝑥𝑁+1 )]
𝑁−1 𝑁−2
3ℎ
= [𝑓(𝑎) + 3 ∑ [𝑓 (𝑥𝑖 ) + 𝑓(𝑥𝑖+1 )] + 2 ∑ 𝑓(𝑥𝑖 ) + 𝑓 (𝑏)]
8
𝑖=2,5,8,… 𝑖=4,7,10,…
1.8
Problem 9.1: Compute ∫0 𝑓 (𝑥 )𝑑𝑥 with ℎ = 0.3 𝑎𝑛𝑑 ℎ = 0.6

x 0 0.3 0.6 0.9 1.2 1.5 1.8


f(x) 0.5 0.6 0.8 1.3 2 3.2 4.8

a. rectangle
𝑏 𝑁

ℎ = 0.3, 𝐼(𝑓 ) = ∫ 𝑓(𝑥 )𝑑𝑥 = ℎ ∑ 𝑓(𝑥𝑖 ) = 0.3(0.5 + 0.6 + ⋯ + 3.2) = 2.53


𝑎 𝑖=1
𝑏 𝑁

ℎ = 0.6, 𝐼(𝑓 ) = ∫ 𝑓 (𝑥 )𝑑𝑥 = ℎ ∑ 𝑓(𝑥𝑖 ) = 0.6(0.5 + 0.8 + 2) = 1.98


𝑎 𝑖=1

b. trapezoidal
𝑁−1

𝐼(𝑓 ) = [𝑓 (𝑎) + 𝑓 (𝑏)] + ℎ ∑ 𝑓(𝑥𝑖 )
2
𝑖=2
0.3
ℎ = 0.3, 𝐼(𝑓 ) = (0.5 + 4.8) + 0.3(0.6 + ⋯ + 3.2) = 3.165
2
0.6
ℎ = 0.6, 𝐼(𝑓 ) = (0.5 + 4.8) + 0.6(0.8 + 2) = 3.27
2
c. Simpson’s 3/8
𝑁−1 𝑁−2
3ℎ
𝐼 (𝑓 ) = [𝑓(𝑎) + 3 ∑ [𝑓(𝑥𝑖 ) + 𝑓 (𝑥𝑖+1 )] + 2 ∑ 𝑓 (𝑥𝑖 ) + 𝑓 (𝑏)]
8
𝑖=2,5,8,… 𝑖=4,7,10,…
3 ∙ 0.3
ℎ = 0.3, 𝐼(𝑓 ) = [0.5 + 3(0.6 + 0.8 + 2 + 3.2) + 2 ∙ 1.3 + 4.8] = 3.116
8
3 ∙ 0.6
ℎ = 0.6, 𝐼(𝑓 ) = [0.5 + 3(0.8 + 2) + 4.8] = 3.0825
8

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy