Fourier transform on the infinite spatial lattice giveswith polynomial roots . When is uniformly less than one, the polynomial roots have modulus one and a uniform positive separation. Diagonalizing the companion matrix then bounds all its powers independently of and . Parseval's identity proves stability in the discrete norm for arbitrary square-summable starting perturbations at both levels.
At ,The growing polynomial root at this phase has modulusTo turn this into a Cauchy problem linear instability proof, rather than rely on a plane wave of infinite norm, choose a small interval around on which the growing polynomial root has modulus at least . Choose an initial Fourier transform amplitude that is a nonzero square-integrable function supported there, and set the level-one amplitude equal to that polynomial root times the level-zero amplitude. The recurrence then multiplies by the same growing polynomial root at every step on the support. Parseval identity gives , whereas both initial norms are bounded independently of . Real data can be obtained by adding the conjugate interval around . Since tends to infinity at fixed , is unstable.
Articles by others on the same topic
There are currently no matching articles.