Write , . Every smooth exact solution of the advection equation here is . At , substitution into the scheme gives the unscaled residual
The constant, linear and quadratic Taylor coefficients vanish. Its cubic coefficient is
For a general smooth function the first-order residual is , so the proper normalized local truncation error on an exact solution is
Hence the scheme has formal order two for fixed general positive . At and , the displayed residual vanishes identically for every , not just to one higher Taylor order: the recurrence transports exactly sampled characteristics when both starting levels are compatible with the exact solution. This formal exactness does not imply stability. At there is no positive time step. The two-level recurrence also requires a starting procedure for ; one initial solution profile alone is not two independent starting levels.
Insert a Fourier mode . With and , the amplification polynomial is
Its two roots have product , of modulus one. Thus if both roots are bounded by one, both must have modulus exactly one. Set . The equation becomes
When , both roots have modulus one and their separation obeys for every frequency. The companion matrix has bounded entries and can be diagonalized with the two eigenvectors . The uniform separation bounds the inverse eigenvector matrix. Hence every matrix power is bounded uniformly in and , and the Parseval identity proves L2 norm stability for the two starting levels on the whole grid.
If , frequencies near give one root outside the unit circle, so the scheme is unstable. If , the Nyquist polynomial is , a repeated unit root. The corresponding companion matrix has a nontrivial Jordan block and solutions containing . Thus the endpoints are unstable as well. On the whole line the individual Nyquist plane wave is not square-summable, but Fourier packets localized arbitrarily close to that frequency realize the unbounded power norm by continuity. Therefore the uniform stability of a shifted two-level advection scheme criterion is
In particular is stably exact with compatible starts, whereas is formally exact but unstable under arbitrary perturbations. Checking only the moduli of the roots and retaining both endpoints would miss this essential distinction.

Articles by others on the same topic (0)

There are currently no matching articles.