method focus

Newton-Raphson Method Calculator

Solve equations numerically using Newton\'s method. Enter any function, and see iterations converge to the root with an interactive graph.

Back to Equation Solver

Quick Tips

Click to show tips

Try an Example

Pick a scenario to see how the calculator works, then adjust the values

Quadratic Equation

Solve a classic quadratic with two real roots.

Key values: x^2 - 5x + 6 = 0 · Two real roots

Linear Equation

Solve a simple linear equation for x.

Key values: 3x + 7 = 22 · Single root

Transcendental Equation

Find roots of sin(x) = x/3 using numerical methods.

Key values: sin(x) = x/3 · Numerical solution

Cubic with Complex Roots

Solve a cubic equation and show complex roots.

Key values: x^3 + x + 1 = 0 · Complex roots enabled

Documentation

The Newton-Raphson Method

Newton-Raphson is the most widely used numerical root-finding algorithm. Given a starting guess, it iteratively improves the estimate using the tangent line at each point:

x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)}

Geometrically: draw the tangent line to $f(x)$ at $x_n$ , then the next estimate $x_{n+1}$ is where that tangent crosses the x-axis.

Convergence Properties

When it works, Newton-Raphson converges quadratically — the number of correct digits roughly doubles with each iteration. Starting from a reasonable guess, 5–10 iterations typically achieve machine precision.

Convergence theorem: If $f$ is twice continuously differentiable and $f'(r) \neq 0$ at the root $r$ , then there exists a neighborhood of $r$ such that Newton-Raphson converges quadratically for any starting point in that neighborhood.

When Newton-Raphson Fails

Zero derivative: If $f'(x_n) = 0$ , the tangent line is horizontal and the formula divides by zero. The method stalls or diverges.
Cycling: Some starting points lead to cycles that never converge (e.g., $f(x) = x^3 - 2x + 2$ starting at $x_0 = 0$ ).
Overshoot: For functions with steep slopes, the method can jump far from the root. This is common with polynomial equations of high degree.
Multiple roots: At a root where $f'(r) = 0$ , convergence degrades from quadratic to linear. Modified Newton methods handle this.

This calculator uses Newton-Raphson with safeguards: it detects stalling, bounds the iteration count, and falls back to bisection when convergence fails.

Frequently Asked Questions

What is the Newton-Raphson method?

The Newton-Raphson method is a numerical root-finding algorithm. Given a starting guess $x_0$ , it iteratively improves the estimate using the formula $x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)}$ . Geometrically, each step follows the tangent line to where it crosses the x-axis.

How fast does Newton-Raphson converge?

Newton-Raphson converges quadratically near a simple root, meaning the number of correct digits roughly doubles with each iteration. Starting from a reasonable guess, 5 to 10 iterations typically achieve machine precision (about 15 decimal digits).

When does Newton-Raphson fail?

The method can fail when the derivative is zero at an iterate (division by zero), when the starting point leads to a cycle, when overshooting occurs on steep functions, or at multiple roots where convergence degrades to linear.

How do I choose a good starting point?

Plot the function first to estimate where roots are located. Choose a starting point near the root where the function is smooth and the derivative is not too small. For polynomials, try integer values or endpoints of the domain.

What is the difference between Newton-Raphson and bisection?

Newton-Raphson uses tangent lines and converges quadratically but can fail. Bisection repeatedly halves an interval containing a root and always converges but only linearly. This calculator uses Newton-Raphson with bisection as a fallback for robustness.

More Math Calculators

Explore the category

Absolute Value Calculator

Area Calculator

Circle Calculator

Percentage Calculator

Prime Factorization Calculator

Unit Circle Explorer