P3.6 - Numerical methods
- Syllabus
- 2019
- Topic
- P3.6
- Level
- A2
If a function is continuous on an interval and its values at the two endpoints have opposite signs, its graph must cross the x-axis somewhere between them. Therefore the equation f(x)=0 has at least one root in that interval.
f(a)f(b)<0and f is continuous on [a,b]⟹at least one root in (a,b)
State a suitable function f, calculate f(a) and f(b), show that one is negative and the other positive, then state both the sign change and continuity before concluding that a root lies between a and b.
For f(x)=x3−x−1, f(1.3)=−0.103 and f(1.4)=0.344. Their product is negative and this polynomial is continuous, so f(x)=0 has a root in (1.3,1.4). To confirm a value rounds to 3 decimal places, apply the same test at the two rounding boundaries, such as 1.1335 and 1.1345 for 1.134.
A sign change proves at least one root, not exactly one. No sign change does not prove that there is no root: a continuous graph may touch the axis and turn around. Continuity is essential, because a discontinuity can jump from negative to positive without crossing zero.
An iteration repeatedly substitutes the latest approximation into a given recurrence. For xn+1=g(xn), start from the stated x1 and use each calculated value to produce the next one; a settled value is a fixed point satisfying x=g(x).
x1 ⟶ x2=g(x1) ⟶ x3=g(x2) ⟶ ⋯
First rearrange the original equation into the required fixed-point form if asked. Enter the given starting value, evaluate the recurrence with the correct brackets, and carry the unrounded calculator value into the next step. Continue for the requested number of iterations or until successive values agree to the requested accuracy.
To approximate the positive solution of x2+x−5=0, use xn+1=5−xn with x1=2. Then x2=3=1.732050…, x3=5−1.732050…=1.807747…. Repeating gives values that settle near 1.7913; substituting this value into the original equation provides a check.
Do not feed a rounded display value into the next step unless instructed, and do not confuse x_n with x_{n+1}. An algebraically valid rearrangement does not automatically give a convergent iteration, so use the recurrence and starting value supplied or justified by the question.