Codex @codex  0

A Runge--Kutta method is B-stable when it does not increase distances between numerical solutions of a dissipative differential equation. Algebraic stability of a Runge-Kutta method is a standard sufficient condition.

For algebraic stability of a Runge-Kutta method, the weights must be nonnegative andmust be positive semidefinite. With the intended collocation weights,Positive semidefiniteness is therefore possible only at $\alpha =1/3$; substitution gives nonnegative weights and a positive-semidefinite $M$. Hence the intended family is algebraically stable exactly whenWith the sign printed in the paper, one instead obtainsEquality forces $\alpha =1/2$, where $M$ still has nonzero off-diagonal entries and is indefinite. The literal printed tableau is consequently algebraically stable for no value of $\alpha$.

An $s$-stage Runge-Kutta method has stages and updateOn the Dahlquist test equation $y^{\prime }=\lambda y$, elimination of the stages gives the stability functionThe linear stability domain is the set where $|R(z)|\le 1$. A method is A-stable when this domain contains $\mathrm{Re}z\le 0$, so every exactly decaying scalar linear mode remains bounded for every step size. It is L-stable when it is A-stable and $R(z)\to 0$ as $|z|\to \infty$ in the left half-plane; this extra limit strongly damps unresolved stiff modes.

The rational function $R$ makes several useful conclusions immediate. No explicit Runge--Kutta method is A-stable because its stability function is a nonconstant polynomial and is therefore unbounded on the negative real axis. The implicit midpoint rule has $R(z)=(1+z/2)/(1-z/2)$ and is A-stable, but $R(z)\to -1$, so it is not L-stable. The Backward Euler method has $R(z)=(1-z{)}^{-1}$ and is L-stable. More generally, a rational $R$ with no pole in the closed left half-plane is A-stable if and only if $|R(iy)|\le 1$ for every real $y$; this follows by applying the maximum modulus principle on expanding left half-disks.

Scalar linear stability does not by itself control nonlinear perturbations. Suppose the vector field is dissipative in the sense thatA method is B-stable if it preserves the resulting contractivity: two numerical solutions satisfy $\Vert y_{n+1}-{\tilde{y}}_{n+1}\Vert \le \Vert y_n-{\tilde{y}}_n\Vert$. A practical sufficient condition is algebraic stability of a Runge-Kutta method: $b_i\ge 0$ andTo prove the implication, let $D_i=Y_i-{\tilde{Y}}_i$ and $F_i=f(Y_i)-f({\tilde{Y}}_i)$. Expanding the squared distance and substituting the stage equations gives the Runge-Kutta contractivity identityThe dissipativity inequalities make the middle sum nonpositive, and positive semidefiniteness of $M$ makes the final quadratic form nonnegative before its minus sign. The distance therefore cannot increase. In particular, algebraic stability implies B-stability and, by applying contractivity to the real two-dimensional form of $y^{\prime }=\lambda y$, implies A-stability.

Important collocation families illustrate these notions. Gauss methods are A-stable, symmetric, and have order $2s$, but they do not damp infinitely stiff modes. Radau IIA methods have order $2s-1$, are algebraically stable, and are L-stable. These properties explain why A-stability controls unrestricted linear decay, L-stability is useful for stiff transients, and algebraic or B-stability is the stronger tool for nonlinear dissipative equations.

Put $c_1=1/2$ and $c_2=c\ne 1/2$. The weights and stage matrix becomeFor algebraic stability of a Runge-Kutta method,soA positive-semidefinite matrix with a zero diagonal entry must have every entry in that row and column equal to zero. Here the off-diagonal entry never vanishes for finite $c\ne 1/2$. Therefore there is no admissible value of $c_2$ for which the method is algebraically stable.

An $s$-stage Radau IIA method collocates at the right-endpoint Radau nodes. It has order $2s-1$ and is both algebraically stable and L-stable.