P3 6.2 - Iterative solutions
Use a supplied rearrangement of an equation to build successive approximations to a root. You will generate iterates accurately, recognise when a sequence fails to settle, and check a claimed decimal answer using the original equation.
Rearranging to a supplied iterative form
Can two rearrangements of the same equation behave differently on a calculator? For , both for a positive root and are valid rearrangements. Repeatedly using their right-hand sides can produce very different sequences.
Iteration turns a rearrangement into an update rule: put the current approximation into to obtain the next approximation. First show that a fixed value of the rule satisfies the desired equation, with any required domain restrictions.
Iteration and fixed point
An iteration repeats a calculation using its latest output. In
is the current approximation and is the next. A fixed point satisfies : the update leaves it unchanged.
A square-root rearrangement selects the nonnegative branch. State that restriction rather than silently discarding a negative solution.
Worked example 1: deriving a supplied square-root form
Show that a positive root of satisfies , and state the corresponding iteration.
Plan. Isolate , then take the positive square root because the required root is positive.
Answer. Use from a supplied suitable starting value. The update is real when .
Check. A positive fixed point satisfies , which rearranges back to . Taking the positive square root is justified for this root.
Change only the coefficient of the linear term from to . The same algebra gives a different update.
Worked example 2: a changed linear coefficient
Show that a positive root of satisfies , and state the iteration.
Plan. Isolate the square and use the positive branch again.
Answer. , real when .
Check. Squaring a positive fixed point gives , exactly the original equation after rearranging. The branch condition rules out introducing a negative fixed value.
A valid rearrangement identifies possible fixed points. It does not guarantee that the sequence from a particular starting value will reach one.
Watch out
Write , not . The input is the current approximation's value, not its position in the sequence.
Change the linear coefficient once more and show the algebra.
Generating iterates
Once the rule and starting value are supplied, generate each new term from the latest one. Retain your calculator's full precision internally, rounding only the values you report.
For , typing the expression with the calculator's previous-answer value lets you repeat the update. Check whether the initial value is labelled or : this changes the labels on every subsequent term.
Initial approximation
An initial approximation, such as , starts the iteration. One update gives , two updates give , and so on. The rule and starting index must both be retained.
Show at least one substitution to make the iterative method visible.
Worked example 3: starting below the root
Use , with , to find to six decimal places.
Plan. Apply the square-root update four times, carrying unrounded values into each new calculation.
Answer. , respectively.
Check. Reversing the final update gives , to the working precision. Each listed term is larger than its predecessor in this calculation.
Change only the initial value to . The same update now approaches from above.
Worked example 4: starting above the root
Use , with , to find to six decimal places.
Plan. Keep the update unchanged and use the new starting approximation.
Answer. , respectively.
Check. Again . The values decrease here, while Example 3's increase; both are approaching the same region near .
Different starting values can give different early terms even when the eventual fixed point is the same.
Exam tip
Use the iteration specified in the question. A calculator's equation-solver answer does not show the requested successive approximations. Retain full precision in stored values and display the requested rounding.
Change only the starting value again.
Recognising convergence or failure
A useful iteration produces values that settle towards a fixed point. A correct algebraic rearrangement can also produce values that move away, cycle, or leave the real domain of the update.
For the same equation , compare two updates starting at .
| Update | Initial value and next four values, rounded for display |
|---|---|
The first sequence moves closer to the positive fixed point. The second moves rapidly away from it. That second rule still has the correct fixed points; its failure is in the behaviour of its repeated updates from this start.
Continue this lesson.
You’re previewing NovaLearn without an account. Create a free account to read the rest.
Create free account