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

DifficultyAllLevel 2Level 3Level 4Level 5
  1. 1
    (a) Show that x3−7x+2=0x^3 - 7x + 2 = 0 can be written as x=x3+27x = \dfrac{x^3 + 2}{7}.
    (b) Using xn+1=xn3+27x_{n+1} = \dfrac{x_n^3 + 2}{7} with x0=0x_0 = 0, find the root near 00 to 3 decimal places.
    Level 2 · 5 marksTry it
  2. 2
    The iteration xn+1=2xn+53x_{n+1} = \sqrt[3]{2x_n + 5} is used with x0=2x_0 = 2 to find a root of x3−2x−5=0x^3 - 2x - 5 = 0. Find x1x_1, x2x_2 and x3x_3, giving each to 4 decimal places.
    Level 2 · 3 marksTry it
  3. 3
    Show that the equation x2−5x+3=0x^{2} - 5x + 3 = 0 can be rearranged into the form

    x=x2+35x = \dfrac{x^{2} + 3}{5} (2 marks)
    Level 2 · 2 marksTry it
  4. 4
    The iteration xn+1=5xn−2x_{n+1} = \sqrt{5x_{n} - 2} is used with x0=2x_{0} = 2.

    Find x1x_{1}, x2x_{2} and x3x_{3}, giving each to 4 decimal places. (3 marks)
    Level 2 · 3 marksTry it
  5. 5
    The iteration xn+1=3xn+4x_{n+1} = \sqrt{3x_n + 4} converges to a limit α\alpha. Find, with integer coefficients, the equation that α\alpha satisfies, and hence state the value of α\alpha.
    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.

Start free