Iterative methods
Studying this course? Keep your progress in one place.
Key facts
- A recurrence relation gives each term from the one before.
- To solve by iteration, rearrange it to and use .
- If the terms settle, the limit satisfies .
- Use full calculator values and round only at the end.
- Confirm a root to k decimal places with a change of sign.
Recurrence relations
Each term is found by putting the previous term into the rule.
A recurrence relation defines a sequence from a starting value .
For example with gives , then , , and so on.
If the terms settle towards a value, the sequence converges to a limit . Iteration finds approximate solutions of equations that cannot be solved algebraically.
- 1
Start with xₙ
the current term
- 2
Apply the rule
put xₙ into f
- 3
Get xₙ₊₁
the next term, which becomes the new xₙ
Then back to step 1
If and , what is ?
Rearranging into x = g(x)
Rearrange so that is on its own side, then iterate.
There are many possible rearrangements. For you can write and so , or .
In an exam the rearrangement is usually given and you are asked to show that it holds: write each algebraic step, isolate the required term and finish on exactly the printed form. Take care with signs and with dividing every term.
Worked example
Show that can be written as .
- 1
Move the 2: .
- 2
Factorise: .
- 3
Divide by : .
Rearrange to make the subject in the form .
Finding the limit
The limit satisfies , so it solves the original equation.
For large both and are approximately , so . This is a fixed point of the iteration.
For the limit satisfies , which cubes to .
Work with full calculator values and round only at the end, to a stated number of decimal places.
An iteration converges to . Which equation does satisfy?
Confirming a root
Test f at two values half a unit in the last place either side.
To show for : and ; is continuous, so a root lies in .
A full answer gives both values (or their signs), states that is continuous, and states the conclusion.
To confirm (3 d.p.), test and : opposite signs show .
To confirm a root is 2.31 to 2 d.p., which two values should you test?
Worked example
Show a root exists, rearrange, iterate, then confirm with a sign change.
Put the whole method together: locate the root by sign change, rearrange, iterate from the starting value, then confirm the accuracy.
Full worked example
The equation has a root between 3 and 3.5. Show that , use to find , , , and show that to 3 d.p.
- 1
Root: and , a change of sign.
- 2
Rearrange: , so , so .
- 3
Iterate with : , , .
- 4
Check: and , and is continuous.
Why do you stop iterating when consecutive terms agree to the required accuracy?
When iteration goes wrong
No: a sequence may diverge, oscillate, or settle on a different root.
Different rearrangements of the same equation behave differently, and a poor starting value can also cause failure. A sequence may diverge (terms grow without limit) or converge to a different root.
A converging sequence can oscillate about the root while closing in on it, such as with (2.307, 2.164, 2.228, ...).
In examination questions a suitable rearrangement is supplied.
Successive terms are 1.2, 1.8, 3.1, 6.4. What is happening?
Try an exam question
. (a) Show that has a root between 1 and 2. (b) Show that the equation can be rearranged to .
[5 marks]
- [1].
- [1].
- [1]States the sign change, that is continuous, and concludes a root lies in .
- [1]Rearranges to .
- [1]Takes the cube root of both sides: .
That's the notes covered.
Carry on to the next subtopic.
Try a question
Find , to 3 decimal places.
1 mark, marked against the mark scheme
Find , to 3 decimal places.
1 mark, marked against the mark scheme