10.2PureStretch
Iteration
Rearranging f(x) = 0 into the form x = g(x) lets you generate a sequence xₙ₊₁ = g(xₙ) that may converge to a root. Cobweb and staircase diagrams show how the iteration behaves.
What you'll be able to do
- Rearrange f(x) = 0 to x = g(x)
- Run an iterative formula
- Interpret cobweb and staircase diagrams
- Recognise convergence and divergence
1
The iterative formula
Rearrange the equation into , then iterate from a starting value . If the sequence settles down, it converges to a root.
Iterative formula.
1.
2.
3.
AnswerConverging towards ≈ 1.618.
Tip — Keep extra decimal places between steps to avoid rounding error.
2
Cobweb and staircase
On a graph of and , the iteration is traced by horizontal and vertical steps. A pattern (steady approach) or (oscillating) shows convergence; moving away shows divergence.
Formula recap
Iteration.
Rearranged equation.
Common mistakes to avoid
Rounding too early between iterations.
Carry full precision; round only the final answer.
Assuming every rearrangement converges.
Some forms of g(x) diverge — a different rearrangement may be needed.
Key takeaways
- Rearrange to x = g(x), iterate xₙ₊₁ = g(xₙ).
- Cobweb/staircase diagrams show convergence or divergence.
- Keep full precision between steps.
Test yourself
Ready to lock in Iteration? Pick a mode and earn XP & Dobloons.