Newton's Method Calculator

Frequently Asked Questions

What does Newton's method do?

It finds a root of f(x) by repeatedly following the tangent line: x_{n+1} = x_n − f(x_n)/f′(x_n).

How fast does it converge?

Quadratically near a simple root - the number of correct digits roughly doubles each step once you are close.

When does it fail?

When f′ is zero or near zero at an iterate, when the start point is far from a root, or for roots of multiplicity > 1 (where convergence slows to linear).

Why pick a good starting guess?

A poor guess can diverge or jump to a different root. This calculator shows each iterate so you can see whether it is settling down.

Provided by AllCalculators.io
Free online calculators for everyday. No registration required.

Estimates for informational purposes only.

Important Disclaimer: Estimates for informational purposes only.

This calculator provides estimates for informational purposes only. Results are based on assumptions and may not reflect actual outcomes. Consult qualified professionals in relevant fields before making important decisions based on these results.

JavaScript is required to use the interactive calculator above. The questions and answers below remain readable without JavaScript.

How This Calculator Works

Newton's method finds where f(x) = 0 by repeatedly following the tangent line. From a guess x_n it draws the tangent (slope f'(x_n)) and takes its x-intercept as the next, better guess: x_n+1 = x_n − f(x_n) ÷ f'(x_n). Geometrically you are linearising the curve and solving the easy linear problem; iterate until f(x) is within tolerance or successive guesses barely move. This tool uses a hand-written recursive-descent evaluator (+ − * ÷ ^, x, sin, cos, tan, exp, ln, sqrt, pi, e) with no JavaScript eval(). It is deliberately distinct from the Polynomial Roots calculator, which returns exact closed-form roots only up to degree 4 - Newton's method is an iterative numerical solver that works on any differentiable function, including transcendental ones with no algebraic formula.

Worked Example: √2 via x² − 2 = 0

Let f(x) = x² − 2, f'(x) = 2x, starting at x₀ = 1.5. Step 1: f = 0.25, f' = 3, so x₁ = 1.5 − 0.25÷3 = 1.41667. Step 2: x₂ ≈ 1.41422. Step 3: x₃ ≈ 1.41421356 - already correct to 8 digits. Notice the number of correct digits roughly doubles each step: that is quadratic convergence, the defining strength of Newton's method near a simple root. This is exactly how calculators and CPUs compute square roots internally.

Where Newton's Method Is Used

Engineering & physics: solving nonlinear equilibrium, orbit, and circuit equations with no closed form.

Optimization & ML: Newton and quasi-Newton (BFGS) steps find where a gradient is zero.

Finance: internal rate of return and implied volatility are root-finding problems.

Computing: hardware reciprocal and square-root units are Newton iterations in disguise.

Common Mistakes & Edge Cases

A bad starting guess can diverge, oscillate, or converge to the wrong root - Newton's method is only locally guaranteed.

If f'(x) ≈ 0 the tangent is nearly flat and the next guess flies off; the tool detects this and stops cleanly.

At a repeated root convergence drops from quadratic to merely linear.

The supplied derivative must actually match f(x) - a wrong f'(x) silently produces a wrong root with no warning.

Functions like x¹⁄³ with a vertical tangent at the root can cause endless oscillation.

Convergence: When It Doubles, When It Crawls

Near a simple root (where f = 0 but f' ≠ 0) the error obeys e_n+1 ≈ C·e_n² - quadratic convergence, so the number of correct digits roughly doubles every step and a handful of iterations reaches machine precision. At a repeated root (f and f' both zero) that collapses to linear convergence, gaining a fixed fraction of a digit per step; a modified iteration x_n+1 = x_n − m·f÷f' (with m the multiplicity) restores the quadratic rate. There is no global guarantee: choose x₀ in the wrong basin and the iterates can cycle forever, shoot off to ∞, or land on a different root entirely - the fractal "Newton basins" of a complex polynomial visualise exactly this sensitivity. A quick safeguard is to first bracket the root with a sign change, then start Newton inside that bracket.

Related Tools & Limits

When you cannot supply a derivative, the secant method approximates it from two recent points (super-linear, order ≈ 1.618); the bisection method is slower but guaranteed to converge if you bracket a sign change. Hybrid methods like Brent's combine the safety of bisection with Newton-like speed. For exact roots of low-degree polynomials prefer the closed-form Polynomial Roots tool. Results show 10 decimals with an iteration table so you can watch convergence (or divergence) directly; double-precision arithmetic caps useful accuracy near 15−16 significant digits.

Newton's Method Calculator

Frequently Asked Questions

Related Math Calculators