Iteration and Newton-RaphsonAQA A-Level Maths: Revision notes
Section 1
Iterative methods
An iteration (recurrence relation) generates a sequence from a starting value. To solve , rearrange it into the form . For : , so . With : , , , . If the sequence converges to , then , so is a root of the original equation. Keep full calculator values (use the ANS key) and stop when successive terms agree to the required accuracy.
Rearrange so that appears alone on the left; the same equation has many rearrangements and they do not all converge.
Section 2
Staircase and cobweb diagrams
Draw and . From go vertically to the curve, horizontally to the line , and repeat. If the path is a staircase that converges from one side. If it is a cobweb spiralling inwards, with terms alternating either side of . If the path moves away from and the iteration diverges. For , , which is about at , so it converges in a cobweb.
Drawing the lines the wrong way round. Always go vertically to the curve first, then horizontally to .
Section 3
Newton-Raphson method
The Newton-Raphson method uses tangents. The tangent at meets the -axis at For , , so . With : , , close to . For with : , , , so (4 d.p.). The method usually converges very quickly when is close to the root.
Adding instead of subtracting , or forgetting to differentiate.
Check your answer by evaluating at values just above and below it to confirm a sign change.
Section 4
How the methods can fail
Iteration: the sequence diverges if near the root. The rearrangement for has , which is greater than 1 at the root , so starting at gives , , moving away. Newton-Raphson: it fails if (a horizontal tangent never meets the axis and the formula divides by zero). It can also converge to a different root, or oscillate, if is near a stationary point or far from the root. For , , so fails.
In a 'show that it fails' question, state the value of or and say what it means for the sequence.
That's the notes covered.
Carry on to the next subtopic.
Exam questions on Iteration and Newton-Raphson
- The equation has a root between 1 and 2. A student uses the iteration with .Find and , giving each to 4 decimal places.2 marks
- The Newton-Raphson method is used to approximate by solving , where , with starting value .Find , giving your answer to 4 decimal places.2 marks
- The equation , where , has a root close to 2. The Newton-Raphson method is used with .Show that the Newton-Raphson iteration is , and hence show that .3 marks
Written by the Exaim team, led by Shaun Daswani (Head of Upper Secondary, Improve ME Institute; MSc Financial Mathematics, Imperial College London; BSc, UCL) and Jason Daswani (operational lead, Improve ME Institute; LSE).