Loading...
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 the equation into , then iterate from a starting value . If the sequence settles down, it converges to a root.
Tip — Keep extra decimal places between steps to avoid rounding error.
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
Common mistakes to avoid
Key takeaways
Test yourself
Ready to lock in Iteration? Pick a mode and earn XP & Dobloons.