Numerical methods in context
Studying this course? Keep your progress in one place.
Key facts
- Use a numerical method when no exact algebraic solution exists.
- Bisection is reliable but slow; Newton-Raphson is fast but needs ; iteration needs .
- Form the equation from the context, then write it as .
- To show a root to d.p., show a change of sign between the rounding boundaries.
- Evaluate a method with numbers: quote and link it to the behaviour.
Why numerical methods
When variables mix with their exponentials or logarithms, or an integral has no simple antiderivative.
Many problems cannot be solved analytically, by exact algebra. Equations such as and mix a variable with its exponential or logarithm, and integrals such as have no simple antiderivative.
Numerical methods give a solution to a required accuracy instead of an exact one. If an equation can be rearranged exactly (such as giving ), do that.
Which of these needs a numerical method?
Choosing a method
Match the method to the task: sign change for a root interval, Newton-Raphson for speed, trapezium rule for areas.
Interval bisection is reliable but slow. Fixed-point iteration needs a rearrangement with . Newton-Raphson is usually fastest but needs and fails if . For areas and integrals use the trapezium rule with enough strips.
| Bisection | Iteration | Newton-Raphson | Trapezium rule | |
|---|---|---|---|---|
| Needs | continuous and a sign change | A rearrangement | Equally spaced -values | |
| Weakness | Slow | Diverges if | Fails if | Accuracy depends on the strips |
Bisection
- Needs:
- continuous and a sign change
- Weakness:
- Slow
Iteration
- Needs:
- A rearrangement
- Weakness:
- Diverges if
Newton-Raphson
- Needs:
- Weakness:
- Fails if
Trapezium rule
- Needs:
- Equally spaced -values
- Weakness:
- Accuracy depends on the strips
Worked example
Solve (radians) using Newton-Raphson with .
- 1
and .
- 2
.
- 3
.
Which method needs the derivative of ?
Setting up a problem
Form the equation, write it as with defined units, and locate the root.
First form the equation from the context, then rewrite it as , with units. For , , and , so .
The iteration with gives and , which settle on the root. Use the ANS key. Always check that the answer makes sense: depths and widths must be positive, and the units stated.
Worked example
Show that has a root between and .
- 1
Let .
- 2
and .
- 3
is continuous and changes sign.
and . What does this show?
Required accuracy
Show a change of sign between the rounding boundaries, such as and for .
Stopping when successive iterates agree to the required number of decimal places is not a proof. To show a root is to d.p., show a change of sign over .
For integrals, compare estimates with different numbers of strips, or compute the percentage error when an exact value is known: for , strips give against , an error of .
Worked example
Show that the root of is to d.p.
- 1
.
- 2
.
- 3
There is a change of sign, and is continuous.
To show a root is to d.p., you should find the sign of at…
Evaluating a method
Give a value and a reason: for example, diverges because .
Be ready to say why a method fails or is poor. A rearrangement fails if . For , has at the root. From it gives , , diverging; the rearrangement converges.
Quote the numbers and link them to the behaviour. State limits too: bisection is slow, Newton-Raphson can fail near stationary points, and the trapezium rule is only as accurate as the strips allow.
- 1
Find g′(α)
differentiate the rearrangement and evaluate at the root
- 2
Compare with 1
is |g′(α)| less than 1, or more?
- 3
State the behaviour
converges (staircase or cobweb) or diverges
- 4
Quote values
give the numbers from the iteration as evidence
A rearrangement has . What do you say about the iteration?
Try an exam question
A student uses to find the root of near . Show that this iteration will not converge, and find using with .
[4 marks]
- [1]
- [1]
- [1], so the iteration diverges
- [1]
That's the notes covered.
Carry on to the next subtopic.
Try a question
Why is a numerical method needed to solve this equation?
1 mark, marked against the mark scheme
Why is a numerical method needed to solve this equation?
1 mark, marked against the mark scheme