Iterative methodsEdexcel International A Level Maths: Flashcards
Card 1 of 120 of 12 known
Question
What is a recurrence relation of the form $x_{n+1}=f(x_n)$?
Tap or press Space to reveal
Tap card or press Space to flip
See all 12 cards
- What is a recurrence relation of the form ?
- A rule giving each term from the previous one, starting from a value .
- How do you use ANS on a calculator for iteration?
- Enter the starting value and press =, then type the formula with ANS in place of and press = repeatedly.
- How do you rearrange for iteration?
- Rewrite it as and use .
- Rearrange to .
- , so .
- What equation does the limit L of a convergent iteration satisfy?
- , which reproduces the original equation.
- When does a sequence converge?
- When its terms get closer and closer to a single value.
- State the change-of-sign test for a root.
- If is continuous and , have opposite signs, a root lies between and .
- What must a full change-of-sign answer include?
- Both values (or signs), a statement that f is continuous, and a conclusion about the root.
- How do you confirm to 3 d.p.?
- Show that and have opposite signs.
- Why keep full calculator values between iterations?
- Rounding at each step builds up error; round only at the final answer.
- Name two ways an iteration can fail.
- The terms diverge, or they oscillate or settle on a different root from the one wanted.
- : give a rearrangement .
- (or ).
Exam questions on Iterative methods
- The equation has a root with . The recurrence relation , with , is used to find .Find and , giving each to 4 decimal places.2 marks
- The equation has a single real root .Use the iteration with to find , giving your answer to 3 decimal places.2 marks
- The function , for , has a root .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).