False position method Guide, Meaning , Facts, Information and Description

In numerical analysis, the false position method or regula falsi method is a root-finding algorithm that combines features from the bisection method and the secant method.

Table of contents

1 The method 1.1 Derivation of the formula for ck 2 Analysis 3 Example code

The method

Like the bisection method, the false position method starts two points a₀ and b₀ such that f(a₀) and f(b₀) are of opposite signs, which implies by the intermediate value theorem that the function f has a root in the interval [a₀, b₀]. The method proceeds by producing a sequence of shrinking intervals [a_k, b_k] that all contain a root of f.

At iteration number k, the number

is computed. As explained below, c_k is the root of the secant line through (a_k, f(a_k)) and (b_k, f(b_k)). If f(a_k) and f(c_k) have the same sign, then we set a_k+1 = c_k and b_k+1 = b_k, otherwise we set a_k+1 = a_k and b_k+1 = c_k. This process is repeated until the root is approximated sufficiently well.

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. On the other hand, the only difference between the false position method and the bisection method is that the latter uses c_k = (a_k + b_k) / 2.

Derivation of the formula for c_k

Given a and b, we construct the line through the points (a, f(a)) and (b, f(b)), as demonstrated in the picture on the right. Note that this line is a secant or chord of the graph of the function f. In point-slope form, it can be defined as

We now choose c to be the root of this line, so c is chosen such that

Solving this equation gives the above equation for c_k.

Analysis

If the initial values a₀ and b₀ are chosen such that f(a₀) and f(b₀) are of opposite signs, then the false position method will converge to a root of f. The speed of convergence will typically be superlinear, thus faster than the bisection method, but slower that the secant method.

Example code

The following C code was written for clarity instead of efficiency. It was designed to solve the same problem as solved by the Newton's method and secant method code: to find the positive number x where cos(x) = x³. This problem is transformed into a root-finding problem of the form f(x) = cos(x) - x³ = 0.

#include 
#include 
 
double f(double x)
{
    return cos(x) - x*x*x;
}
 
double FalsiMethod(double s, double t, double e, double m)
{
    int n;
    double r;
    for (n = 1; n <= m; n++)
    {
        r = t - f(t) * (s - t) / (f(s) - f(t));
        if (f(r) < e)
            return r;
        if (f(s) * f(r) < 0)
            t = r;
        else if (f(r) * f(t) < 0)
            s = r;
    }
    return r;
}
 
int main(void)
{
    printf("%0.15f\

", FalsiMethod(0, 1, 5E-11, 100));

    return 0;
}

After running this code, the final answer is approximately 0.865474032979005.

This is an Article on False position method. Page Contains Information, Facts Details or Explanation Guide About False position method

	Web www.E-paranoids.com