Zero-stability (source code)

= Zero-stability
{wiki}

= Zero-stable
{synonym}

<Zero-stability> controls whether small perturbations are amplified uniformly as a fixed time interval is covered by more and more steps. For a constant-coefficient <linear multistep method>, the zero-step recurrence is
$$
\sum_{j=0}^k\alpha_j e_{n+j}=0.
$$
Zero-stability requires a bound $\max_{0\leq n\leq T/h}|e_n|\leq C\max_{0\leq j<k}|e_j|$, with $C$ independent of small $h$ and the starting perturbation. The <root condition for a multistep method> characterizes this uniform boundedness.<Fundamentals of Numerical Computation by Tobin A. Driscoll and others>[Zero-stability of multistep methods, Theorem 74, root condition and recurrence-mode proof]{ref}

For $\rho(\zeta)=\zeta^2-1$, every solution is $e_n=A+B(-1)^n$, so perturbations remain bounded even though the alternating component does not decay. For $\rho(\zeta)=(\zeta-1)^2$, the mode $e_n=n$ grows like $1/h$ at fixed positive time and violates zero-stability. This is distinct from <absolute stability>, which tests nonzero $z=h\lambda$ and can constrain a particular step size.