Historical Context & Motivation
Mathematics has always aimed to solve equations exactly, but many equations resist neat, closed-form solutions. As early as ancient Babylon, mathematicians discovered that repeatedly refining a guess could lead to remarkably accurate answers. This approach — called iteration — means applying a process again and again, each time getting closer to the true answer. For centuries, these methods were tedious to carry out by hand, but the rise of computers and graphing calculators transformed them into powerful, practical tools.
The central question that drives this topic is straightforward: When an equation has no exact algebraic solution, how can we still find accurate numerical answers? Iterative methods provide the answer by turning guessing into a systematic, convergent process.
Core Principles & Definitions
Before diving into calculations, it helps to understand the foundational ideas that make iterative methods work. These principles apply whether you are solving equations by hand, on a GDC, or with software.
Iteration
Fixed Point
Convergence vs. Divergence
Graphical Interpretation
Technology as a Tool
Visual Explanation — The Cobweb Diagram
The best way to understand how iteration converges to a fixed point is through a cobweb diagram (also called a staircase diagram). This diagram plots both y = g(x) and y = x on the same axes. Starting from your initial guess x₀, you trace a vertical line up to the curve y = g(x), then a horizontal line to the line y = x, then repeat. The path spirals or staircases toward the fixed point where the curve and line intersect.
In the diagram above, notice how each successive iterate (x₁, x₂, …) is closer to the fixed point than the one before. The key geometric insight is that convergence occurs when the curve y = g(x) is less steep than y = x near the fixed point. More precisely, the iteration converges when |g′(x*)| < 1 — that is, the slope of g at the fixed point has an absolute value less than one. If the curve is steeper than y = x at the crossing, the cobweb spirals outward and the iteration diverges.
Mathematical Framework
The mathematics of iterative methods centers on rearranging an equation f(x) = 0 into the form x = g(x), then generating a sequence of approximations. Below are the core formulas you need for AHL 2.9.
Convergence, Divergence & Choosing the Right Rearrangement
Not every rearrangement of an equation will produce a convergent iteration. The same equation f(x) = 0 can be rewritten as x = g(x) in multiple ways, and some rearrangements converge beautifully while others send your iterates flying off to infinity. Understanding why this happens — and how to choose the right form — is one of the most important skills in AHL 2.9.
How to Choose a Good Rearrangement
Consider the equation x³ + x − 5 = 0. You could rearrange it as x = 5 − x³, giving g(x) = 5 − x³. Near the root (around x ≈ 1.5), the derivative g′(x) = −3x² ≈ −6.75, so |g′| ≈ 6.75 > 1 — this will diverge. Instead, rearranging to x = ∛(5 − x) gives g(x) = (5 − x)^(1/3), with g′(x) = −1/(3(5 − x)^(2/3)) ≈ −0.13 near the root, so |g′| ≈ 0.13 < 1 — this will converge. When in doubt, graph both y = g(x) and y = x on your GDC and check which crossing has a shallower curve.
| Rearrangement | g(x) | |g′(x*)| (approx.) | Converges? |
|---|---|---|---|
| x = 5 − x³ | 5 − x³ | 6.75 | No |
| x = ∛(5 − x) | (5 − x)^(1/3) | 0.13 | Yes ✓ |
| x = 5/(x² + 1) | 5/(x² + 1) | 0.65 | Yes ✓ |
Worked Example
Let's work through a complete example using fixed-point iteration to solve an equation that cannot be solved algebraically.
Strengths, Limitations & Method Comparison
Iterative methods are incredibly useful, but they are not perfect. Understanding their strengths and limitations helps you decide when to use them and how to avoid common pitfalls.
| Aspect | Strength | Limitation |
|---|---|---|
| Scope | Can solve equations that have no algebraic solution (e.g., e^x = 3x) | Only gives a numerical approximation, not an exact answer |
| Speed | With a GDC, hundreds of iterations take seconds | By hand, each iteration requires careful arithmetic |
| Convergence | When |g′(x*)| < 1, convergence is guaranteed near x* | Wrong rearrangement → divergence; wrong x₀ → converging to wrong root |
| Accuracy | Can achieve any desired level of precision by doing more iterations | Rounding errors on calculators can accumulate over many steps |
| Multiple Roots | Can find different roots by choosing different starting values | May miss a root if your initial estimate is too far away |
Connections to Advanced Theory & Other IB Topics
The iterative methods you learn in AHL 2.9 connect to several other areas of mathematics and the wider IB curriculum. The table below maps out these connections.
| AHL 2.9 Concept | Connection | Where It Appears |
|---|---|---|
| Fixed-point iteration | Recursive sequences and series | AHL 1.12 — Sequences defined recursively |
| Graphical root-finding | Intersections of function graphs | SL 2.5 — Solving equations graphically |
| Newton–Raphson method | Tangent lines and derivatives | AHL 5.9 — Differential calculus |
| Convergence conditions | Limits and behavior of sequences | AHL 1.13 — Limits of sequences |
| Numerical solutions with technology | Modeling real-world problems | All HL topics — Internal Assessment |
Looking ahead, iterative methods are foundational in university-level numerical analysis, a branch of mathematics essential for engineering, physics simulations, machine learning, and financial modeling. The Newton–Raphson method, for instance, underpins many of the optimization algorithms used to train artificial neural networks. Mastering the core idea of iteration now gives you a head start in these fields.
Practice Problems
Lesson Summary
In this lesson, you learned that iterative methods provide a systematic way to solve equations that resist algebraic techniques. The process begins by rearranging f(x) = 0 into the form x = g(x), choosing an initial estimate x₀ (informed by a graph), and applying the fixed-point iteration formula x_{n+1} = g(x_n) repeatedly until the values stabilize to the required accuracy.
The convergence condition |g′(x*)| < 1 determines whether a rearrangement will work — visually captured by the cobweb diagram where convergent iterations spiral inward and divergent ones spiral outward. Your GDC is essential for performing iterations efficiently, graphing functions to locate roots, and verifying answers with built-in solvers. Remember: always show your iteration values clearly, state your answer to the required degree of accuracy, and check that your rearrangement satisfies the convergence condition.