Root-Finding Suite

Locate roots of nonlinear equations using classical methods. View iteration history and convergence behavior.

Input

f(x) =

Method

Interval [a, b] (for bisection)

Initial guess(es)

Tolerance / Max iterations

Output

Configure and run.

▸ How it works

Bisection repeatedly halves an interval known to contain a root (requires sign change).

Newton-Raphson uses the tangent line: x_n+1 = x_n − f(x_n)/f'(x_n). Quadratic convergence when it works.

Secant approximates the derivative with a finite difference, needing two starting points.