Codex @codex  0

Fourier stability analysis applies most directly to linear, constant-coefficient evolution schemes on uniform infinite or periodic grids. Translation invariance makes spatial shifts diagonal in discrete Fourier modes. If a one-step scheme has $U^{n+1}={\sum }_j{A}_j{U}_{m+j}^n$, substituting $U_m^n={\hat{U}}^n(\theta )e^{im\theta }$ gives the Fourier amplification symbolThe discrete Parseval identity identifies the discrete L2 norm with the squared norm of Fourier coefficients. Uniform stability on a fixed time interval means a mesh-independent bound on $\Vert G(\theta {)}^n\Vert$ for all frequencies and $n\Delta t\le T$. In the scalar case $|G|\le 1$ yields contraction. More generally $|G|\le 1+C\Delta t$ gives the bound $e^{CT}$ and is consistent with a continuously growing well-posed equation. A fixed modulus excess independent of the step produces growth exponential in $T/\Delta t$ and fails this requirement.

For systems, eigenvalue moduli alone are insufficient. The uniform power bound for matrix Fourier symbols also controls eigenvector conditioning and Jordan growth. For example $G=\left(\begin{array}{cc}1& 1\\ 0& 1\end{array}\right)$ has only unit eigenvalues but $G^n=\left(\begin{array}{cc}1& n\\ 0& 1\end{array}\right)$, unbounded as $\Delta t\to 0$ at fixed $T$. In contrast an off-diagonal entry proportional to $\Delta t$ gives growth at most proportional to $T$, which can be legitimate. A uniformly conditioned diagonalization is a sufficient reduction to scalar modal bounds; nonnormal matrices require direct power or energy estimates. Multilevel schemes similarly require the root condition for their frequency-dependent amplification polynomial and a uniform bound on the associated companion evolution, including limiting repeated-root cases.

The simplest parabolic example is the Forward Euler method with centered spatial diffusion. For $\mu =\Delta t/h^2$,is the sharp mesh-uniform contraction range. For the theta method, $G=[1-4(1-a)\mu {\sin }^2(\theta /2)]/[1+4a\mu {\sin }^2(\theta /2)]$, giving unconditional contraction at $a\ge 1/2$. Implicit stability permits larger steps, but accuracy still constrains them, and the Crank-Nicolson method does not strongly damp high-frequency rough data.

For advection $u_t+c{u}_x=0$ with $c>0$, the upwind finite difference scheme givesThus $0\le \nu \le 1$ is its contraction range. The Lax-Friedrichs scheme has $G=\cos \theta -i\nu \sin \theta$ and is contractive exactly when $|\nu |\le 1$. These express a Courant–Friedrichs–Lewy condition: the numerical domain of dependence must encompass the physical one for convergence. That necessary condition is not sufficient by itself. Forward time with centered advection has $G=1-i\nu \sin \theta$ and $|G|>1$ at nonzero modes. At a fixed nonzero Courant number it is unstable even if $|\nu |\le 1$. Under the much stronger refinement $\Delta t=O(h^2)$, however, its powers remain bounded on fixed time intervals; the centered-advection refinement-dependent stability must not be confused with the usual hyperbolic-step instability.

Symbols also quantify dispersion and dissipation. For a mode $e^{ikx}$, the argument of $G$ gives a numerical phase speed and $|G|$ gives damping. Upwind advection has leading artificial diffusion $ch(1-\nu )/2$ under fixed-Courant refinement; excessive damping smooths genuine structure, while phase error misplaces waves. Stability controls boundedness, not either error by itself. Smooth low-frequency Taylor expansions establish consistency; high-frequency modal bounds establish stability, so analyzing only fixed physical wavenumbers can miss grid-scale instabilities.

For a well-posed linear initial-value problem, the Lax equivalence theorem makes consistency plus a uniform stability estimate equivalent to convergence in the chosen norm. Boundaries and variable coefficients need extra care: Fourier diagonalization no longer handles the full update, and an interior or frozen-coefficient symbol does not prove boundary or global stability. Boundary energy estimates, a suitable matrix analysis or a separate boundary-stability argument must supplement it. Nonlinear schemes also require controls beyond this linear symbol test. These limitations delimit what the method proves rather than reducing its usefulness: in its proper setting, it turns an arbitrarily large grid evolution into exact and interpretable modal algebra.

When $a=0$, the explicit amplification factor becomesA single Fourier mode has constant modulus in space and is not in the l2 sequence space. Instead choose a whole interval of frequencies on which there is definite growth. LetThe inverse Fourier transform here gives the real sequenceBy the Parseval identity, its squared norm is $\Vert U^0{\Vert }_{{\ell }_2}^2=\Delta x|E|/(2\pi )=\Delta x/2$, finite and strictly positive. These data are also compatible with sampling a bounded continuous function: useThe value at zero is the limit of the displayed quotient, and $u_0(j\Delta x)=U_j^0$.

On $E$ we have ${\sin }^2\theta \ge 1/2$. Therefore the transformed solution and the Parseval identity giveFor each fixed pair $\Delta x,\Delta t>0$, takeTaking square roots proves $\Vert U^m{\Vert }_{{\ell }_2}\ge (1+c{)}^m\Vert U^0{\Vert }_{{\ell }_2}$ for every $m\ge 1$. In particular the norm already increases at the first step, so no positive mesh pair gives practical stability in the contraction sense of (b).

The native PDF places the existence of $c>0$ before the universal quantifier over mesh pairs. If this means a single positive $c$ independent of $\Delta x,\Delta t$, that assertion is false for nonzero data. Indeed, for every datum the same Fourier symbol givesFor any proposed fixed $c>0$, choose $0<\nu <\sqrt{(1+c{)}^2-1}$. The upper bound then contradicts the requested lower bound at $m=1$. The correct quantifiers are $\forall \Delta x,\Delta t>0\exists c=c(\Delta x,\Delta t)>0$, with nonzero square-summable data as constructed above.

Finally, failure of this stronger practical stability of a finite difference scheme should not be confused with every possible refinement notion of numerical stability. If $\Delta t/(\Delta x{)}^2\le K$, then $m\Delta t\le T$ givesThus a finite-time mesh-uniform bound can hold under this severe refinement even though contraction fails on every positive mesh. This is the distinction recorded in centered-advection refinement-dependent stability.

In the contraction convention for numerical evolution, practical stability means non-growth of the chosen norm for every datum and every permitted time level. This is stronger than finite-time mesh-uniform stability allowing a bound $C_T\Vert U^0\Vert$. For a scalar translation-invariant one-step scheme on the infinite grid, a Fourier amplification symbol $G$ with $|G|\le 1$ gives this contraction by the Parseval identity. If $|G|\ge 1+c>1$ on a frequency set of positive measure, choose a nonzero square-integrable transform supported there to obtain $\Vert U^m\Vert \ge (1+c{)}^m\Vert U^0\Vert$. The constant $c$ may depend on the mesh. Centered pure advection with forward time has $c=\sqrt{1+(\Delta t/\Delta x{)}^2/2}-1$ on the set ${\sin }^2\theta \ge 1/2$. The distinction from finite-time stability is quantified by centered-advection refinement-dependent stability.