Newton’s method is the fastest everyday way to solve an equation that has no neat formula. Starting from a guess, it repeatedly slides down the tangent line to a better guess. This calculator applies the method to a cubic polynomial a·x³ + b·x² + c·x + d, shows the first iterations, and returns the root after six steps with the value of f there.
How the calculation works
- f(x) = a·x³ + b·x² + c·x + d
- f′(x) = 3a·x² + 2b·x + c
- Step xₙ₊₁ = xₙ − f(xₙ) ÷ f′(xₙ)
- Result = x₆, the value after six iterations
- Check = f(x₆), which should be close to zero
If the slope at a point is zero, the iteration stays where it is rather than divide by zero.
Example
The classic equation x³ − 2x − 5 = 0 (a = 1, b = 0, c = −2, d = −5) starting from x₀ = 2: the first step gives x₁ = 2.1, the second x₂ = 2.094568, and the third x₃ = 2.09455148. After six iterations, the root is 2.09455148 to eight decimals, f there is about 0, and 3 iterations still changed the value.
Why it matters
Newton’s method is behind the square-root function on calculators, the solvers in spreadsheets and the optimization in machine learning. It converges very quickly near a root, which is why a handful of steps is enough, but it needs a reasonable starting guess. Seeing each iteration shows why.
Good to know
A starting guess near a flat part of the curve can send the iteration far away. A cubic can have up to three real roots: different starting values lead to different ones. If the iteration does not converge, try another starting value, or bracket the root first with a sign change. This tool is for education.
Related tools
The cubic equation calculator gives all the roots at once, the quadratic equation calculator solves degree two, and the definite integral calculator works with the same polynomial.