Mathematics · Year 13 · Numerical Methods · Summer Term

Conditions for Convergence of Iteration

Investigate the conditions under which an iterative process of the form x(n+1) = g(x(n)) will converge to a root, specifically relating to the derivative g'(x).

TL;DR:Move beyond solving equations exactly and explore a powerful method for finding highly accurate approximate solutions. We will see how a simple idea from calculus, the tangent line, can be used to build an incredibly fast and efficient root-finding algorithm.

• National Curriculum Attainment Targets
• DfE Subject Content for Mathematics: I2 - Solve equations approximately using simple iterative methods, including recurrence relations of the form x(n+1) = g(x(n)).

About This Topic

The Newton-Raphson method is a cornerstone of the A-Level Mathematics and Further Mathematics curriculum, typically found within the Numerical Methods unit. It represents a powerful application of differential calculus, moving students beyond analytical solutions to equations towards iterative, algorithmic approaches. This topic builds directly upon students' understanding of differentiation as a tool for finding the gradient of a tangent, and then uses this tangent as a linear approximation to the curve to locate a root. For Year 13 students, the focus is not just on the mechanical application of the formula, but on a deeper conceptual understanding of its geometric basis and, crucially, its limitations.

Contextualising this for the GB curriculum, it is essential to contrast the Newton-Raphson method with other iterative schemes like fixed-point iteration. A key learning outcome is the ability to analyse the rate of convergence, appreciating the quadratic convergence of Newton-Raphson which makes it highly efficient under the right conditions. Equally important is the exploration of its failure modes. Students must be able to identify graphically and analytically why a particular starting value might lead to divergence, oscillation, or convergence to an unintended root. This encourages critical thinking and moves the topic from a simple procedure to a problem-solving exercise, preparing students for the style of questioning common in A-Level examinations.

Key Questions

1. Explain the role of the derivative, g'(x), in determining the convergence of an iterative formula.
2. Justify the condition that |g'(x)| < 1 is required in the vicinity of the root for convergence.
3. Analyse why some iterative formulae converge rapidly while others converge slowly or diverge.

Learning Objectives

• Derive the Newton-Raphson formula from a geometric interpretation using tangents.
• Apply the Newton-Raphson method to find approximations to the roots of a given equation.
• Demonstrate understanding of the conditions for failure of the method, including issues near turning points.
• Analyse and interpret the results of the iterative process, including the rate of convergence.
• Compare the features of the Newton-Raphson method with other numerical methods like fixed-point iteration.

Key Vocabulary

Iteration	The process of repeating a mathematical procedure, applying it to the result of the previous application, to generate a sequence of outcomes.
Convergence	The property of an iterative sequence approaching a specific limiting value as the number of iterations tends to infinity.
Root	A solution to an equation `f(x) = 0`, also known as a zero of the function `f(x)`.
Tangent	A straight line that touches a curve at a single point and has a gradient equal to the derivative of the curve at that point.
Turning Point	A point on a curve where the gradient is zero, such as a local maximum, local minimum, or stationary point of inflection.
Quadratic Convergence	A property of an iterative method where the error at each step is proportional to the square of the error in the previous step, leading to very rapid convergence.

Watch Out for These Misconceptions

Common Misconception

The Newton-Raphson method will always find a root if one exists.

What to Teach Instead

The method can fail if the initial approximation is near a turning point (where the tangent is nearly horizontal), causing the next approximation to be very far away. It can also enter an infinite loop or diverge completely.

Common Misconception

The method always converges to the root that is closest to the starting point.

What to Teach Instead

The tangent line can 'overshoot' a nearby root and converge to a more distant one. The basin of attraction for each root can be complex and non-intuitive, so the closest root is not guaranteed.

Common Misconception

If the method fails, it's because I made a calculation error.

What to Teach Instead

While calculation errors are possible, failure is often an inherent property of the function and the chosen starting point. Understanding the geometric reasons for failure, such as a horizontal tangent, is a key part of the topic.

Active Learning Ideas

Collaborative Problem-Solving

Visualising Failure Cases

Using dynamic graphing software like GeoGebra or Desmos, students explore scenarios where the Newton-Raphson method fails. They manipulate the initial approximation `x_0` near turning points or between roots to observe divergent, oscillating, or unexpected convergent behaviour.

25 min·Pairs

Collaborative Problem-Solving

Iteration Race

In small groups, students solve the same equation using both the Newton-Raphson method and a fixed-point iteration (`x_{n+1} = g(x_n)`). They compare the number of iterations required to achieve a desired accuracy, providing a tangible demonstration of quadratic versus linear convergence.

20 min·Small Groups

Collaborative Problem-Solving

Algorithm Builders

Students implement the Newton-Raphson method as a short program on a graphical calculator or in a simple scripting language like Python. This reinforces the iterative nature of the formula and allows for rapid testing of different functions and starting values.

30 min·Individual

Real-World Connections

• Calculating the internal rate of return (IRR) in finance, which requires finding the root of a high-degree polynomial representing cash flows.
• In computer graphics, ray tracing algorithms use the method to find the precise intersection point of a light ray with a curved surface.
• Used in engineering to solve implicit equations, such as the Colebrook equation for fluid friction in pipes, where the variable cannot be isolated.
• In GPS and satellite navigation systems, it is used to solve systems of non-linear equations to determine a precise location from satellite timing signals.

Assessment Ideas

Quick Check

Use mini-whiteboards for students to show their calculated value of `x_1` from a given `f(x)` and `x_0`. This allows for a quick check on their ability to differentiate correctly and apply the formula.

Quick Check

An exam-style question that asks students to perform two iterations of the method, followed by a part that requires them to sketch the function and explain why a different starting value would fail to converge to the desired root.

Quick Check

Students use a pre-prepared graphing tool (e.g., Desmos) that visualises the Newton-Raphson steps. They can check their manual calculations against the tool and independently explore the effect of changing the initial value.

Frequently Asked Questions

What does 'quadratic convergence' actually mean in practice?

It means that the number of correct decimal places in the approximation roughly doubles with each iteration, provided the initial guess is sufficiently close to the root. This makes it significantly faster than methods with linear convergence, like many fixed-point iterations.

What should I do if my chosen starting value `x_0` doesn't work?

First, sketch the graph of `y=f(x)` to see what might be happening. Your starting point may be near a turning point or on the wrong side of one. The best strategy is to choose a new starting value that appears closer to the desired root and avoids these problematic areas.

Is the Newton-Raphson method on the A-Level Mathematics syllabus or just Further Mathematics?

The Newton-Raphson method is explicitly part of the A-Level Further Mathematics syllabus for all English exam boards. While the general concept of iteration is in the standard A-Level Mathematics syllabus, this specific method is typically reserved for Further Maths.