Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2005/iii/paper-69/4/a/solution

The nodes are . Their Lagrange interpolation basis on the normalized step is
Integrating these polynomials from zero to each node gives . At the row vanishes; at the integrals are ; at they are . The endpoint integrals also give . These are exactly the coefficients in the original PDF.
Indeed, the degree-three polynomial determined by and satisfies . Integrating it to the nodes gives precisely the stage equations, and integrating to the endpoint gives the update. This proves it is a collocation Runge-Kutta method, specifically the three-stage Lobatto IIIA method.
For an explicit order proof, the collocation integrals imply , and , with powers componentwise. The endpoint weights are Simpson weights, so for . Therefore the eight Butcher order conditions through order four are satisfied:
For example the last expression is , because . These conditions are obtained by matching all elementary differential terms through degree four in the exact and numerical Taylor expansions, not just by testing a scalar linear equation. Nonautonomous equations are included by adjoining .
To exclude higher order, the scalar stability function computed below satisfies . The local defect is therefore nonzero at degree five even on the scalar test equation. Hence .

New to topics? Read the docs here!