Newton-Raphson Method

The Newton-Raphson method is one of the most powerful and widely used numerical techniques for finding the roots of a real-valued function — that is, the values of x where f(x) = 0. Rather than solving an equation algebraically (which is often impossible for complex functions), this iterative method uses the function's derivative to make progressively better approximations of the root, closing in on the answer with remarkable speed. The core idea is geometric: at any point on a curve, the tangent line provides a linear approximation of the function. Where that tangent line crosses the x-axis gives a better estimate of the root than the point you started from. By repeating this process — drawing a new tangent at the improved estimate — the approximations converge rapidly toward the true root. This process typically doubles the number of correct decimal places with each iteration, a property called quadratic convergence. Newton-Raphson sits at the intersection of calculus and computation. It is used everywhere from engineering and physics to financial modelling and computer graphics. Understanding it requires both the concept of the derivative and the logic of iterative algorithms, making it a perfect capstone topic in applications of derivatives.

Key takeaways
  • Choose an Initial Guess x₀
  • Compute the Tangent Line at x₀
  • Apply the Iteration Formula Repeatedly
  • Check for Convergence and Pitfalls

Choose an Initial Guess x₀

Select a starting value x₀ that is reasonably close to the root you want to find. A good initial guess can be found by graphing f(x) and identifying approximately where it crosses the x-axis, or by evaluating f at a few test values and applying the Intermediate Value Theorem (if f(a) and f(b) have opposite signs, a root exists between a and b).

Compute the Tangent Line at x₀

The tangent line to y = f(x) at the point (x₀, f(x₀)) has slope f'(x₀) and passes through (x₀, f(x₀)). Its equation is: y − f(x₀) = f'(x₀)(x − x₀). To find where this tangent crosses the x-axis, set y = 0 and solve: x = x₀ − f(x₀)/f'(x₀). This x-value becomes our next, improved estimate x₁.

Apply the Iteration Formula Repeatedly

Replace x₀ with x₁ and repeat the process. In general, given the current approximation xₙ, compute the next approximation using the Newton-Raphson formula: xₙ₊₁ = xₙ − f(xₙ)/f'(xₙ). Continue iterating until two successive approximations agree to the desired level of accuracy (e.g., |xₙ₊₁ − xₙ| < 0.0001).

Check for Convergence and Pitfalls

The method may fail if f'(xₙ) = 0 (horizontal tangent — division by zero), if the initial guess is far from the root, or if the function has multiple roots and the method converges to the wrong one. Always verify the final answer by substituting back into f(x) and checking that f(xₙ) ≈ 0. If the iterates oscillate or diverge, try a different starting value.

The Key Equation

xn+1=xn−f(xn)f′(xn)x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)}
  • x_{n+1} — Next approximation (same units as x): The improved estimate of the root produced by this iteration step.
  • x_n — Current approximation (same units as x): The approximation of the root at the nth step of the iteration.
  • f(x_n) — Function value (same units as f(x)): The value of the function evaluated at the current approximation; measures how far f is from zero.
  • f'(x_n) — Derivative value (units of f(x) per unit of x): The slope of the tangent line at the current approximation; must be non-zero for the method to work.

Worked Example

Problem. Use the Newton-Raphson method to find the positive root of f(x) = x³ − 2, starting with x₀ = 1. Perform three iterations and compare to the exact answer ∛2 ≈ 1.25992105.

x3≈1.2597≈23x_3 \approx 1.2597 \approx \sqrt[3]{2}

Answer. After three iterations, x₃ ≈ 1.2597, which is accurate to within 0.02% of the true value ∛2 ≈ 1.25992.

Figure
Diagram
Newton-Raphson: Geometric Interpretationxyy=f(x)x₀tangent at x₀x₁tangent at x₁x₂rootEach tangent line brings xₙ closer to the root where f(x)=0
Origins · 1 minIsaac Newton and how this was discovered
IN
Isaac Newton
1643–1727 · English

Isaac Newton developed an early version of this root-finding method around 1669, described in his work 'De analysi per aequationes numero terminorum infinitas'. Joseph Raphson independently published a clearer, more general iterative formulation in 1690, which is the version we use today. Together their names are given to the method. Newton's original approach was slightly different — applied polynomial by polynomial — while Raphson recognised it as a general iteration scheme applicable to any differentiable function. Newton was so modest (or secretive) about his method that it was not published in his lifetime; it appeared only in 1711, decades after Raphson's 1690 publication had already popularised the technique across Europe.

  • Definition of the Derivative — Newton-Raphson uses the derivative f'(xₙ) at every step; without understanding what a derivative measures (instantaneous rate of change / tangent slope), the formula has no geometric meaning.
  • Tangent Lines and Linear Approximation — The Newton-Raphson step is exactly the x-intercept of the tangent line at the current point, so understanding tangent lines is the geometric foundation of the entire method.
  • Intermediate Value Theorem — The IVT is the standard tool for guaranteeing a root exists in an interval and for choosing a good initial guess x₀ before starting Newton-Raphson iterations.
  • Rules of Differentiation — Applying Newton-Raphson requires computing f'(x) explicitly at each step, so fluency with the power rule, product rule, and chain rule is essential.