Regula Falsi Method Theory
Regula Falsi Method Theory
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 mid-point 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.
f(b) * (b-a)
c=b-
f(b) - f(a)
Now the next smaller interval which brackets the root can be obtained by
checking
a*f(b) -
c
b*f(a)
=
f(b) - f(a)
if f (a) * f (c) < 0 then b = c
else a = c
while (none of the convergence criterion C1, C2 or C3 is satisfied)
The false position method is again bound to converge because it brackets the
root in the whole of its convergence process.
Numerical Example :
Iteration
a b c f(a) * f(c)
No.
1 0 0.5 0.376 1.38 (+ve)
2 0.376 0.5 0.36 -0.102 (-ve)
3 0.376 0.36 0.36 -0.085 (-ve)
Work out with the Regula-Falsi method here
Note : Please enter equation like 3x+sin[x]-exp[x]. Use "[ ]" brackets for transcendentals and "( )" for others
eg., 3x+sin[(x+2)]+(3/4). 'a' and 'b' are the limits within which you are going to find the root. Few examples of
how to enter equations are given below . . . (i) exp[-x]*(x^2+5x+2)+1 (ii) x^4-x-10 (iii) x-sin[x]-(1/2) (iv) exp[(-
x+2-1-2+1)]*(x^2+5x+2)+1
Solution of Transcendental Equations | Solution of Linear System of Algebraic Equations | Interpolation & Curve
Fitting
Numerical Differentiation & Integration | Numerical Solution of Ordinary Differential Equations
Numerical Solution of Partial Differential Equations
search