IJARCCE ISSN (O) 2278-1021, ISSN (P) 2319-5940
International Journal of Advanced Research in Computer and Communication Engineering
Impact Factor 7.39Vol. 11, Issue 1, January 2022
DOI: 10.17148/IJARCCE.2022.11135
REGULA-FALSI METHOD
Yash Bhor1, Prof. Vishal V Mehtre2
Department of Electrical Engineering,Bharati vidyapeeth(Deemed to be University)college of Engineering, Pune
India1,2
ABSTRACT: This research paper gives us the information about ‘Regula-Falsi Method’. This method helps us to find
the roots of transcendental and polynomial equations. It is closed bracket method and closely resembles the bisection
method. The method of false position provides an exact solutions for linear functions.
INTRODUCTION
Regula Falsi method or the method of false position is a numerical method for solving an equation in one unknown.
It is quite similar to bisection method algorithm and is one of the oldest approaches. The convergce process in the
bisection method is very slow. It depends only on the choice of end points of the interval [a,b]. The function f(x) does
not have any role in finding the point c (which is just the midpoint of a and b). It is used only to decide the next smaller
interval [a,c] or [c,b]. A better approximation to c can be obtained by taking the straight line L joining the points (a,f(a))
and (b,f(b)) intersecting the x-axis. To obtain the value of c we can equate the two expressions of the slope m of the line
L.
REGULA FALSI METHOD –
THEORY
As before (in bisection method), for a given continuous function f(x) we assume that f (a) and f (b) have opposite signs
( a = lower guess, b = upper guess). This condition satisfies the Balzano's Theorem for continuous function. Now after
this bisection method used the midpoint of the interval [a, b] as the next iterate to converge
towards the root of f(x).A better approximation is obtained if we find the point (c, 0) where the secant line L joining the
points (a, f (a)) and (b, f (b)) crosses the x-axis. To find the value c, we
© IJARCCE This work is licensed under a Creative Commons Attribution 4.0 International License 225
IJARCCE ISSN (O) 2278-1021, ISSN (P) 2319-5940
International Journal of Advanced Research in Computer and Communication Engineering
Impact Factor 7.39Vol. 11, Issue 1, January 2022
DOI: 10.17148/IJARCCE.2022.11135
write down two versions of the slope m of the line L:
Now the next smaller interval which brackets the root can be obtained by checking
f(a) * f(b) < 0 then b = c
> 0 then a = c
= 0 then c is the root.
Selecting c by the above expression is called Regula-Falsi method or False position method.
ALGORITHM –
*Given a continuous function f(x)
1. Find points a and b such that a < b and f(a) * f(b) < 0.
2. Take the interval [a, b] and determine the next value of x1.
3. If f(x1) = 0 then x1 is an exact root, else if f(x1) * f(b) < 0 then let a = x1, else if f(a) * f(x1) < 0 then let b = x1.
4. Repeat steps 2 & 3 until f(xi) = 0 or |f(xi)| DOA, where DOA stands for degree of accuracy.
© IJARCCE This work is licensed under a Creative Commons Attribution 4.0 International License 226
IJARCCE ISSN (O) 2278-1021, ISSN (P) 2319-5940
International Journal of Advanced Research in Computer and Communication Engineering
Impact Factor 7.39Vol. 11, Issue 1, January 2022
DOI: 10.17148/IJARCCE.2022.11135
NUMERICAL –
Example- f(x)=2x3-2x-5
Find a root of an equation f(x)=2x3-2x-5 using False Position method (regula falsi method)
Solution:
Here 2x3-2x-5=0
Let f(x)=2x3-2x-5
Here
x 0 1 2
f(x) -5 -5 7
1st iteration :
Here f(1)=-5<0 and f(2)=7>0
∴ Now, Root lies between x0=1 and x1=2
x2=x0-f(x0)⋅x1-x0f(x1)-f(x0)
x2=1-(-5)⋅2-17-(-5)
x2=1.41667
f(x2)=f(1.41667)=2⋅1.416673-2⋅1.41667-5=-2.14699<0
2nd iteration :
Here f(1.41667)=-2.14699<0 and f(2)=7>0
∴ Now, Root lies between x0=1.41667 and x1=2
x3=x0-f(x0)⋅x1-x0f(x1)-f(x0)
x3=1.41667-(-2.14699)⋅2-1.416677-(-2.14699)
x3=1.55359
f(x3)=f(1.55359)=2⋅1.553593-2⋅1.55359-5=-0.60759<0
3rd iteration :
Here f(1.55359)=-0.60759<0 and f(2)=7>0
∴ Now, Root lies between x0=1.55359 and x1=2
x4=x0-f(x0)⋅x1-x0f(x1)-f(x0)
x4=1.55359-(-0.60759)⋅2-1.553597-(-0.60759)
x4=1.58924
© IJARCCE This work is licensed under a Creative Commons Attribution 4.0 International License 227
IJARCCE ISSN (O) 2278-1021, ISSN (P) 2319-5940
International Journal of Advanced Research in Computer and Communication Engineering
Impact Factor 7.39Vol. 11, Issue 1, January 2022
DOI: 10.17148/IJARCCE.2022.11135
f(x4)=f(1.58924)=2⋅1.589243-2⋅1.58924-5=-0.15063<0
4th iteration :
Here f(1.58924)=-0.15063<0 and f(2)=7>0
∴ Now, Root lies between x0=1.58924 and x1=2
x5=x0-f(x0)⋅x1-x0f(x1)-f(x0)
x5=1.58924-(-0.15063)⋅2-1.589247-(-0.15063)
x5=1.59789
f(x5)=f(1.59789)=2⋅1.597893-2⋅1.59789-5=-0.0361<0 5th iteration :
Here f(1.59789)=-0.0361<0 and f(2)=7>0
∴ Now, Root lies between x0=1.59789 and x1=2
x6=x0-f(x0)⋅x1-x0f(x1)-f(x0)
x6=1.59789-(-0.0361)⋅2-1.597897-(-0.0361)
x6=1.59996
f(x6)=f(1.59996)=2⋅1.599963-2⋅1.59996-5=-0.00858<0
6th iteration :
Here f(1.59996)=-0.00858<0 and f(2)=7>0
∴ Now, Root lies between x0=1.59996 and x1=2
x7=x0-f(x0)⋅x1-x0f(x1)-f(x0)
x7=1.59996-(-0.00858)⋅2-1.599967-(-0.00858)
x7=1.60045
f(x7)=f(1.60045)=2⋅1.600453-2⋅1.60045-5=-0.00203<0
© IJARCCE This work is licensed under a Creative Commons Attribution 4.0 International License 228
IJARCCE ISSN (O) 2278-1021, ISSN (P) 2319-5940
International Journal of Advanced Research in Computer and Communication Engineering
Impact Factor 7.39Vol. 11, Issue 1, January 2022
DOI: 10.17148/IJARCCE.2022.11135
7th iteration :
Here f(1.60045)=-0.00203<0 and f(2)=7>0
∴ Now, Root lies between x0=1.60045 and x1=2
x8=x0-f(x0)⋅x1-x0f(x1)-f(x0)
x8=1.60045-(-0.00203)⋅2-1.600457-(-0.00203)
x8=1.60056
f(x8)=f(1.60056)=2⋅1.600563-2⋅1.60056-5=-0.00048<0
Approximate root of the equation 2x3-2x-5=0 using False Position mehtod is 1.60056
n x0 f(x0) x1 f(x1) x2 f(x2) Update
1 1 -5 2 7 1.41667 -2.14699 x0=x2
2 1.41667 -2.14699 2 7 1.55359 -0.60759 x0=x2
3 1.55359 -0.60759 2 7 1.58924 -0.15063 x0=x2
4 1.58924 -0.15063 2 7 1.59789 -0.0361 x0=x2
5 1.59789 -0.0361 2 7 1.59996 -0.00858 x0=x2
6 1.59996 -0.00858 2 7 1.60045 -0.00203 x0=x2
7 1.60045 -0.00203 2 7 1.60056 -0.00048 x0=x2
REFERENCES
1] M. Aslam Noor, F. Ahmad, Numerical comparison of iterative methodsfor solving nonlinear
equations,J.Appl.Math.Comput.,180
(2006) 167-172
[2] M. Aslam Noor, F. Ahmad, Sh. Javeed, Two-step iterative methods for nonlinear equations , J. Appl. Math.
Comput.,181 (2006) 1068-1075.
[3] M. Aslam Noor, F. Ahmad, On a predictor-corrector method for solvingnonlinear equations, J. Appl. Math.
Comput.,183 (2006) 128-133
[4] C.T. Kelly, Iterative Methods for Linear and Nonlinear Equations, SIAM,Philadelphia, PA, 1995.
[5] J.F. Traub, Iterative Methods for Solution of Equations, PrenticeHall,Englewood Cliffs, NJ, 1964.
© IJARCCE This work is licensed under a Creative Commons Attribution 4.0 International License 229
