Von Neumann analysis inserts the Fourier mode into a constant-coefficient difference scheme. A one-step method is stable in the discrete -norm when its amplification factor satisfies for every resolvable wavenumber.
For a system or a multilevel method, each Fourier mode evolves through an amplification matrix . Stability requires bounds on uniform in frequencies and mesh parameters. Eigenvalue moduli alone do not suffice: has unit eigenvalues but has off-diagonal entry . Uniformly bounded eigenvector matrices, or a uniformly positive energy symmetrizer, can supply the missing power bound.
For a uniformly bounded two-level Fourier companion matrix with distinct roots of modulus at most one, its powers satisfyA positive frequency-uniform gap therefore gives a uniform bound on every power. The Parseval identity then supplies spatial L2 norm stability. When the gap closes at a repeated unit root, a Jordan block can produce growth proportional to the number of steps despite both roots having modulus one.
For the periodic-grid recurrencethe exact von Neumann stability analysis range at fixed is . The Fourier symbol gives , . The root near one obeys , proving instability for .
For , . Writing the modal recurrence as , the BDF2 discrete energy identity proves nonincrease of . Summing modes proves stability uniformly even when varies within .
This shifted scheme is not a consistent standard heat discretization under : dividing its extra spatial-shift defect by produces . On a finite interval with Dirichlet boundary conditions it also requires an extra boundary closure. Thus the periodic stability theorem is not a theorem of convergence to the heat equation or of stability for an unspecified boundary treatment.
For a translation-invariant difference operator , its Fourier symbol is . Applying to a Fourier mode multiplies that mode by . Symbols turn constant-coefficient stencil equations into scalar algebraic equations and expose their von Neumann stability analysis.
For a two-level Fourier recurrence , the amplification matrix isStability requires its powers to be uniformly bounded in the time index and the mesh frequencies. If its two amplification roots have modulus at most one and their separation has a positive mesh-independent lower bound, the eigenvectors give a uniformly bounded diagonalization of a matrix, proving stability. A repeated unit-modulus root of this companion matrix instead produces a Jordan block and linear growth in time. Thus checking only the moduli of the roots is insufficient.
For , write an amplification root as . Its equation is . The roots have modulus one and a positive frequency-uniform separation exactly for , giving L2 norm stability through a uniformly bounded diagonalization. At either endpoint the Nyquist symbol has a repeated unit root and a Jordan block, producing linear growth. The normalized local truncation error is generally second order; at and exactly sampled characteristics solve the recurrence, although the latter parameter is unstable for arbitrary perturbations.
For on the whole line, apply centered differences in space and the Forward Euler method in time. With and , the amplification factor isPutting givesFor , the affine expression in braces is nonpositive on exactly when and . Hence von Neumann stability analysis givesThese conditions are weaker than requiring every stencil weight to be nonnegative; stability in the discrete L2 norm need not imply monotonicity.
A Laurent operator on the whole integer lattice is a translation-invariant bi-infinite matrix. Under the discrete Fourier transform it becomes multiplication by its symbol, so its -operator norm is the essential supremum of the symbol's modulus.
A Toeplitz operator is a constant-diagonal operator on a one-sided sequence space. It models the restriction of a translation-invariant stencil to a half-line, where the boundary prevents direct diagonalization by the full-lattice Fourier transform.
Split a smooth symbol into its strictly negative and strictly positive Fourier modes. Their Toeplitz operators exponentiate exactly to the Toeplitz operators of the corresponding exponentials, and . The trace of is because the shift relation gives . Smoothness makes the series converge in trace norm, so the Fredholm determinant of an exponential commutator applies.
On the Hardy space of the circle, a continuous symbol gives a Fredholm Toeplitz operator exactly when it never vanishes. Nonvanishing gives a parametrix modulo compact semicommutators. Write , where is its counterclockwise winding number and is continuous. Homotopy through nonvanishing symbols and local constancy of the Fredholm index reduce the index to that of the shift , namely . If vanishes at a point, normalized Hardy reproducing kernels concentrating there are weakly null unit vectors on which tends to zero, contradicting a Fredholm parametrix.
Boundary stability is a mesh-uniform estimate for a finite-difference initial-boundary problem with forced boundary data. Stability of the whole-line Cauchy scheme is necessary but may fail to control boundary-supported numerical modes.
A boundary closure supplies the boundary rows or ghost values needed by a spatial finite difference method. It must reflect the PDE boundary data and preserve a mesh-uniform stability estimate. Interior von Neumann stability analysis cannot detect an arbitrary unstable boundary row; for example a row produces growth even beside an otherwise stable heat stencil.
After transforming time and tangential variables, the uniform Kreiss--Lopatinskii condition requires the boundary equations to determine every decaying normal mode with an inverse bounded uniformly over transformed frequencies. It rules out growing or weakly controlled boundary modes.
For a normal amplification matrix , the bound with semisimple unit-modulus eigenvalues controls every power . For a nonnormal family, eigenvalues alone do not control transient growth or give a mesh-uniform bound; eigenvector conditioning, pseudospectra, or a direct energy estimate is then needed.
Stability of the partial differential equation requires a bound uniform over refining meshes and time steps on every fixed physical time interval. This is distinct from demanding an all-time bound for one fixed matrix. A fixed matrix is power bounded exactly when all eigenvalues are in the closed unit disk and its unit-modulus Jordan blocks have size one. A time-step family can nevertheless have harmless polynomial physical-time growth: with gives , uniformly bounded for despite its nontrivial unit-modulus Jordan block. Mesh dependence and the scaling of the step must therefore be kept in an eigenvalue argument.
Every eigenvalue of this nonnormal matrix is , but . Applied to the second coordinate unit vector, its norm at is at least . Thus negative eigenvalues give no mesh-uniform semigroup bound by themselves. Normal matrices, uniformly conditioned eigenvector bases, or a direct dissipative energy estimate supply the missing control.
On a finite inflow grid, explicit upwinding has a triangular amplification matrix whose only eigenvalue is . For this eigenvalue lies inside the unit disk, although interior high-frequency data are amplified by before reaching the boundary. This shows why eigenvalue analysis without uniform normality can give the wrong stability range.
For the centered spatial second difference, backward Euler has amplification factor and is stable for every physical Courant number .
For a smooth solution of the heat equation, backward Euler with the centered second difference has residual divided by equal to . Both leading terms have the same sign. Under parabolic mesh refinement their coefficient is , which cannot vanish for a positive diffusion Courant number. Consistency of an update forces for every fixed positive .
On interior Dirichlet grid points, backward Euler diffusion is stable for and also for the nonphysical branch . The latter makes every amplification denominator at most .
For the centered spatial second difference, forward Euler has the updateIt is stable for . In this range the update is a convex combination, which gives a direct maximum-norm proof as well as the Fourier proof.
Let be the scaled Dirichlet discrete Laplacian and a bounded diagonal reaction matrix. If , the heat update is contractive in both the maximum norm and the mesh-weighted L2 norm. For ,This proves finite-time mesh-uniform stability without requiring the full update to have nonnegative entries or to be contractive. Negative reaction terms can destroy nonnegativity at the endpoint , so it is the heat part alone that is treated as a nonnegative contraction.
For the schemewhere is the Dirichlet second-difference matrix and , the modal amplification factor isMesh-uniform stability holds exactly whenFor consistency with under the displayed normalization one additionally chooses ; stability then requires .
For a one-step translation-invariant recurrence, the amplification factor is the multiplier satisfyingThe Parseval identity converts the pointwise bound into non-growth of the discrete -norm.
For a schemethe Fourier ansatz gives the amplification polynomialIts roots are the amplification factors of that Fourier mode.
Centered space and leapfrog time discretization of givesIts amplification polynomial is . The two roots have unit modulus for , but a repeated unit root at equality violates the uniform root condition.
For with equal spatial mesh sizes, the centered leapfrog recurrence has amplification polynomial of a multilevel finite difference scheme . Uniform stability for arbitrary two-level starting perturbations holds exactly for . At the phase pair gives , and its companion matrix has a nontrivial Jordan block, producing growth proportional to the number of steps. For larger one polynomial root has modulus greater than one. Bounds on eigenvalue moduli alone therefore give a misleading non-strict endpoint.
For the centered two-level advection recurrence, the Fourier roots at Courant number one coalesce at for phase . The resulting nontrivial Jordan block admits linearly growing solutions despite both eigenvalues having modulus one. Uniform two-level stability for arbitrary starting perturbations therefore requires the strict inequality . A specially consistent startup can select the exact translating branch at the boundary, which is a restriction on the data rather than a uniform bound on the full update.
Applying a centered leapfrog step in time and the centered second difference in space to givesFor every , each nonconstant Fourier mode has an amplification root of modulus greater than one, so the scheme is unconditionally unstable.
For the centered spatial second difference, the Crank-Nicolson diffusion scheme has amplification factorIt is stable for every .
For the two-dimensional heat equation with zero Dirichlet boundary conditions, the Crank-Nicolson diffusion scheme preserves the interval between the minimum and maximum of the initial nodal values and zero under the displayed restriction. The old-time coefficients form a convex combination, while the new-time matrix has positive diagonal, nonpositive off-diagonal entries and row diagonal-dominance margin one. A hypothetical new value above the old maximum makes the new-time row at least that value while its right side is at most the old maximum, a contradiction; apply the reversed inequality at a new minimum. In particular initial nonnegative or nonpositive values preserve their sign. The step restriction guarantees these value bounds even though scalar A-stability holds without it.
Let be the real skew-symmetric tridiagonal matrix with superdiagonal and subdiagonal . The centered-space Crank-Nicolson discretization of has amplification matrixThe eigenvalues of are , so those of are Cayley transformsThey all have modulus one, and their common orthonormal eigenbasis makes normal. Hence the method is stable for every .
Articles by others on the same topic
Von Neumann stability analysis is a mathematical technique used to assess the stability of numerical algorithms, particularly those applied to partial differential equations (PDEs). It focuses on the behavior of numerical solutions to PDEs as they evolve in time, particularly in the context of finite difference methods. The main idea behind Von Neumann stability analysis is to analyze how small perturbations or errors in the numerical solution propagate over time.