Finding Roots of Algebraic and

Transcendental Functions
Numerically
(Regula Falsi and Secant Method)

Pankaj Mathur
Professor1,
Department of Mathematics and Astronomy,
University of Lucknow,
Lucknow

1
Disclaimer: The e-content is exclusively meant for academic purposes and for en-
hancing teaching and learning. Any other use for economic/commercial purpose is strictly
prohibited. The users of the content shall not distribute, disseminate or share it with any-
one else and its use is restricted to advancement of individual knowledge. The information
provided in this e-content is authentic and best as per my knowledge.

1
1 Regula Falsi Method (Method of False Po-
sition)
Let f (x) be a continuous function on the interval [a, b]. We need to find a
root of f (x) = 0. Let f (a) > 0 and f (b) < 0 that is, f (a)f (b) < 0. So the
root lies in the interval (a, b). The equation of the line joining the points
(a, f (a)) and (b, f (b)) is

f (b) − f (a)
y − f (a) = (x − a).
b−a
It passes through (c1 , 0), thus
b−a
c1 = a − f (a).
f (b) − f (a)

If f (c1 ) = 0, then c1 is the required root.

Otherwise, either f (c1 ) > 0 or f (c1 ) < 0. Consider f (c1 ) < 0, then the root
lies in the interval (a, c1 ). Following the similar steps as above, we have
c1 − a
c2 = a − f (a).
f (c1 ) − f (a)

If f (c2 ) = 0, then c2 is the required root.

Figure 1: Regula Falsi Method

Otherwise, either f (c2 ) > 0 or f (c2 ) < 0. If f (c1 ) < 0, then the root lies in

2
the interval (a, c2 ). Continuing the process so on the nth approximation to
the required root is given by
cn−1 − a
cn = a − f (a).
f (cn−1 ) − f (a)

Continuing the process, as n → ∞ in the sequence of points {c1 , c2 , · · · , cn },

we reach to the roots c of the desirable accuracy.

Remark 1 This method is also called the Method of False position as

one of the end points either a or b gets fixed automatically.

Example 1 By Regula Falsi method (RFM) find an approximate value of

the root of the equation x3 + x − 1 = 0, correct upto 2 decimal places.

Solution: Let f (x) = x3 + x − 1, then f (0.5) = −0.375 and f (1) = 1.

So, f (0.5)f (1) < 0. Thus the root lies in (0.5, 1). By Regula Falsi Method
(RFM), we have

b−a 1 − 0.5
c1 = a − f (a) = 0.5 − × (−0.375) = 0.64
f (b) − f (a) 1 + 0.375

Now, f (c1 ) = f (0.64) = −0.0979, then f (0.64)f (1) < 0. So root lies in
(0.64, 1), thus by RFM
1 − 0.64
c2 = 0.64 − × (0.0979) = 0.672.
1 + 0.0979
Again, f (c2 ) = f (0.672) = −0.024.Then f (0.672)f (1) < 0. So, root lies in
(0.672, 1). So by RFM
1 − 0.672
c3 = 0.6472 − × (0.024) = 0.6796.
1 + 0.024
Thus c = 0.67 is a root of f (x) = 0, correct upto 2 decimal places.

2 Secant Method
This method is an improvement over the Regula Falsi method. In this
method, we do not need f (c1 )f (a) < 0 at each step. Two most recent ap-
proximations are used to find the next approximations. The steps involved
in this method are

3
Step 1: Find the interval (a, b) in which the root lies.
Step 2: Find
b−a
c1 = a − f (a).
f (b) − f (a)

Step 3: Find
c1 − a
c2 = a − f (a).
f (c1 ) − f (a)

Figure 2: Secant Method

Step 4: Find

c2 − c1
c3 = c1 − f (c1 ).
f (c2 ) − f (c1 )

Continuing this way, we get the general formula as

cn − cn−1
cn+1 = cn − f (cn ).
f (cn ) − f (cn−1 )

Example 2 Find the root of x3 − 5x + 1 = 0, correct upto 3 decimal places

by Secant method.

Solution: Let f (x) = x3 − 5x + 1, so f (0) = 1 and f (1) = −3, hence the

root lies in (0, 1). Thus
1−0 1
c1 = 1 − f (1) = 1 − × (−3) = 0.25
f (1) − f (0) −3 − 1

4
and f (c1 ) = 0.234375.
c1 − 1
c2 = c1 − f (c1 ) = 0.186441, f (c2 ) = 0.07423
f (c1 ) − f (1)
c2 − c1
c3 = c2 − f (c2 ) = 0.201736 f (c3 ) = −0.000469
f (c2 ) − f (c1 )
c3 − c2
c4 = c3 − f (c3 ) = 0.201640
f (c3 ) − f (c2 )

thus c = 0.201 is the root correct upto 3 decimal places.

References
[1] M.K. Jain, S.R.K. Iyenger and R.K. Jain, Numerical Methods.

[2] B.S. Grewal, Numerical Methods in Engineering and Sciences.