Brief false position method description can be found below the calculator
False position method is a root-finding algorithm that combines features from the bisection method and the Secant method.
As in secant method, we use the root of secant line (the value of x such that y=0) to compute next root approximation for function f.
The derivation of recurrence relation is the same as in secant method:
Suppose we have starting values x0 and x1, with function values f(x0) and f(x1).
The secant line has equation
The root of secant line (where у=0) hence
The above formula is also used in the secant method, but the secant method always retains the last two computed points, while the false position method retains two points which certainly bracket a root.
Graphical interpretation can be seen below.
As can be seen from the recurrence relation, the false position method requires two initial values, x0 and x1, which should bracket the root. But unlike the bisection method, the width of the bracket does not tend to zero with iterations.
The tolerance condition can be either:
— function value is less than ε.
— difference between two subsequent хk is less than ε. Note that this is the difference between two calculated subsequent xk, not the end-points of the interval.
More: False position method