- Home
- Courses
- AQA A-Level Maths
- Numerical Methods
- The Newton-Raphson Method
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.
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 -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.
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
The Newton-Raphson formula
At an estimate , the tangent to has gradient . Following this tangent down to the -axis (where ) gives a new, usually better estimate .
Example 1Use the Newton-Raphson method with to find one iteration toward a root of .
Tip — The formula is really just "follow the tangent to the x-axis": rearranging with gives exactly the Newton-Raphson formula.
Repeating for greater accuracy
Applying the formula repeatedly (using each new as the next ) 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 .
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.
When Newton-Raphson fails
The method can fail or converge very slowly if the starting value is chosen near a stationary point of (where , making the tangent nearly horizontal and sending 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 close to a stationary point of is a poor choice for Newton-Raphson.
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 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 being close to zero (near a stationary point).
Common misconceptions
Newton-Raphson method
Stretch yourself
Use the Newton-Raphson method with to find and for a root of , 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
Questions students ask
Why is Newton-Raphson usually faster than basic iteration?
What happens if f'(x) is zero or very small at my starting guess?
Do I need to rearrange the equation first, like with basic iteration?
Key takeaways
- Newton-Raphson formula: .
- 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.
The Newton-Raphson formula is:
Show answer and explanation
Answer:
The correct formula subtracts the ratio.
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.
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.
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.
For and , the value of is:
Show answer and explanation
Answer:
, , so .
Finished this lesson?
Loading your progress…
Keep practising
Start with the quiz above to check the key ideas. You can also choose another topic from the practice library.
Related lessons
All 4 lessons- Same chapterLocating RootsSign change and continuity.
- Same chapterIterationFixed-point iteration and staircase/cobweb diagrams.
- Same chapterThe Trapezium RuleEstimating area numerically.
Put the methods into practice: see how A-Level maths duels work. An account is required to play; the overview and sample are public.