Root Finding Tool
Find the roots $f(x) = 0$ using Bisection, Newton-Raphson, or Secant methods with visual iteration steps.
Equation & Method
Iteration Visualization
Iteration Log
| n | x_n | f(x_n) | Error |
|---|
Numerical Root Finding Methods
Finding the root (zero) of a function $f(x) = 0$ is a fundamental problem in engineering and science. Analytical solutions often don’t exist for complex non-linear equations, so we use iterative numerical methods.
Type: Bracketing
Convergence: Linear (Slow)
Idea: Requires two initial points $a, b$ where $f(a)$ and $f(b)$ have opposite signs. Repeatedly halves the interval. Guaranteed to converge if signs are opposite.
Type: Open
Convergence: Quadratic (Fast)
Idea: Uses the tangent line at the current guess $x_n$ to estimate $x_{n+1}$. Requires the derivative $f'(x)$. Can diverge if the initial guess is poor or $f'(x) \approx 0$.
Type: Open
Convergence: Superlinear ($1.618$)
Idea: Approximates the derivative using a secant line between two points. Useful when calculating $f'(x)$ is difficult. Faster than Bisection but doesn’t guarantee convergence.