Bisection Method

Computational math
Bracketing
No derivatives
Guaranteed convergence
Root finding
Authors

Dhruv Azad

Apurva Nakade

Published

June 25, 2026

The bisection method finds a root by repeatedly halving an interval \([a, b]\) where \(f\) changes sign, guaranteeing that each half still contains a root. At each step, the bisection method computes the midpoint

\[ m=\frac{a+b}{2}. \]

Then it keeps the half of the interval where the sign change still occurs. Repeating this process makes the interval smaller and smaller around the root.