On the Dahlquist test equation, write the amplification polynomial as , where and . The identity shows that both roots of a polynomial can lie inside the open unit disk only if . But the complex quadratic Schur criterion would then require , which is impossible. Thus the strict linear stability domain is empty. This concerns robust damping of all modes, rather than convergence on fixed time intervals or the bounded-root stability set of the symmetric two-derivative formula.
Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 69 5 b Solution Created 2026-10-03 Updated 2026-10-14
The stability convention matters. The Cambridge numerical analysis notes define a strict linear stability domain through decay . For a multistep recurrence, robust decay requires every amplification root to lie strictly inside the unit disk. With that convention we can prove the stronger result that this method's strict linear stability domain is empty, and therefore bounded. Mere boundedness of oscillatory sequences gives a different answer, described below.
On the Dahlquist test equation, . With , the amplification polynomial of a multistep method isExclude , where the intended two-step update cannot be solved. If both polynomial roots have modulus below one, their product requires . Butso necessarily . The complex quadratic Schur criterion also requiresIts left-hand side equals , while for its right-hand side is only . The inequality is impossible. ThusFor comparison, the bounded-root stability set of the symmetric two-derivative formula is unbounded. On , rotate the amplification polynomial into a real reciprocal quadratic. Its two roots are distinct and on the unit circle precisely whenequivalently or . In particular, arbitrarily large imaginary parameters give bounded, undamped numerical oscillations. At the two equality thresholds, repeated unit-circle roots produce unbounded solutions. Hence the question's bounded-domain claim holds for the strict decay convention; it does not hold if the phrase is interpreted using the non-growing root condition for a multistep method.