The endpoint expansion of this multiderivative multistep method has unscaled defect and zero-stability roots , giving third-order convergence with suitably accurate starting values. On the Dahlquist test equation its amplification roots obey . The complex quadratic Schur criterion puts both roots in the open unit disk for , and only the simple root one reaches the boundary at . Thus it is A-stable; its higher derivative places it outside the hypotheses of the Second Dahlquist barrier.
For the symmetric two-step two-derivative formula, the closed-disk root condition for a multistep method fails off the imaginary axis. Positive real part makes the product of root moduli exceed one; negative real part fails the complex quadratic Schur criterion, as in the empty strict decay domain of the symmetric two-derivative formula proof. On , write and set . The amplification polynomial becomes . Its two roots are distinct and on the unit circle exactly when , or . Thus the bounded-root set consists of the imaginary intervals and , including and excluding the double-root endpoints. In particular, the set is unbounded. Unit-modulus oscillations are bounded but do not tend to zero.
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.
Past exam of the mathematics course of the University of Cambridge 2010 iii Paper 63 1 2 Solution 2026-10-14
Yes: this is an A-stable third-order method. Its second derivative is essential; the Second Dahlquist barrier applies to ordinary first-derivative linear multistep methods, not this multiderivative multistep method.
Apply the Dahlquist test equation and put . The amplification polynomial isWe verify the root condition for a multistep method throughout . For a quadratic with , the complex quadratic Schur criterion isfor both roots to be strictly inside the unit disk. Here is a brief justification of the criterion rather than just a root plot. Set . The polynomial is , where and . Its two roots are inside precisely when . On the unit circle , and , so the Rouche theorem equates its interior root count with that of . A boundary zero of would also be a boundary zero of the transformed polynomial, which the strict inequality excludes. This proves the strict criterion; the non-strict form follows by continuity, with any unit root simple because .
For the present polynomial it is enough to show , except at . Write , , and put , . ThenDirect expansion gives the nonnegative factorizationEvery term is nonnegative, and the sum is strictly positive unless . Also , so the criterion applies. For every nonzero in the closed left half-plane both amplification roots are strictly inside the unit disk. At they are and , and the unit root is simple. ThereforeThis proof establishes stability of both the principal and parasitic modes, including on the imaginary axis.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 341 2 iii Solution Created 2026-10-03 Updated 2026-10-06
On the Dahlquist test equation, , so the amplification polynomial of a multistep method becomesBoth roots of a polynomial, including the parasitic one, must satisfy the root condition for a multistep method.
For , multiply by seven and set . The polynomial is . The complex quadratic Schur criterion says that its roots of a polynomial are strictly in the unit disk ifHere is a direct verification on the entire left half-plane. Put , , , and . Thenand expansion of the squared inequality givesEvery term is nonnegative, and at least one is positive unless . Since , taking square roots proves the strict complex quadratic Schur criterion for . At , the roots of a polynomial are the simple values and . The leading coefficient cannot vanish because . Thus the method at is A-stable. Its order three is compatible with the Second Dahlquist barrier: that barrier concerns first-derivative linear multistep methods, whereas this method uses a second derivative.
For , choose , strictly in the left half-plane. The amplification polynomial of a multistep method reduces toOne root of a polynomial has modulus . Thus the method at is not A-stable.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 341 4 ii Solution Created 2026-10-03 Updated 2026-10-14
The spatial shift in the PDF also requires a boundary value beyond the supplied right endpoint: if is the last interior index, the newest value is outside the interval. Thus the printed Dirichlet method has no specified boundary closure, and no unique stability range can be assigned to it as stated.
For completeness, the literal interior formula has an exact von Neumann stability analysis on an infinite or periodic grid. Substitution of a Fourier mode givesFor the root of a polynomial tending to one as , expansion givesConsequently is unstable: sufficiently small nonzero frequencies have a root of a polynomial of modulus greater than one, and arbitrarily fine periodic grids contain such frequencies.
Conversely, if and , thenFor with ,Since , the complex quadratic Schur criterion yields both roots of a polynomial in the unit disk, strictly inside except at , where they are and . Uniform stability follows directly from the BDF2 discrete energy identity: the modal recurrence is , whose energy decreases because . Summing the modal energies proves a bound independent of the grid and even of ; no eigenvector-separation assumption is needed. This is the stability of a spatially shifted BDF2 stencil. Thus the literal periodic-grid result isThis cannot establish stability of an unspecified Dirichlet boundary condition closure. It also does not restore consistency of a numerical method.
For the intended unshifted backward differentiation formula, a spatial eigenvalue givesThe Schur stability criterion gives the root condition for a multistep method for every , with strict inequalities for . A useful uniform energy method proof, including the repeated interior roots that a bare separation argument would miss, is the BDF2 discrete energy identity. With andthe corrected Dirichlet discrete Laplacian scheme satisfiesThis follows by taking the inner product of with and using summation by parts. It controls both time levels uniformly, regardless of the mesh ratio. Hence the corrected method is stable for