Convergence of Bisection Method
The rate of convergence of the Bisection method is linear and slow but it is guaranteed to converge if function is real and continuous in an interval bounded by given two initial guess.
Accuracy of bisection method is very good and this method is more reliable than other open methods like Secant, Newton Raphson method etc.
Despite being slower to converge, accuracy of this method increases as number of iterations increases.
In Bisection method, error is reduced by factor of ½ after each iterations, so we can write: en+1/en = 1/2. Which gives:
en+1 = en/2
Or, en+1 = 0.5 en ----- (1)
Here en+1 is error at n+1th iteration and en is error at nth iteration.
From equation (1) it can be concluded that, error at n+1th iteration is linearly related to error at nth iteration i.e. en+1 ∝ en
For this reason, Bisection method is said to have linear rate of convergence.
- Bisection Method Algorithm
- Bisection Method Pseudocode
- Python Program for Bisection Method
- C Program for Bisection Method
- C++ Program for Bisection Method
- MATLAB Program for Bisection Method
- Bisection Method Advantages
- Bisection Method Disadvantages
- Bisection Method Features
- Convergence of Bisection Method
- Bisection Method Online Calculator