0% found this document useful (0 votes)
93 views18 pages

Regula Falsi Method Explained

The document discusses the Regula Falsi method for finding the roots of nonlinear equations. It begins by defining the Regula Falsi method and giving the formula used to calculate successive approximations. It then provides a graphical representation and outlines the working rules. The document provides two examples solving equations numerically using the Regula Falsi method. It concludes by discussing the order of convergence, advantages, and disadvantages of the Regula Falsi method. Homework exercises are assigned at the end.

Uploaded by

Khalid Pervaiz
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)
93 views18 pages

Regula Falsi Method Explained

The document discusses the Regula Falsi method for finding the roots of nonlinear equations. It begins by defining the Regula Falsi method and giving the formula used to calculate successive approximations. It then provides a graphical representation and outlines the working rules. The document provides two examples solving equations numerically using the Regula Falsi method. It concludes by discussing the order of convergence, advantages, and disadvantages of the Regula Falsi method. Homework exercises are assigned at the end.

Uploaded by

Khalid Pervaiz
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

Numerical

Methods
Lecture-6
[MA-200]
ARISHA ALI
Regula Falsi Method
▪Regula Falsi method is also known as False Position Method or Method of False
Position.
▪If 𝑥𝑛−1 and 𝑥𝑛 are the two approximations to roots 𝛼 of nonlinear equation
𝑓 𝑥 = 0 then 𝑥𝑛+1 approximation is given by
𝑥𝑛−1 𝑓 𝑥𝑛 −𝑥𝑛 𝑓(𝑥𝑛−1 )
𝑥𝑛+1 =
𝑓(𝑥𝑛) −𝑓(𝑥𝑛−1 )

ARISHA ALI 2
Graphical
Representation

ARISHA ALI 3
Working Rule
▪Let 𝑓 𝑥 = 0 be the given equation
▪Find 𝑥0 𝑎𝑛𝑑 𝑥1 such that 𝑓 𝑥0 < 0 𝑎𝑛𝑑 𝑓 𝑥1 > 0 (𝑜𝑟 𝑓(𝑥0 )𝑓(𝑥1 ) < 0)
▪Find first approximate root by
𝑥0 𝑓 𝑥1 − 𝑥1 𝑓(𝑥0 )
𝑥2 =
𝑓(𝑥1 ) − 𝑓(𝑥0 )
Find 𝑓(𝑥2 ) and examine its sign
▪ If 𝑓 𝑥2 < 0, then replace 𝑥0 = 𝑥2
▪ If 𝑓 𝑥2 > 0, then replace 𝑥1 = 𝑥2

ARISHA ALI 4
Cont…
▪ Find second approximate root by
𝑥0 𝑓 𝑥1 − 𝑥1 𝑓(𝑥0 )
𝑥2 =
𝑓(𝑥1 ) − 𝑓(𝑥0 )
Find 𝑓(𝑥2 ) and examine its sign
Repeat step 3 until the required accuracy.

ARISHA ALI 5
Example 1
Solve the equation 𝑥𝑒 𝑥 = 𝑐𝑜𝑠𝑥 by regula falsi method correct up to 4 decimal
places.
Solution:
𝑙𝑒𝑡 𝑓 𝑥 = 𝑥𝑒 𝑥 − 𝑐𝑜𝑠𝑥 = 0
To find 𝑥0 and 𝑥1 :
𝑓 0 = −1 < 0
𝑓 1 = 2.177979 > 0
𝑓 0.5 = −0.053221 < 0
𝑓 0.6 = 0.267935 > 0

ARISHA ALI 6
Cont…
Choosing 𝑥0 = 0.5 and 𝑥1 = 0.6
𝑓 𝑥0 = −0.053221 𝑓 𝑥1 = 0.267935
1st Iteration:
𝑥0 𝑓 𝑥1 −𝑥1 𝑓(𝑥0 ) 0.5 0.267935 −0.6(−0.053221)
𝑥2 = = = 0.516571
𝑓(𝑥1 )−𝑓(𝑥0 ) 0.267935+0.053221

𝑓 𝑥2 = 0.516571𝑒 0.516571 − cos 0.516571 = −0.003605 < 0


Since 𝑓 𝑥2 < 0 so choosing 𝑥0 = 0.516571 and 𝑥1 = 0.6
𝑓 𝑥0 = −0.003605 𝑎𝑛𝑑 𝑓 𝑥1 = 0.267935
ARISHA ALI 7
Cont…
2nd Iteration:
𝑥0 𝑓 𝑥1 −𝑥1 𝑓(𝑥0 ) 0.516571 0.267935 −0.6(−0.003605)
𝑥2 = = = 0.517678
𝑓(𝑥1 )−𝑓(𝑥0 ) 0.267935+0.003605

𝑓 𝑥2 = −0.000241 < 0
Since 𝑓 𝑥2 < 0 so choosing 𝑥0 = 0.517678 and 𝑥1 = 0.6
𝑓 𝑥0 = −0.000241 𝑎𝑛𝑑 𝑓 𝑥1 = 0.267935

ARISHA ALI 8
Cont…
3rd Iteration:
𝑥0 𝑓 𝑥1 −𝑥1 𝑓(𝑥0 ) 0.517678 0.267935 −0.6(−0.000241)
𝑥2 = = = 0.517751
𝑓(𝑥1 )−𝑓(𝑥0 ) 0.267935+0.000241

𝑓 𝑥2 = −0.000019 < 0
Since 𝑓 𝑥2 < 0 so choosing 𝑥0 = 0.517751 and 𝑥1 = 0.6
𝑓 𝑥0 = −0.000019 𝑎𝑛𝑑 𝑓 𝑥1 = 0.267935

ARISHA ALI 9
Cont…
4th Iteration:
𝑥0 𝑓 𝑥1 −𝑥1 𝑓(𝑥0 ) 0.517751 0.267935 −0.6(−0.000019)
𝑥2 = = = 0.517756
𝑓(𝑥1 )−𝑓(𝑥0 ) 0.267935+0.000019

Hence the approximate root of equation correct up to 4 decimal places is


𝑥 = 0.5177

ARISHA ALI 10
Example 2
Find the real root of equation 𝑥 3 − 4𝑥 − 9 by regula falsi method correct up to 4
decimal places.
Solution:
𝑙𝑒𝑡 𝑓 𝑥 = 𝑥 3 − 4𝑥 − 9 = 0
To find 𝑥0 and 𝑥1 :
𝑓 0 = −9 < 0
𝑓 1 = −12 < 0
𝑓 2 = −9 < 0
𝑓 3 =6>0
𝑓 2.6 = −1.824 < 0

ARISHA ALI 11
Cont…
𝑓 2.7 = −0.117 < 0
𝑓 2.8 = 1.752 > 0
Choosing 𝑥0 = 2.7 and 𝑥1 = 2.8
𝑓 𝑥0 = −0.117 and 𝑓 𝑥1 = 1.752
1st Iteration:
𝑥0 𝑓 𝑥1 − 𝑥1 𝑓(𝑥0 ) 2.7 1.752 − 2.8(−0.117)
𝑥2 = = = 2.706260
𝑓(𝑥1 ) − 𝑓(𝑥0 ) 1.752 + 0.117
𝑓 𝑥2 = −0.004816 < 0

ARISHA ALI 12
Cont…
Choosing 𝑥0 = 2.706260 and 𝑥1 = 2.8
𝑓 𝑥0 = −0.004816 and 𝑓 𝑥1 = 1.752
2nd Iteration:
𝑥0 𝑓 𝑥1 − 𝑥1 𝑓(𝑥0 ) 2.706260 1.752 − 2.8(−0.004816)
𝑥2 = = = 2.706516
𝑓(𝑥1 ) − 𝑓(𝑥0 ) 1.752 + 0.004816
𝑓 𝑥2 = −0.000214 < 0
Choosing 𝑥0 = 2.706516 and 𝑥1 = 2.8
𝑓 𝑥0 = −0.000214 and 𝑓 𝑥1 = 1.752

ARISHA ALI 13
Cont…
3rd Iteration:
𝑥0 𝑓 𝑥1 − 𝑥1 𝑓(𝑥0 ) 2.706516 1.752 − 2.8(−0.000214)
𝑥2 = = = 2.706527
𝑓(𝑥1 ) − 𝑓(𝑥0 ) 1.752 + 0.000214
Hence the approximate root correct up to 4 decimal place is 𝑥 = 2.7065

ARISHA ALI 14
Order/Rate of Convergence

The order of convergence of Regula Falsi Method is 1.618

ARISHA ALI 15
Advantages

▪It does not require the derivative calculation.


▪It always converges
▪It is a quick method

ARISHA ALI 16
Disadvantages
▪Sometimes the method slow down
▪It can’t predict number of iterations to reach a given precision
▪It can be less precise than bisection, no strict precision guarantee.

ARISHA ALI 17
Homework

Exercise: 2.3
Q3(b, c), Q4(b), Q9, Q10, Q13(a), Q14(b)

ARISHA ALI 18

You might also like