Numerical Root Finding
Newton: x_{n+1}=x_n−f(x_n)/f′(x_n) — quadratic convergence. Bisection: halve interval where f(a)f(b)<0. Secant: uses two points, no derivative. Quadratic formula for degree 2.
Did our AI summary help? Let us know.
Newton's method has quadratic convergence near a simple root. Bisection always converges but linearly — halves interval each step. Secant avoids derivative but may not converge if initial guess is poor.
Ready to run the numbers?
Why: Many polynomials have no closed-form roots (degree ≥5). Numerical methods find approximate roots. Newton converges fast near root. Bisection is robust. Used in engineering and scientific computing.
How: Newton: need f and f′. Iterate until |f(x)|<tol. Bisection: bracket root with f(a)f(b)<0, halve interval. Secant: use two previous points, no derivative. Quadratic: use formula for degree 2.
Run the calculator when you are ready.
Real-World Scenarios — Click to Load
Root Values (real)
Iterations per Root
Calculation Steps
For educational and informational purposes only. Verify with a qualified professional.
🧮 Fascinating Math Facts
Newton: x²−2=0, start x=1.5 → 1.4167 → 1.4142 (√2).
— Example
Bisection: if f(1)<0 and f(2)>0, root in (1,2). Midpoint 1.5.
— Method
Key Takeaways
- Newton's method converges quadratically near a root but needs a good initial guess and derivative.
- Bisection always converges (if sign change exists) but is slower (linear). No derivative needed.
- Secant method approximates the derivative; superlinear convergence, no derivative formula.
- Analytical formulas exist only for degree ≤ 4. Degree 5+ requires numerical methods (Abel-Ruffini).
- Convergence criteria: |xₙ₊₁ − xₙ| < ε or |f(xₙ)| < ε. Max iterations prevent infinite loops.
Did You Know?
How It Works
Numerical root-finding iteratively refines an approximation. Newton: xₙ₊₁ = xₙ − f(xₙ)/f′(xₙ). Bisection: halve the interval [a,b] where f(a)f(b) < 0. Secant: replace f′ with (f(xₙ)−f(xₙ₋₁))/(xₙ−xₙ₋₁). For polynomials, deflation removes found roots to find the next. Analytical: degree 1–2 use direct formulas; degree 3–4 use Cardano/Ferrari (complex).
Expert Tips
Good initial guess
Newton and secant need a guess near the root. Plot the polynomial first.
Bisection for robustness
If Newton fails or oscillates, try bisection with an interval [a,b] where f(a)f(b)<0.
Tolerance trade-off
Smaller tolerance = more iterations. 1e-8 is usually sufficient for most applications.
Multiple roots
Use deflation or specialized methods. Newton converges slowly for multiple roots.
Method Comparison Table
| Method | Convergence | Derivative | Robustness |
|---|---|---|---|
| Newton | Quadratic | Required | Sensitive to guess |
| Bisection | Linear | Not needed | Very robust |
| Secant | Superlinear | Approximated | Moderate |
Frequently Asked Questions
When does Newton fail?
Newton can diverge with a bad guess, or cycle. It also converges slowly for multiple roots (f'(x)=0 at root).
Why use bisection?
Bisection always converges if f(a)f(b)<0. No derivative, no guess—just an interval. Slower but reliable.
What is deflation?
After finding a root r, divide the polynomial by (x−r) to get a lower-degree polynomial for the next root.
Can we find complex roots?
Yes, but Newton/bisection on the reals only find real roots. Use complex initial guess or specialized methods.
What is Wilkinson's polynomial?
∏(x−k) for k=1..20. Roots are 1,2,...,20. Tiny coefficient errors cause huge root errors—ill-conditioned.
When do analytical formulas fail?
Degree 5+ have no general formula (Abel-Ruffini). Degree 3–4 formulas exist but are complex; numerical often easier.
Quick Reference
Disclaimer: Numerical methods give approximate roots. For ill-conditioned polynomials (e.g., Wilkinson), results may be sensitive to tolerance and coefficient precision.
Related Calculators
Cubic Equation Calculator
Solve cubic equations ax³+bx²+cx+d=0 using Cardano's formula. Find all roots (real and complex), discriminant analysis, Vieta's relations, depressed cubic form, and step-by-step solutions. Essential for polynomial theory, physics, and engineering applications.
MathematicsPolynomial Root Calculator
Find real and complex roots of polynomials up to degree 4. Uses quadratic formula for exact solutions, numerical methods for cubic and quartic. Includes rational root theorem, Descartes' rule of signs, multiplicity, and upper/lower bounds. Bar and doughnut charts for root visualization.
MathematicsRational Zeros Calculator
Apply the Rational Zeros Theorem to list all possible rational zeros p/q of a polynomial with integer coefficients. Test each candidate, find actual zeros...
MathematicsBox Method Calculator
Multiply polynomials visually using the box method (area model). Step-by-step solutions for binomials, trinomials, and factoring. Interactive grid...
MathematicsCompleting the Square Calculator
Convert quadratic expressions from standard form ax²+bx+c to vertex form a(x-h)²+k. Find vertex, axis of symmetry, x-intercepts, and min/max values....
MathematicsDiamond Problem Calculator
Solve diamond problems: find two numbers given product and sum, or find product and sum given two numbers. Reverse mode. Direct connection to factoring...
Mathematics