A-level · Numerical methods
Iterative methods (x = g(x))Exam-style questions
Solving f(x) = 0 by rearranging it into x = g(x) and iterating x_(n+1) = g(x_n) from a starting value — why some rearrangements converge and others diverge, and reading staircase and cobweb diagrams.
20 questions · A-level level · mark scheme and worked solution on each · no sign-up to try
- 1(a) Show that can be written as .
(b) Using with , find the root near to 3 decimal places.Level 2 · 5 marksTry it - 2The iteration is used with to find a root of . Find , and , giving each to 4 decimal places.Level 2 · 3 marksTry it
- 3Show that the equation can be rearranged into the form
(2 marks)Level 2 · 2 marksTry it - 4The iteration is used with .
Find , and , giving each to 4 decimal places. (3 marks)Level 2 · 3 marksTry it - 5The iteration converges to a limit . Find, with integer coefficients, the equation that satisfies, and hence state the value of .Level 3 · 4 marksTry it
15 more questions on iterative methods (x = g(x))
Free with an account — just an email, no card. The whole bank, every mark scheme and worked solution.