Scribd
Upload
11 views

False Position Method

Uploaded by

R Durjoy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
11 views

False Position Method

Uploaded by

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

CSE 325

Numerical Methods

Sadia Tasnim Barsha


Lecturer, CSE, SU
False Position Method
■ In bisection method, the interval between x1 and x2 divided
into two equal halves, irrespective of location of the root. It
may be possible that the root is closer to one end than the
other as shown in Figure 6.3 [page-138, Balagurusamy). In
the figure, the root is closer to x1. If we join the points x1
and x2 by straight line, the point of intersection of this line
with the x axis (x0) gives an improved estimate of the root
and is called the false position of the root. This point then
replaces one of the initial guesses that has a function value
of the same sign as f (x0). The process is repeated with the
new values of x1 and x2. Since this method uses the false
position of the root repeatedly, it is called the false position
method (or regula falsi in Latin). It is also called the linear
interpolation method.
False Position Method
• False Position Formula
The equation of the line joining the points (x 1, f (x1)) and (x2,
f (x2)) is given by,
(f (x2) – f (x1)) / (x2 - x1) = (y- f (x1)) / (x - x1)

Since the line intersects the x-axis at x0, when x = x0, y = 0,


we have,
(f (x2) – f (x1)) / (x2 - x1) = (-f (x1)) /(x0 - x1)
or x0 - x1 = - f (x1) (x2-x1) / (f(x2) – f(x1))

Then we have,
x0 = x1- (f(x1) (x2-x1) ) / (f (x2) – f (x1))
This equation is known as the false position formula.
False Position Method
■ False Position Algorithm
1.Decide initial values for x1 and x2 and stopping criterion
E.
2.Compute x0 = x1- (f(x1) (x2-x1) ) / (f (x2) – f (x1))
3.If f (x0) * f (x1) < 0 set x2 = x0 otherwise set x1 = x0
4.If the absolute difference of two successive x0 is less
then E, then root = x0 and stop.
5.Else go to step 2.
False Position Method
■ Example: Use the false position method to find a root of the function f (x) = x2 – x – 2 = 0
in the range 1 < x < 3.
Solution: Given x1= 1 and x2 = 3
f (x1) = f (1) = -2 f (x2) = f (3) = 4
x0 = x1- (f(x1) (x2-x1) ) / (f (x2) – f (x1))
= 1 + 2 * (3 - 1) / (4 + 2)
= 1.6667
Iteration 2: f (x0) * f (x1) = f (1.6667) * f (1) =1.7778
Therefore, the root lies in the interval between x0 and x2. Then,
x1 = x0 = 1.6667
f (x1) = f (1.6667) = -0.8889
f (x2) = f (3) = 4
x0 = 1.6667 + 0.8889 * (3 – 1.6667) / (4 + 0.8889) = 1.909
Iteration 3: f (x0) * f (x1) = f (1.909) * f (1.6667) = 0.2345
Therefore, the root lies in the interval between x0 = 1.909 and x2 = 3. Then,
x1 = x0 = 1.909
x0 = 1.909 - 0.2647 * (3 – 1.909) / (4 - 0.2647) = 1.986
The estimated root after third iteration is 1.986. The interval contains a root x = 2. We can
End

You might also like