Let be the collocation polynomial of degree at most over one step, with , and let . Its derivative, of degree at most , is fixed by its values at the distinct nodes. Lagrange interpolation therefore givesIntegrating from zero to yieldsAt this gives the stage equations of an implicit Runge-Kutta method; at it gives the update. ConsequentlyConversely, stages satisfying these equations define the integrated polynomial displayed above. It takes the stage values at the nodes and has the required derivative there, so it solves the collocation equations. This proves equivalence for every common solution branch, not merely equality on the scalar test equation. Also , since the Lagrange polynomials sum to one. Stage existence or uniqueness requires the usual implicit-solvability assumptions; for a Lipschitz vector field a sufficiently small step gives a contraction. This is the collocation Runge-Kutta method construction.
The Lagrange interpolation polynomials for these nodes areTheir integrals give the Lobatto IIIA method tableauTo verify its nonlinear order, not just its scalar linear order, set , and . Direct multiplication verifies the fourth-order conditions for a Runge-Kutta method:Powers of are componentwise. These eight Butcher order conditions establish order at least four for general smooth ODEs. On the Dahlquist test equation, elimination of the stages givesA nonzero fifth-order step defect rules out order five. Thus the method has exactly order four.
Write and . The zeros of are , so the stability function has no pole in the closed left half-plane. A direct modulus calculation givesFor this is nonnegative, and hence . Therefore the Lobatto IIIA method is A-stable. It is not L-stable, because for large negative real ; unconditional scalar stability need not strongly damp the stiffest modes.
Articles by others on the same topic
There are currently no matching articles.