Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2003/iii/paper-67/2/a/solution
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 67 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the coefficient in the numerator, as verified in the PDF; the converted TeX lost its . Multiplying the method by gives the characteristic polynomials of a linear multistep methodFor every admissible real , and , giving consistency of a numerical method. Factorization givesThe second root is . The root condition for a multistep method requires and forbids a repeated root at one. For real ,At both roots equal one, violating zero-stability. For the second root lies strictly inside the unit disk. The Dahlquist equivalence theorem therefore givesTo find the order rather than only consistency, expand the exact-solution residual through the generating function:Thus its unnormalized local truncation error begins with when , and the global method order is exactly two for every convergent parameter. For comparison, has formal order three but is not convergent because of its double unit root:These orders assume a smooth solution, the usual local Lipschitz condition and starting approximations of the required accuracy.
New to topics? Read the docs here!