Use a spatial discrete Fourier mode . Its recurrence and amplification polynomial of a multilevel finite difference scheme areThe polynomial roots are . For both have modulus one and are separated. Since , a fixed bounds their separation below by . The two-level companion matrix is therefore diagonalizable with uniformly bounded eigenvector matrix and inverse. To see the uniform bound explicitly, write . Its determinant is ; all its entries have modulus one, and those of are bounded by the reciprocal of the root separation. The companion matrix powers are , bounded independently of frequency and step number. Parseval's identity converts this into a mesh-independent discrete bound for arbitrary perturbations at the two initial levels.
If , choose . Then , and one polynomial root has modulus . On periodic meshes with the number of points divisible by four, this is an actual grid mode, producing exponential linear instability.
At the same phases give . The companion matrix is not a scalar matrix, so the double polynomial root has a nontrivial Jordan block. The solution has bounded starting amplitudes but grows like . On a fixed physical time interval is of order , so no mesh-independent stability bound exists. Consequentlyis the stability interval under the standard two-level definition. Testing only polynomial root moduli would misleadingly include the endpoint. A special startup selecting the non-growing branch at that endpoint restricts the perturbations and does not establish stability of the full recurrence. This is the two-dimensional leapfrog stability threshold.
Articles by others on the same topic
There are currently no matching articles.