Evaluating numerical algorithm
The False Position Method (Regula Falsi) improves upon the Bisection method by connecting boundary points and with a straight secant line. Instead of cutting blindly in the middle, it places the next guess right at the x-intercept of this secant line!
Find the real root of in the interval .
Evaluate at initial points and :
Since and , a root exists in .
Substitute values into the Regula Falsi secant formula:
Since and , replace the old left bound with .
| Step (k) | Left Bound (a) | Right Bound (b) | Intercept (C) | Value f(C) | Sign of f(C) | Next Bracket |
|---|---|---|---|---|---|---|
| 1 | 2.0000 | 3.0000 | 2.0588 | -0.3869 | f(c) < 0 | [2.0588, 3.0000] |
| 2 | 2.0588 | 3.0000 | 2.0813 | -0.1425 | f(c) < 0 | [2.0813, 3.0000] |
| 3 | 2.0813 | 3.0000 | 2.0895 | -0.0516 | f(c) < 0 | [2.0895, 3.0000] |
| 4 | 2.0895 | 3.0000 | 2.0924 | -0.0185 | f(c) < 0 | [2.0924, 3.0000] |
| 5 | 2.0924 | 3.0000 | 2.0935 | -0.0066 | f(c) < 0 | [2.0935, 3.0000] |
Iterating with the secant line intercept formula rapidly pulls the estimate toward the true root 2.09455 faster than standard bisection!