Class Work
1st Semester
The Numerical Methods
o Root Finding
1. The Bisection Method:
2. The Newton-Raphson Method:
𝑓(𝑥𝑛 )
𝑥𝑛+1 = 𝑥𝑛 −
𝑓′(𝑥𝑛 )
3. The Secant Method:
𝑓(𝑥𝑛 )(𝑥𝑛 − 𝑥𝑛−1 )
𝑥𝑛+1 = 𝑥𝑛 −
𝑓(𝑥𝑛 ) − 𝑓(𝑥𝑛−1 )
4. Newton’s Forward Difference Interpolation Formula:
𝑟 (𝑟 − 1) 2 𝑟(𝑟 − 1)(𝑟 − 2) 3
𝑓 (𝑥 ) = 𝑓 (𝑥0 ) + 𝑟∆𝑓 (𝑥0 ) + ∆ 𝑓 (𝑥 0 ) + ∆ 𝑓 (𝑥 0 ) + ⋯
2! 3!
𝑟(𝑟 − 1)(𝑟 − 2) … (𝑟 − 𝑛 + 1) 𝑛
+ ∆ 𝑓 (𝑥 0 )
𝑛!
𝑥−𝑥0
Where, 𝑥 = 𝑥0 + 𝑟ℎ ⇒ 𝑟 =
ℎ
Backward
5. Newton’s Forward Difference Interpolation Formula:
𝑟 (𝑟 + 1) 2 𝑟(𝑟 + 1)(𝑟 + 2) 3
𝑓(𝑥 ) = 𝑓 (𝑥𝑛 ) + 𝑟∇𝑓 (𝑥𝑛 ) + ∇ 𝑓 (𝑥 𝑛 ) + ∇ 𝑓(𝑥𝑛 ) + ⋯
2! 3!
𝑟(𝑟 + 1)(𝑟 + 2) … (𝑟 + 𝑛 − 1) 𝑛
+ ∇ 𝑓 (𝑥𝑛 )
𝑛!
𝑥−𝑥𝑛
Where, 𝑥 = 𝑥𝑛 + 𝑟ℎ ⇒ 𝑟 =
ℎ
6. Numerical Differentiation:
Forward Difference Terms:
2 3 4 5
′(
1 ∆ 𝑓(𝑥 ) ∆ 𝑓(𝑥 ) ∆ 𝑓(𝑥 ) ∆ 𝑓(𝑥)
𝑓 𝑥 )|𝑥=𝑥0 = [∆ 𝑓 ( 𝑥 ) − + − + ]
ℎ 2 3 4 5
𝑥=𝑥0
4 5
1 2 3 11 5
𝑓 ′ ′(𝑥 )|𝑥=𝑥0 = 2
[∆ 𝑓 (𝑥 ) − ∆ 𝑓 (𝑥 ) + ∆ 𝑓(𝑥 ) − ∆ 𝑓(𝑥)]
ℎ 12 6 𝑥=𝑥 0
Backward Difference Terms:
′(
1 ∇2 𝑓 (𝑥) ∇3 𝑓 (𝑥 ) ∇4 𝑓(𝑥) ∇5 𝑓(𝑥)
𝑓 𝑥 ) = [∇𝑓(𝑥) + + + + ]
ℎ 2 3 4 5
Class Work
1st Semester
1 2 11 5
𝑓 ′ ′( 𝑥 ) = 2
[∇ 𝑓(𝑥 ) + ∇3 𝑓(𝑥 ) + ∇4 𝑓(𝑥 ) + ∇5 𝑓(𝑥)]
ℎ 12 6
7. Numerical Integration:
Trapezoidal Rule:
ℎ
𝐼= [(𝑦 + 𝑦𝑛 ) + 2(𝑦1 + 𝑦2 + 𝑦3 + ⋯ + 𝑦𝑛−1 )]
2 0
Simpson’s 1/3 Rule:
ℎ
𝐼= [(𝑦 + 𝑦𝑛 ) + 4(𝑦1 + 𝑦3 + 𝑦5 … + 𝑦𝑛−1 ) + 2(𝑦2 + +𝑦4 + 𝑦6 … + 𝑦𝑛−2 )]
3 0
Simpson’s 3/8 Rule:
3ℎ
𝐼= [(𝑦0 + 𝑦𝑛 ) + 3(𝑦1 + 𝑦2 + 𝑦4 + 𝑦5 + 𝑦7 + 𝑦8 + ⋯ + 𝑦𝑛−1 )
8
+ 2(𝑦2 + +𝑦4 + 𝑦6 … + 𝑦𝑛−3 )]
