Regula-Falsi Method

Regula-Falsi Method
Type of Algorithm (Equation Solver)
The Regula-Falsi Method (sometimes called the False Position Method) is a
method used to find a numerical estimate of an equation.
This method attempts to solve an equation of the form f(x)=0. (This is very
common in most numerical analysis applications.) Any equation can be written in
this form.
Algorithm Requirements
This algorithm requires a function f(x) and two points a and b for which f(x) is
positive for one of the values and negative for the other. We can write this
condition as f(a)f(b)<0.
If the function f(x) is continuous on the interval [a,b] with f(a)f(b)<0, the algorithm
will eventually converge to a solution.
Regula-Falsi Algorithm
The idea for the Regula-Falsi method is to connect the points (a,f(a)) and (b,f(b))
with a straight line.
Since linear equations are the simplest equations to solve for find the regula-
falsi point (xrfp) which is the solution to the linear equation connecting the
endpoints.
Look at the sign of f(xrfp):
equation of line:
If sign(f(xrfp)) = 0 then end algorithm
f (b) f (a )
else If sign(f(xrfp)) = sign(f(a)) then set a = xrfp y f (a) x a
ba
else set b = xrfp
solving for xrfp

f (b) f (a )
f(b) 0 f (a) xrfp a
f(x) ba
xrfp f ( a ) b a
x-axis xrfp a
a b f (b) f (a )
f ( a ) b a
f(a) actual root xrfp a
f (b) f (a )
Example
Lets look for a solution to the equation x3-2x-3=0.
We consider the function f(x)=x3-2x-3
On the interval [0,2] the function is negative at 0 and positive at 2. This means
that a=0 and b=2 (i.e. f(0)f(2)=(-3)(1)=-3<0, this means we can apply the
algorithm).
f ( 0) 2 0 3(2) 6 3
xrfp 0
f (2) f (0) 1 3 4 2

3 21 This is negative and we will make the a =3/2

f ( xrfp ) f and b is the same and apply the same thing
2 8 to the interval [3/2,2].

3 f 32 2 32 3 821 12 3 21 54
xrfp
2 f (2) f 2 2 1 8
3 21
2 58 29
This is negative and we will make the a =54/29
54
f ( xrfp ) f 0.267785 and b is the same and apply the same thing to
29 the interval [54/29,2].
Stopping Conditions
Aside from lucking out and actually hitting the root, the stopping condition is
usually fixed to be a certain number of iterations or for the Standard Cauchy Error
in computing the Regula-Falsi Point (xrfp) to not change more than a prescribed
amount (usually denoted ).