When does iteration converge?: a maths EPQ idea
A title to start from
When does the iteration xₙ₊₁ = g(xₙ) converge to a root, and how can the speed of convergence be predicted?
Why it works as an EPQ
It starts from the A Level numerical methods topic and asks a precise question you can answer with a theorem, graphs and computed evidence.
Scope and difficulty
Solid. Solid. One clear theorem with proof, then experiments; Newton–Raphson makes a strong final comparison.
The maths
Builds on these A Level topics: Numerical methods · Differentiation · Sequences and series.
You would learn:
- The mean value theorem
- Order of convergence
- Newton–Raphson as a fixed-point method
One possible plan
- Show with cobweb and staircase diagrams how |g′(x)| near the root decides what happens.
- Prove convergence when |g′| < 1 near the root.
- Measure errors from a spreadsheet and estimate the order of convergence.
- Compare rearrangements of the same equation and Newton–Raphson.
Pitfalls
- Only showing examples, with no proof.
- Stopping iterations by eye instead of using a clear error tolerance.
Where to start reading
- Search for: fixed point iteration convergence mean value theorem
- Your A Level numerical methods notes, then a first-year numerical analysis text
Similar ideas
- What makes e the natural base?What makes e the 'natural' base for exponentials and logarithms?
- The four colour theorem and computer proofWhy was the computer-assisted proof of the four colour theorem controversial, and should it be trusted?
- From the pigeonhole principle to Ramsey numbersHow far can the pigeonhole principle take us, from simple puzzles to Ramsey numbers?
- Proofs that the primes never run outWhich proof that there are infinitely many primes is the most powerful, and why?
All pure maths ideas · all 93 ideas
Your EPQ must be your own work. These pages coach: ideas, structure, checklists and planning. Submitting text, proofs, code or analysis written by someone else or by an AI tool as your own is malpractice. How to use help and AI honestly.