Chapter 6:

False Position Method

(For a Non-linear Equation)

OBJECTIVE:
In this chapter, the students are expected to follow the algorithm and apply the
method to find the roots in a non - linear equation using False Position Method.

DISCUSSION:
False position method or Regula Falsi is a modification of the Bisection Method.
It was developed because the bisection method converges at a fairly slow speed. It give
a successive approximations converging to a solution for an equation of the form f(x) =
0.
In Bisection Method, we identify proper values of xL (lower bound value) and xU
(upper bound value) such that f(xL )𝑓(xU ) > 0 and for the next improve roots xr can be
computed as midpoint between xL and xU as also for the next iteration.

In False Position Method, instead of halving the interval use in Bisection; we use
the root of the line joining xL , 𝑓(xL ) and xU , 𝑓(xU ) as approximation for the value
roots xr .The idea for the False Position method is to connect xL , 𝑓(xL ) and xU , 𝑓(xU ) with
a straight line.

1|P ag e
 Based on two similar triangles on Figure 1, one gets an equation
0−𝑓(𝑥𝐿 ) 0−𝑓(𝑥𝑈 )
= Eq. 1
𝑥𝑟 −𝑥𝐿 𝑥𝑟 −𝑥𝑈

From equation 1, we obtain,

𝑓(𝑥𝑈 )(𝑥𝑟 − 𝑥𝐿 ) = 𝑓(𝑥𝐿 )(𝑥𝑟 − 𝑥𝑈 ) Eq. 2

And we can solve the above equation for the next predicted root,
𝑥𝑢 𝑓(𝑥𝐿 )−𝑥𝐿 𝑓(𝑥𝑢 )
𝑥𝑟 = or
𝑓(𝑥𝐿 )−𝑓(𝑥𝑢 )

𝑓(𝑥𝐿 )(𝑥𝑈 −𝑥𝐿)

𝑥𝑟 = 𝑥𝐿 − Eq.3
𝑓(𝑥𝑈 )−𝑓(𝑥𝐿 )

Algorithm for FPM:

1. Choose xL and xU as required two points for the root and find for the value of
f(xL) and 𝑓(xU ).
*If the function f(x) is continuous on the interval [xL , xU ] with f(xL )𝑓(xU ) > 0,
the algorithm will eventually converge to a solution.
2. Estimate the root, xr of the equation f(x) = 0 as
𝑥 𝑢 𝑓 (𝑥 𝐿 ) − 𝑥 𝐿 𝑓 (𝑥 𝑢 )
𝑥𝑟 =
𝑓 (𝑥𝐿 ) − 𝑓 (𝑥𝑢 )
3. Then for the next iteration, check the following
If f(xL )𝑓(xU ) < 0, then the roots lies between xL and xU ; then xL = xL and
x𝑈 = xr
If f(xL )𝑓(xU ) > 0, then the roots lies between xL and xU ; then xL = xr and
x𝑈 = xU
If f(xL )𝑓(xU ) = 0, Stop the algorithm.
4. Find the new estimate of the root at next iteration.
𝑥 𝑢 𝑓 (𝑥 𝐿 ) − 𝑥 𝐿 𝑓 (𝑥 𝑢 )
𝑥𝑟1 =
𝑓 (𝑥 𝐿 ) − 𝑓 (𝑥 𝑢 )
5. Find the absolute relative approximate error as
𝑥𝑟𝑛𝑒𝑤 −𝑥𝑟𝑜𝑙𝑑
|∈𝑎 | = | | x 100
𝑥𝑟𝑛𝑒𝑤

2|P ag e
SAMPLE PROBLEM:

1. Consider finding the root of f(x) = x2-3. Let ɛstep = 0.01, ɛabs = 0.01and start
with the interval [1,2].
Given:
xL = 1; xU = 2;

For the function f(xL) and 𝑓(xU ).

f(xL ) = f(1) = (1)2 -3 = -2
f(xU ) = f(2)= (2)2 -3 = 1

Hence,
f(xL )𝑓(xU ) = f(1)*f(2) = (-2)*(1)
f(xL )𝑓(xU ) = -2
f(1)*f(2) < 0, therefore 𝐱 𝐋 = 𝐱 𝐫 and 𝐱 𝑼 = 𝐱 𝐔 (for the next iteration).

Iteration 1:
For the estimate value of 𝑥𝑟 ;

𝑥𝑟 =
𝑥𝑢 𝑓(𝑥𝐿 )−𝑥𝐿 𝑓(𝑥𝑢 ) 𝑓(𝑥𝑟 ) = 𝑓 (1.6667) = (1.6667)2
𝑓(𝑥𝐿 )−𝑓(𝑥𝑢 )
-3
𝒙𝒓 = 1.6667
f(𝑥𝑟 ) = −0.2221

*Then for the Absolute error is noted as N/a for the new error is not present
at iteration 1.

Iteration 2.

For new bracket

of lower and upper limits are
xL = 1.6667;
xU = 2;
For the function f(xL) and 𝑓(xU ).
f(xL ) = f(1.6667) = (1.6667)2 -3 = -
0.2221
f(xU ) = f(2)= (2)2 -3 = 1

For the estimate value of 𝑥𝑟 ; 𝒙𝒓 = 1.7273

(1.6667)(2−1.6667) f(𝑥𝑟 ) = −0.0164
𝑥𝑟 = 1.667 − 1−(1.6667)

3|P ag e
 1.7273−1.6667
=| | x 100
1.7273

For the Absolute relative error for this |∈𝑎 | = 3.51%

iteration is;
𝑥𝑟𝑛𝑒𝑤 −𝑥𝑟𝑜𝑙𝑑
|∈𝑎 | = | | x 100
𝑥𝑟𝑛𝑒𝑤

Hence,

f(xL )𝑓(xU ) = f(1.6667)*f(2) = (-0.2221)*(2)

f(𝐱 𝐋 )𝒇(𝐱 𝐔 ) = -0.4442
f(1)*f(2) < 0, therefore xL = xr and x𝑈 = xU (for the next iteration)
Iteration 3.

For new bracket of lower and upper limits are:

xL = 1.7273; xU = 2;

For the function f(xL) and 𝑓(xU ).

f(xL ) = f(1.7273) = (1.7273)2 -3 = -0.0164
f(xU ) = f(2)= (2)2 -3 = 1

For the estimate value of 𝑥𝑟 ;

𝑥𝑟 = 1.7173 −
(1.7273)(2−1.7273) 𝑓(𝑥𝑟 ) = 𝑓 (1.7317) = (1.7317)2
1−(1.7273)
-3
𝒙𝒓 = 1.7317
f(𝑥𝑟 ) = 0.00

For the Absolute relative error for this iteration is;

𝑥𝑟𝑛𝑒𝑤 −𝑥𝑟𝑜𝑙𝑑 1.7317−1.7273
|∈𝑎 | = | | x 100 = | | x 100
𝑥𝑟𝑛𝑒𝑤 1.7173

|∈𝑎 | = 0.256%

Hence,

f(xL )𝑓(xU ) = f(1.7273)*f(2) = (-0.0164)*(2)

f(𝐱 𝐋 )𝒇(𝐱 𝐔 ) = 0.0328
f(1)*f(2) > 0, therefore xL = xr and x𝑈 = xU

4|P ag e
 ISAT U CEA

For the estimate value of 𝑥𝑟 ;

(1.7273)(2−1.7273)
𝑥𝑟 = 1.7173 − 1−(1.7273)
𝒙𝒓 = 1.7317
𝑓 (𝑥𝑟 ) = 𝑓 (1.7317) = (1.7317)2 - 3
f(𝑥𝑟 ) = 0.00

For the Absolute relative error for this iteration is;

𝑥𝑟𝑛𝑒𝑤 −𝑥𝑟𝑜𝑙𝑑 1.7317−1.7273
|∈𝑎 | = | | x 100 = | | x 100
𝑥𝑟𝑛𝑒𝑤 1.7173

|∈𝑎 | = 0.256%

Hence,

f(xL )𝑓(xU ) = f(1.7273)*f(2) = (-0.0164)*(2)

f(𝐱 𝐋 )𝒇(𝐱 𝐔 ) = 0.0328
f(1)*f(2) > 0, therefore xL = xr and x𝑈 = xU

TABLE 1. Roots of f(x)=x2-3

Iteration xL xU xr |∈𝑎 | f(𝑥𝑟 )

1 1 2 1.6667 ----- -0.2221

2 1.6667 2 1.7273 3.51% -0.0164

3 1.7273 2 1.7317 0.25% 0.0012

We stop at 3rd iteration because it state to the given ɛstep = 0.01 that give atleast
correct approximation of the unknown roots.

5|P a ge
 ISAT U CEA

SAMPLE PROBLEM: USING EXCEL

Find the root of f(x)=(x-4)2(x+2), using the initial guesses of xL = -2.5 and
xU = −1.0, and ɛstep = 0.01.

1. On the excel sheets, input the variables to be given.

i xL xU 𝑓(xL ) 𝑓(xU ) xr f(𝑥𝑟 ) |∈𝑎 | 𝑓(xL )𝑓(xU ) Update

2. At the iteration, starts always at zero.

3. Then for the xL and xU is given to be input for their respective function base on
equation.
f(-2.5) =((-2.5)-4)2((-2.5)+2) = -21.5
f(-1.0) = ((-1.0)-4)2((-1.0)+2) = 25
4. After it, we could solve for the value of xr base on the given formula:
𝑥 𝑢 𝑓 (𝑥 𝐿 ) − 𝑥 𝐿 𝑓 (𝑥 𝑢 )
𝑥𝑟 =
𝑓 (𝑥 𝐿 ) − 𝑓 (𝑥 𝑢 )
𝑥𝑟 = -1.8130081

5. For f(𝑥𝑟 ), input the value of 𝑥𝑟 base on the given equation.

f(-1.8130081) =((-1.8130081)-4)2((-1.8130081)+2) = 6.3186542

6. For approximation error at 1st iterative is zero for a while.

7. After it, solve for the product of 𝑓(xL )𝑓(xU ) to be used as update for the next
iteration.
Note: If f(xL )𝑓(xU ) < 0, then xL = xL and x𝑈 = xr
If f(xL )𝑓(xU ) > 0, then xL = xr and x𝑈 = xU
8. For the iteration 2, the value of xL and x𝑈 is base on the condition at step no. 7
9. For the function of x is the same as step no 3. Drag the cell as it converges its
value.
10. Then for the approximate error can be solved by equation
𝑥𝑟𝑛𝑒𝑤 −𝑥𝑟𝑜𝑙𝑑
|∈𝑎 | = | | x 100
𝑥𝑟𝑛𝑒𝑤

11. And for the condition, is the same as step no. 7.

6|P a ge
 ISAT U CEA

Table 1.Roots of f(x)=(x-4)2(x+2)

The answer is on iterative 5, as it satisfy the ɛstep = 0.01 base on the

product of f(𝐱 𝐋 )𝒇(𝐱 𝐔 ). Which is -1.99986 or approx. equal to -2.

FOLLOW UP QUESTIONS:
 Advantages of using False Position than Bisection Method?
 Using False Position Method does it converges rapidly? Why?
 Does FPM, gives an accurate answer for the value of roots?

APPLICATION:
1. Use the false position method to find the root of x sin(x) − 1 = 0 that is located
in the interval [0, 2].
2. Find for the roots of f(x) = x3+x+1 that is located in the interval of (-1, ½). At
the end of ɛ=1x10-6.

7|P a ge