The nodes have Lagrange interpolation polynomialsThe coefficients obtained from and reproduce the given Butcher tableau. In particular, the second row's last entry is , which is missing from the TeX transcription. Thus this is the three-stage Lobatto IIIA method.
One applicable collocation theorem is that -stage Lobatto IIIA collocation has order . Alternatively, the fourth-order conditions for a Runge-Kutta method give a direct verification. With , and , the eight required Butcher order conditions arePowers of here are componentwise. Substitution satisfies all eight. The stability function computed from the stages isIts expansion satisfies , so even the scalar linear problem fails the fifth-order condition. HenceThe Butcher order condition theorem equates order with all conditions for rooted trees through order ; the displayed conditions are its complete specialization through order four.
Use the stability function . Its denominator vanishes only at , both in the open right half-plane. For ,This is nonnegative whenever , so throughout the closed left half-plane. The internal stage equations are also solvable there, since . Therefore the method is A-stable.
The inequality is strict in the open left half-plane, while . Moreover as , so the method is not L-stable. These conclusions follow directly from the definitions of A-stability and L-stability, rather than from the order of the method.
For algebraic stability of a Runge-Kutta method, the weights must be nonnegative andmust be a positive semidefinite matrix. Here all weights are positive, but direct calculation givesIn particular ; equivalently, its eigenvalues are . Therefore the method is not algebraically stable. This does not contradict its A-stability: algebraic stability is a stronger condition designed to guarantee nonlinear B-stability through the Runge-Kutta contractivity identity.
Articles by others on the same topic
There are currently no matching articles.