Root-Finding Visualizer
Solving f(x) = 0 is the workhorse of numerical computing, and the classic methods have distinct personalities. This visualizer animates them on the same function: bisection stubbornly halving its bracket, Newton’s method sliding down tangent lines, and the secant method cutting chords. Step through the iterations, watch the geometry drawn on the graph and the error table shrink — linearly for bisection, quadratically for Newton — and try the trap function where Newton cycles forever.
Runs 100% in your browser — simulations are computed locally on your device.
Read the full guide to this tool
Notes
- Bisection always converges once it has a sign change, but only gains one bit of accuracy per step.
- Newton doubles the correct digits each step near a simple root — but can cycle or fly off from a bad start.
- The secant method needs no derivative and converges at the golden-ratio rate ≈ 1.618.
- Runs 100% in your browser — simulations are computed locally on your device.