FP1.3 - Numerical solution of equations
- Syllabus
- 2019
- Topic
- —
- Level
- AS
Numerical root methods approximate a solution of f(x)=0 when exact algebra is unavailable or inconvenient. First locate a root: if f is continuous on [a,b] and f(a)f(b)<0, then at least one root lies between a and b.
| Method | Next approximation or interval | Main control |
|---|---|---|
| interval bisection | evaluate the midpoint m=(a+b)/2 and keep the half whose endpoint values have opposite signs | preserves a sign-change bracket; width halves each step |
| linear interpolation | x≈a−f(b)−f(a)f(a)(b−a) | uses the x-intercept of the chord through the two endpoint values |
| Newton-Raphson | xn+1=xn−f′(xn)f(xn) | uses the tangent at xn; needs f′(xn)=0 |
For f(x)=x3−x−1, f(1)=−1 and f(2)=5, so continuity gives a root in [1,2]. Since f(1.5)=0.875, one bisection gives [1,1.5]; since f(1.25)=−0.296875, a second gives [1.25,1.5]. The interval width is now 0.25.
Using x0=1.3 for the same function, f′(x)=3x2−1. One Newton-Raphson step gives x1=1.3−3(1.3)2−11.33−1.3−1=1.325307…. Keep unrounded values inside the calculation, then round the requested approximation only at the end.
Bisection is slower but keeps a certified bracket. Linear interpolation usually improves a bracket with one straight-line estimate. Newton-Raphson can converge quickly from a suitable starting value, but it does not preserve a bracket and a poor start or a near-zero derivative may send the iteration away from the intended root.
A sign change plus continuity proves at least one root, not exactly one. Always show the function values that select a bisection half, use the stated interval or starting approximation, differentiate the actual function for Newton-Raphson, and report the precision requested rather than rounding every intermediate value.