I2PureStretch

Iteration

Rearrange an equation f(x)=0f(x)=0 into the form x=g(x)x=g(x), feed a starting guess through gg repeatedly, and — remarkably — the results often converge onto the exact root, getting closer with every repetition. This is fixed-point iteration.

32 min Video by TLMaths Numerical Methods

The big picture

The change-of-sign method only traps a root inside an interval; iteration\textbf{iteration} can pin it down to as many decimal places as you like. Rearranging f(x)=0f(x)=0 into x=g(x)x=g(x) turns root-finding into a self-feeding process: substitute a guess into gg, get a better guess, and repeat. Whether this converges (and how fast) depends entirely on the gradient of gg near the root — which is exactly what cobweb and staircase diagrams visualise.

A-Level Maths I2-01: Locating Roots: Introducing the x=g(x) MethodCurated by Kepler, not produced by us. Watch it, then work through the notes below.
Open on YouTube

What you'll be able to do

  • Rearrange f(x)=0f(x)=0 into an iterative form x=g(x)x=g(x)
  • Generate a sequence of iterates using xn+1=g(xn)x_{n+1}=g(x_n)
  • Sketch and interpret staircase and cobweb diagrams
  • Recognise conditions for convergence and divergence
1

Rearranging into x = g(x)

An equation f(x)=0f(x)=0 can usually be rearranged algebraically (isolating one xx) into the form x=g(x)x=g(x). A root of ff then corresponds to a fixed point\textbf{fixed point} of gg: a value where g(x)=xg(x)=x exactly.

Example 1Rearrange x3−x−1=0x^3-x-1=0 into the form x=g(x)x=g(x).
1Isolate xx: x3=x+1x^3=x+1, so x=x+13x=\sqrt[3]{x+1}.
Answer
x=g(x)=x+13x=g(x)=\sqrt[3]{x+1}

Tip — Many rearrangements are possible for the same equation — some converge quickly, some diverge entirely. Choosing a good one is part of the skill (covered further below).

2

Generating the iteration

Starting from an initial guess x0x_0, repeatedly apply gg: x1=g(x0)x_1=g(x_0), x2=g(x1)x_2=g(x_1), and so on. If the sequence converges, it converges to a root of the original equation.

xn+1=g(xn)x_{n+1} = g(x_n)
The iterative formula.
Example 1Using xn+1=xn+13x_{n+1}=\sqrt[3]{x_n+1} with x0=1x_0=1, find x1x_1, x2x_2 and x3x_3 to 4 decimal places.
1x1=1+13=23≈1.2599x_1=\sqrt[3]{1+1}=\sqrt[3]{2}\approx1.2599.
2x2=1.2599+13=2.25993≈1.3103x_2=\sqrt[3]{1.2599+1}=\sqrt[3]{2.2599}\approx1.3103.
3x3=1.3103+13=2.31033≈1.3212x_3=\sqrt[3]{1.3103+1}=\sqrt[3]{2.3103}\approx1.3212.
Answer
x1≈1.2599x_1\approx1.2599, x2≈1.3103x_2\approx1.3103, x3≈1.3212x_3\approx1.3212 (converging toward the true root ≈1.3247\approx1.3247)
3

Cobweb and staircase diagrams

Plotting y=g(x)y=g(x) alongside y=xy=x visualises the iteration process: draw a vertical line from x0x_0 to the curve y=g(x)y=g(x) (giving x1x_1), then a horizontal line across to y=xy=x, then vertical again to the curve, repeating. A staircase\textbf{staircase} pattern (moving steadily in one direction) shows convergence when 0<g′(x)<10<g'(x)<1 near the root; a cobweb\textbf{cobweb} pattern (spiralling around the fixed point) shows convergence when −1<g′(x)<0-1<g'(x)<0.

Why this works

If ∣g′(x)∣>1|g'(x)|>1 near the root, the iteration DIVERGES — the staircase or cobweb spirals outward rather than in, moving further from the root with each step.

Tip — To check whether an iteration will converge without drawing a full diagram, estimate ∣g′(x)∣|g'(x)| near the suspected root: if it is less than 1, expect convergence; if greater than 1, expect divergence.

Think like an examiner

  • When asked to comment on convergence, refer to the gradient of g(x)g(x) near the root — ∣g′(x)∣<1|g'(x)|<1 for convergence, ∣g′(x)∣>1|g'(x)|>1 for divergence.
  • Always work to at least one more decimal place than the final accuracy required, to avoid rounding errors compounding across iterations.
  • A staircase diagram converges monotonically from one side; a cobweb diagram spirals in from both sides alternately — describe which you see accurately.

Common misconceptions

Assuming every rearrangement x=g(x)x=g(x) of an equation will converge.
Convergence depends on the gradient of gg near the root — some valid rearrangements diverge and are useless for iteration, even though they are algebraically correct.
Rounding intermediate iterates too aggressively.
Carry extra decimal places through each iteration step to avoid compounding rounding errors — only round the FINAL answer to the required accuracy.
Confusing a cobweb diagram with a staircase diagram.
A staircase moves in steadily on one side (positive gradient near the root); a cobweb spirals in, alternating sides (negative gradient near the root).

Fixed-point iteration

xn+1=g(xn)x_{n+1} = g(x_n)
The iterative formula.
∣g′(x)∣<1 near the root⇒converges|g'(x)| < 1 \text{ near the root} \Rightarrow \text{converges}
Condition for convergence.

Stretch yourself

The equation x2−5x+2=0x^2-5x+2=0 is rearranged as x=x2+25x=\dfrac{x^2+2}{5}. Using x0=0.5x_0=0.5, find x1x_1, x2x_2, x3x_3 to 4 d.p., and comment on convergence.

Hint — Substitute repeatedly into g(x)=x2+25g(x)=\dfrac{x^2+2}{5}, then estimate g′(x)g'(x) near the resulting value to comment on convergence.

Reveal solution
Solutionx1=0.52+25=2.255=0.45x_1=\dfrac{0.5^2+2}{5}=\dfrac{2.25}{5}=0.45. x2=0.452+25=2.20255=0.4405x_2=\dfrac{0.45^2+2}{5}=\dfrac{2.2025}{5}=0.4405. x3=0.44052+25=2.1945≈0.4388x_3=\dfrac{0.4405^2+2}{5}=\dfrac{2.194}{5}\approx0.4388. The sequence is converging steadily toward approximately 0.4380.438 (a staircase pattern). Since g′(x)=2x5g'(x)=\dfrac{2x}{5}, near x≈0.44x\approx0.44, g′(x)≈0.176g'(x)\approx0.176, which satisfies ∣g′(x)∣<1|g'(x)|<1, confirming convergence. ■\blacksquare

Questions students ask

What is a fixed point?
A value of xx where g(x)=xg(x)=x exactly — geometrically, where the curve y=g(x)y=g(x) crosses the line y=xy=x. It corresponds to a root of the original equation f(x)=0f(x)=0.
Why do some rearrangements converge and others do not?
Convergence depends on the gradient g′(x)g'(x) near the fixed point. If ∣g′(x)∣<1|g'(x)|<1 there, the iteration draws closer with each step; if ∣g′(x)∣>1|g'(x)|>1, it moves further away.
What is the difference between a staircase and a cobweb diagram?
Both visualise the same iteration process. A staircase pattern (positive gradient near the root, between 0 and 1) approaches from one side only; a cobweb pattern (negative gradient, between −1 and 0) spirals in, alternating sides.

Key takeaways

  • Rearrange f(x)=0f(x)=0 into x=g(x)x=g(x); a root becomes a fixed point of gg.
  • Generate iterates using xn+1=g(xn)x_{n+1}=g(x_n) from a starting value.
  • Staircase diagrams show convergence for 0<g′(x)<10<g'(x)<1; cobweb diagrams for −1<g′(x)<0-1<g'(x)<0.
  • If ∣g′(x)∣>1|g'(x)|>1 near the root, the iteration diverges.

How this fits the course

Test yourself

Answer a few questions, then review anything you missed.

Prefer paper? Open the written self-check

Answer each question before opening its answer. This self-check does not record a quiz score.

  1. Rearranging f(x)=0f(x)=0 into x=g(x)x=g(x) turns a root into:

    • A fixed point of g
    • A stationary point of g
    • A y-intercept of g
    • An asymptote of g
    Show answer and explanation

    Answer: A fixed point of g

    Where g(x)=xg(x)=x exactly.

  2. The iterative formula is written:

    • xn+1=g(xn)x_{n+1}=g(x_n)
    • xn=g(xn+1)x_n=g(x_{n+1})
    • xn+1=g(n)x_{n+1}=g(n)
    • xn+1=xn+gx_{n+1}=x_n+g
    Show answer and explanation

    Answer: xn+1=g(xn)x_{n+1}=g(x_n)

    Each new term comes from applying g to the previous one.

  3. A staircase diagram typically occurs when g'(x) near the root is:

    • Between 0 and 1
    • Between −1 and 0
    • Greater than 1
    • Exactly 0
    Show answer and explanation

    Answer: Between 0 and 1

    Positive gradient less than 1 gives a one-sided approach.

  4. If |g'(x)| > 1 near the root, the iteration:

    • Diverges
    • Always converges quickly
    • Converges to zero
    • Is unaffected
    Show answer and explanation

    Answer: Diverges

    The iterates move further away rather than closer.

  5. A cobweb diagram occurs when g'(x) near the root is:

    • Between −1 and 0
    • Between 0 and 1
    • Exactly 1
    • Greater than 1
    Show answer and explanation

    Answer: Between −1 and 0

    Negative gradient produces the alternating spiral pattern.

Finished this lesson?

Loading your progress…

Next step

Keep practising

Start with the quiz above to check the key ideas. You can also choose another topic from the practice library.

Browse practice topics

Related lessons

All 4 lessons

Put the methods into practice: see how A-Level maths duels work. An account is required to play; the overview and sample are public.