Explore modules

Bisection Method

Bracket roots of continuous polynomials, follow interval halving, and distinguish each tested midpoint from the current midpoint and its guaranteed error bound.

Free theory article

Bracket roots of continuous polynomials, follow interval halving, and distinguish each tested midpoint from the current midpoint and its guaranteed error bound.

Concept & interpretation

A promising guess and a guaranteed enclosure answer different questions. Bisection starts with an interval known to contain a root, tests its midpoint, and keeps a half that still contains one. The interval supplies an error bound even when the exact root is unknown. No derivative or tangent is needed.

Run and challenge the bracket

Open the Bisection Method explorer. Its four polynomial presets accept custom decimal endpoints; the following values are actual supported inputs.

  1. Click Reset all. Function is x^2 − 2, endpoints are 0 and 2, and Bisection budget is 0. Predict current midpoint 1, error bound 1, and no last tested point.
  2. Click Next bisection three times, or set Bisection budget to 3. Verify [1.25, 1.5], current midpoint 1.375, bound 0.125, and last tested point 1.25. Read its separate pre-test bound 0.25 in the results.
  3. Set Plot window to Current bracket. The curve and axes zoom around the retained interval; the mathematical numbers stay the same. Drag the graph to pan, use arrow keys, and press Home or Reset view to restore navigation. These actions do not restart the calculation.
  4. Click Previous bisection: the retained interval becomes [1, 1.5], with current midpoint 1.25 and bound 0.25. Restart bisections returns to budget zero while preserving endpoints, function and plot-window choice.
  5. Choose Function x^3 − x, which supplies [−2, 2]. Finish bisections requests sixteen steps, but the first tested midpoint is exactly 0, so only one step completes. The initial interval also contains roots −1 and 1. Previous bisection returns to the zero-step preview, even though the requested budget was sixteen.
  6. Choose Function (x − 1)^2. On its default [0, 2], both endpoint values are 1 and the run has no sign-changing bracket, despite a root at 1. Change Left endpoint to 1: an endpoint root is now recognized immediately. Equal endpoints remain invalid, even at a root.
  7. For a narrow case, choose x^3 − x − 2, fill Left endpoint 1.521 and Right endpoint 1.522, and click Finish bisections. The current midpoint is approximately 1.521379707336, with positive bound 7.62939453125e-9. Switch to Current bracket to see the tiny retained interval at a useful scale. Clear an endpoint to hide invalid results, then Reset all to recover the default.

The solid indigo curve is the function; emerald marks a valid retained interval and endpoints, while rose marks an unverified input interval. White marks the current midpoint when a bracket is available, while amber marks the last completed test. A collapsed root can put several marks at the same coordinate. The ledger records the tested values before each interval update.

Read the full free theory article