Bisection Method Calculator

What Is the Bisection Method? The bisection method is a root-finding algorithm that repeatedly halves an interval until the root is isolated to within any desired precision. It is one of the oldest and most reliable numerical methods — guaranteed to converge if a root exists in the interval. It was described in mathematical texts as early as the 17th century and remains widely used today for its simplicity and guaranteed convergence.

How It Works Given a continuous function f(x), choose an interval [a, b] where f(a) and f(b) have opposite signs. By the Intermediate Value Theorem, f must cross zero somewhere between a and b. Step 1: Compute midpoint c = (a + b) / 2. Step 2: If f(c) = 0, c is the root. If f(a) × f(c) < 0, the root is in [a, c]. Otherwise, it’s in [c, b]. Step 3: Replace the appropriate half and repeat until |b − a| < tolerance.

Convergence Rate After n iterations, the error is at most (b − a) / 2^n. To achieve precision of 10^−6 starting from an interval of width 1: need log₂(10^6) ≈ 20 iterations. This is linear convergence — each iteration gains one bit of precision (halves the error). Newton-Raphson converges quadratically (error squares each step) but requires a derivative and good starting point. The bisection method is slower but always works if the sign change condition is met.

Requirements f must be continuous on [a, b]. f(a) and f(b) must have opposite signs (the sign change guarantees a root). If both have the same sign, either there is no root or there are an even number of roots in the interval. The method finds one root per interval — for multiple roots, use different intervals.

Intermediate Value Theorem (IVT) The IVT states: if f is continuous on [a, b] and f(a) × f(b) < 0, then there exists at least one c in (a, b) where f(c) = 0. The bisection method is essentially a constructive proof of the IVT — it not only proves the root exists but also finds it. The IVT was formally proven by Bernard Bolzano, a Czech mathematician, in 1817 in Prague.

Comparison of Root-Finding Methods Bisection: guaranteed convergence, linear rate, no derivative needed. Best for reliability. Newton-Raphson: quadratic convergence, requires f’ and a good initial guess. Can diverge. Secant method: superlinear convergence, approximates derivative from two points. Regula Falsi (false position): like bisection but uses the secant line intersection. Often faster. Brent’s method: combines bisection, secant, and inverse quadratic interpolation. Best of all worlds — used in most numerical libraries (SciPy, MATLAB fzero).

Applications Engineering: finding equilibrium temperatures, pressures, or stresses. Finance: finding the interest rate (IRR) that makes NPV = 0. Physics: finding equilibrium positions in potential fields. Any problem that reduces to f(x) = 0 can use bisection as a fallback solver.