I2PureStretch

The Newton-Raphson Method

Standard iteration can take many steps to converge, and depends on finding a good rearrangement. The Newton-Raphson method takes a completely different, geometric approach — follow the TANGENT at your current guess down to the x-axis, and that intersection is usually a dramatically better guess.

32 min Video by TLMaths Numerical Methods

The big picture

This is the fastest root-finding method in the course, and it needs no algebraic rearrangement at all — just the original function and its derivative. The idea is purely geometric: at your current estimate, draw the tangent line (which you can find because you can differentiate), and follow it down to where it crosses the xx-axis. Because the tangent hugs the curve closely near the point of contact, this new crossing point is usually a MUCH better approximation to the true root than the standard iteration formula would give in the same number of steps.

A-Level Maths I2-06: Locating Roots: Introducing the Newton-Raphson MethodCurated by Kepler, not produced by us. Watch it, then work through the notes below.
Open on YouTube

What you'll be able to do

  • Derive and use the Newton-Raphson iterative formula
  • Apply the method to find a root to a required degree of accuracy
  • Recognise situations where the Newton-Raphson method fails or converges poorly
  • Compare the efficiency of Newton-Raphson with basic iteration
1

The Newton-Raphson formula

At an estimate xnx_n, the tangent to y=f(x)y=f(x) has gradient f′(xn)f'(x_n). Following this tangent down to the xx-axis (where y=0y=0) gives a new, usually better estimate xn+1x_{n+1}.

xn+1=xn−f(xn)f′(xn)x_{n+1} = x_n - \dfrac{f(x_n)}{f'(x_n)}
The Newton-Raphson iterative formula.
Example 1Use the Newton-Raphson method with x0=1.5x_0=1.5 to find one iteration toward a root of f(x)=x3−x−1f(x)=x^3-x-1.
1f(x)=x3−x−1f(x)=x^3-x-1, so f′(x)=3x2−1f'(x)=3x^2-1.
2f(1.5)=3.375−1.5−1=0.875f(1.5)=3.375-1.5-1=0.875; f′(1.5)=3(2.25)−1=5.75f'(1.5)=3(2.25)-1=5.75.
3Apply the formula: x1=1.5−0.8755.75x_1=1.5-\dfrac{0.875}{5.75}.
Answer
x1≈1.3478x_1\approx1.3478 (compare to the true root ≈1.3247\approx1.3247 — already very close after just one step)

Tip — The formula is really just "follow the tangent to the x-axis": rearranging y−f(xn)=f′(xn)(x−xn)y-f(x_n)=f'(x_n)(x-x_n) with y=0y=0 gives exactly the Newton-Raphson formula.

2

Repeating for greater accuracy

Applying the formula repeatedly (using each new xn+1x_{n+1} as the next xnx_n) typically converges MUCH faster than basic iteration — often doubling the number of correct decimal places with every single step.

Example 1Continue the previous example for one more iteration to refine the root of f(x)=x3−x−1f(x)=x^3-x-1.
1Using x1≈1.3478x_1\approx1.3478: f(1.3478)≈1.34783−1.3478−1≈0.0448f(1.3478)\approx1.3478^3-1.3478-1\approx0.0448.
2f′(1.3478)=3(1.3478)2−1≈4.4501f'(1.3478)=3(1.3478)^2-1\approx4.4501.
3x2=1.3478−0.04484.4501≈1.3378x_2=1.3478-\dfrac{0.0448}{4.4501}\approx1.3378.
Answer
x2≈1.3378x_2\approx1.3378 (continuing to converge toward ≈1.3247\approx1.3247)
Why this works

Each Newton-Raphson step roughly SQUARES the error compared to the previous step (once close to the root) — this quadratic convergence is why the method needs so few iterations compared to basic fixed-point iteration.

3

When Newton-Raphson fails

The method can fail or converge very slowly if the starting value is chosen near a stationary point of ff (where f′(xn)≈0f'(x_n)\approx0, making the tangent nearly horizontal and sending xn+1x_{n+1} far away), or if the starting value is too far from the true root, sometimes jumping to a completely different root.

Example 1Explain why choosing x0x_0 close to a stationary point of ff is a poor choice for Newton-Raphson.
1Near a stationary point, f′(xn)≈0f'(x_n)\approx0.
2The formula divides by f′(xn)f'(x_n), so a very small denominator produces a huge (or undefined) jump in xn+1x_{n+1}.
Answer
The tangent is nearly flat, so it crosses the x-axis very far away (or not usefully at all) — the method can fail completely or converge extremely slowly.

Tip — A quick sketch of the curve near your chosen starting value helps confirm the tangent is well-behaved (a reasonably steep gradient, not near a turning point) before committing to several iterations.

Think like an examiner

  • You must differentiate the function correctly to find f′(x)f'(x) before applying the formula — this is often where marks are lost.
  • Work to sufficient decimal places at each step (usually one more than the required final accuracy) to avoid compounding rounding errors.
  • If asked to comment on a poor starting value, mention the risk of f′(xn)f'(x_n) being close to zero (near a stationary point).

Common misconceptions

Forgetting to recompute both f(xn)f(x_n) AND f′(xn)f'(x_n) at each new value of xnx_n.
Both must be evaluated freshly at the CURRENT estimate every single iteration — using an old derivative value is a common error.
Using too few decimal places during intermediate calculations.
Carry extra decimal places through each step; only round the final answer to the accuracy the question requests.
Assuming Newton-Raphson always converges regardless of the starting value.
A poorly chosen starting value (especially near a stationary point of f) can cause the method to fail or converge to the wrong root entirely.

Newton-Raphson method

xn+1=xn−f(xn)f′(xn)x_{n+1} = x_n - \dfrac{f(x_n)}{f'(x_n)}
The core iterative formula.

Stretch yourself

Use the Newton-Raphson method with x0=2x_0=2 to find x1x_1 and x2x_2 for a root of f(x)=x2−7f(x)=x^2-7, giving answers to 4 decimal places.

Hint — Differentiate f(x) first, then apply the formula twice in succession, using each result as the input to the next iteration.

Reveal solution
Solutionf(x)=x2−7f(x)=x^2-7, f′(x)=2xf'(x)=2x. Step 1: f(2)=4−7=−3f(2)=4-7=-3, f′(2)=4f'(2)=4. x1=2−−34=2+0.75=2.75x_1=2-\dfrac{-3}{4}=2+0.75=2.75. Step 2: f(2.75)=7.5625−7=0.5625f(2.75)=7.5625-7=0.5625, f′(2.75)=5.5f'(2.75)=5.5. x2=2.75−0.56255.5≈2.75−0.1023=2.6477x_2=2.75-\dfrac{0.5625}{5.5}\approx2.75-0.1023=2.6477. (The true value of 7≈2.6458\sqrt7\approx2.6458 — already very close after two steps.) ■\blacksquare

Questions students ask

Why is Newton-Raphson usually faster than basic iteration?
It uses the tangent (gradient information) at each step, which typically approximately squares the error at each iteration once close to the root — this quadratic convergence needs far fewer steps than fixed-point iteration for the same accuracy.
What happens if f'(x) is zero or very small at my starting guess?
The formula divides by f′(xn)f'(x_n), so a near-zero derivative produces an extremely large (or undefined) jump — the method can fail completely or send you far from the true root. Avoid starting near a stationary point.
Do I need to rearrange the equation first, like with basic iteration?
No — Newton-Raphson works directly with the original function f(x)f(x) and its derivative f′(x)f'(x), with no algebraic rearrangement required.

Key takeaways

  • Newton-Raphson formula: xn+1=xn−f(xn)f′(xn)x_{n+1}=x_n-\dfrac{f(x_n)}{f'(x_n)}.
  • Uses the tangent at each estimate to find a (usually much) better next estimate.
  • Converges faster than basic fixed-point iteration for well-chosen starting values.
  • Fails or converges poorly if the starting value is near a stationary point of f (where f'(x) ≈ 0).

How this fits the course

Test yourself

Answer a few questions, then review anything you missed.

Prefer paper? Open the written self-check

Answer each question before opening its answer. This self-check does not record a quiz score.

  1. The Newton-Raphson formula is:

    • xn+1=xn−f(xn)f′(xn)x_{n+1}=x_n-\dfrac{f(x_n)}{f'(x_n)}
    • xn+1=xn+f(xn)f′(xn)x_{n+1}=x_n+\dfrac{f(x_n)}{f'(x_n)}
    • xn+1=f(xn)x_{n+1}=f(x_n)
    • xn+1=f′(xn)f(xn)x_{n+1}=\dfrac{f'(x_n)}{f(x_n)}
    Show answer and explanation

    Answer: xn+1=xn−f(xn)f′(xn)x_{n+1}=x_n-\dfrac{f(x_n)}{f'(x_n)}

    The correct formula subtracts the ratio.

  2. The Newton-Raphson method uses the geometric idea of following:

    • The tangent line down to the x-axis
    • A chord between two points
    • The normal line
    • A horizontal asymptote
    Show answer and explanation

    Answer: The tangent line down to the x-axis

    This is the geometric basis of the method.

  3. The method can fail badly if the starting value is chosen near:

    • A stationary point of f
    • The y-axis
    • A positive value of x
    • A large value of x
    Show answer and explanation

    Answer: A stationary point of f

    f'(x) is near zero there, causing division problems.

  4. Compared to basic fixed-point iteration, Newton-Raphson typically:

    • Converges faster
    • Converges slower
    • Never converges
    • Requires no calculation of derivatives
    Show answer and explanation

    Answer: Converges faster

    Its quadratic convergence needs fewer steps.

  5. For f(x)=x2−5f(x)=x^2-5 and x0=2x_0=2, the value of x1x_1 is:

    • 2.252.25
    • 2.52.5
    • 22
    • 33
    Show answer and explanation

    Answer: 2.252.25

    f(2)=−1f(2)=-1, f′(2)=4f'(2)=4, so x1=2−(−1/4)=2.25x_1=2-(-1/4)=2.25.

Finished this lesson?

Loading your progress…

Next step

Keep practising

Start with the quiz above to check the key ideas. You can also choose another topic from the practice library.

Browse practice topics

Related lessons

All 4 lessons

Put the methods into practice: see how A-Level maths duels work. An account is required to play; the overview and sample are public.