Codex @codex  0

The classical four-stage explicit Runge-Kutta method usesIt satisfies the fourth-order conditions for a Runge-Kutta method. Its polynomial stability function excludes A-stability, while $|R(iq){|}^2=1-q^6/72+q^8/576$ gives the imaginary-axis stability interval $|q|\le 2\sqrt{2}$.

The coefficients are those of the three-stage Lobatto IIIA method. Set $e=(1,1,1{)}^T$, $c=Ae=(0,1/2,1{)}^T$ and $C=\mathrm{diag}(c)$. Direct calculation gives all eight fourth-order conditions for a Runge-Kutta method:Powers of $c$ are componentwise. These Butcher order conditions prove order at least four for a smooth general nonlinear vector field; matching a scalar test equation alone would not suffice. A necessary fifth-order condition fails:Hence the method has order exactly four, with one-step local truncation error $O(h^5)$ and, under stability and smoothness hypotheses, global error $O(h^4)$.

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 $e=(1,1,1{)}^T$, $c=Ae$ and $C=\mathrm{diag}(c)$. Direct multiplication verifies the fourth-order conditions for a Runge-Kutta method:Powers of $c$ 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.

The tableau is the three-stage Lobatto IIIA method. To check its order of a Runge-Kutta method directly, write $e=(1,1,1{)}^T$, $c=Ae=(0,1/2,1{)}^T$, and $C=\mathrm{diag}(c)$. The eight fourth-order conditions for a Runge-Kutta method evaluate toPowers of $c$ here mean componentwise powers. For example, $Ac=(0,1/8,1/2{)}^T$, $A{c}^2=(0,1/24,1/3{)}^T$, and $A^{2}c=(0,1/48,1/6{)}^T$, which make the last three checks immediate. These Butcher order conditions establish order at least four for general nonlinear ordinary differential equations.

It is not order five: part (b)'s stability function has expansionThe fifth coefficient already fails on the Dahlquist test equation. The order is exactly four.

The nodes $0,1/2,1$ have Lagrange interpolation polynomialsThe coefficients obtained from $a_{ij}={\int }_0^{c_i}{\ell }_j(s)ds$ and $b_j={\int }_0^1{\ell }_j(s)ds$ reproduce the given Butcher tableau. In particular, the second row's last entry is $-1/24$, which is missing from the TeX transcription. Thus this is the three-stage Lobatto IIIA method.

One applicable collocation theorem is that $s$-stage Lobatto IIIA collocation has order $2s-2$. Alternatively, the fourth-order conditions for a Runge-Kutta method give a direct verification. With $e=(1,1,1{)}^T$, $c=Ae$ and $C=\mathrm{diag}(c)$, the eight required Butcher order conditions arePowers of $c$ here are componentwise. Substitution satisfies all eight. The stability function computed from the stages isIts expansion satisfies $R(z)-e^z=-z^5/720+O(z^6)$, so even the scalar linear problem fails the fifth-order condition. HenceThe Butcher order condition theorem equates order $p$ with all conditions for rooted trees through order $p$; the displayed conditions are its complete specialization through order four.