Discrete L2 inner product Created 2026-10-05 Updated 2026-10-06
The discrete L2 inner product is the cell-volume-weighted Hermitian inner product on a uniform grid. Its associated norm is the discrete L2 norm. It provides the finite-dimensional analogue of spatial integration by parts and continuous energy method identities.
For a real smooth solution of the long-wave convection equation with broken Boussinesq symmetry, assume a periodic spatial average or an existing long-interval average with vanishing endpoint fluxes. Integration by parts gives the exact energy method identity
Thus prevents growth of the mean-square temperature at arbitrary amplitude in this averaging class. This sufficient nonlinear bound need not equal the linear instability threshold, and it does not imply pointwise monotonicity of the temperature.
Front velocity 2026-10-14
The front velocity is the propagation speed of the earliest boundary of a newly introduced disturbance's support. It asks when an initially unaffected observer can first respond, whereas group velocity asks how a narrow wave envelope translates. A detector threshold defines a practical arrival time, but can miss arbitrarily small earlier responses; a packet peak is another distinct timing convention. In a causal dielectric model, a high-angular frequency contour argument gives exactly zero field for , even when phase velocity exceeds . This is a statement about that model's relativistic causality, not a universal identification of group velocity with front velocity.[ref]
For the stipulated Klein-Gordon equation with compactly supported real Cauchy data, front velocity is bounded by , and is the model's maximal speed of influence. A short energy method outline uses
Integration outside an expanding interval shows that zero initial energy there remains zero. Thus initial support in cannot influence before . The positive energy density includes the restoring term : this adds oscillation behind the front without extending its domain of dependence. A particular disturbance may fail to excite the leading boundary, so the maximal speed is not a promise of a detectable response for every source.
A Gaussian function is nonzero arbitrarily far away, so the Gaussian envelope in a Klein-Gordon medium has no sharp initial support boundary. Its small distant tails are already in the initial data. Likewise, keeping only a narrow interval of the frequency spectrum cannot reproduce an exact abrupt onset. Cutting off a Gaussian tail changes its Fourier transform and the accompanying initial velocity; it is a different initial-value problem. The exponential initial-velocity tail for the Klein-Gordon equation is another concrete example of a pre-existing tail outside the main disturbance.
The water-tank measurement in phase velocity records free surface elevation with calibrated resistance probes and uses a ruler and stopwatch for an independent check. The inspected protocol calls the front or back of a group a timing feature. That visible edge establishes an envelope transit estimate, not the first nonzero disturbance in the sense of front velocity.[ref] A proposed additional control would repeat the transit fit at several detection thresholds and train durations, using matched probe calibration and the same sampling rate. Dependence on the threshold diagnoses wave envelope reshaping or limited sensitivity; records should be compared before reflections return. Such a test could expose limitations of a group velocity estimate, but would not establish an exact causal front or validate the stipulated Klein-Gordon equation for water waves.
Kronecker sum 2026-10-05
The Kronecker sum of square matrices combines their Kronecker products with identity matrices. If and , then is an eigenvector with eigenvalue . Tensor-product spatial grids therefore turn separated coordinate Laplacians into a Kronecker sum. Two Hermitian matrices give a Hermitian Kronecker sum, allowing an energy method without computing every eigenvector.
Long-wave convection equation with broken Boussinesq symmetry Created 2026-10-06 Updated 2026-10-14
A reduced long-wave convection model can combine linear damping, destabilizing second derivatives, stabilizing fourth derivatives and gradient nonlinearities. In the displayed normalization the quadratic coefficient breaks Boussinesq symmetry, while the cubic gradient term dissipates the mean-square temperature. The linear dispersion relation is , with critical wavenumber at . Smoothness and spatial averaging hypotheses must be specified before applying the energy method on an infinite interval.
Fourier stability analysis exploits translation invariance of a linear constant-coefficient finite difference method. On an infinite uniform grid of spacing , a spatial shift acts on by multiplication by . Hence a scalar two-level scheme with new- and old-time symbols propagates each Fourier mode by , provided the new-time operator is invertible. An explicit stencil simply has . This converts a spatial evolution into scalar algebra at each frequency.
The Plancherel theorem gives the full norm estimate, rather than just a heuristic about waves. For the discrete Fourier transform , interpreted in the sense if necessary,
Thus a scalar mode bound gives an exact discrete L2 norm bound. Stability on a fixed physical interval requires constants independent of the refining spatial and time meshes:
The contraction condition is sufficient and customary for equations whose exact solutions do not grow. More generally suffices, since . At a fixed Courant number, when is independent of , a mode with modulus strictly greater than one violates the estimate as . One must keep this scaling: physical growth such as does not by itself mean finite-time numerical instability. This is finite-time stability versus power boundedness.
For systems, the symbol is an amplification matrix. The requirement is a uniform bound on all its powers, not merely its eigenvalues. A unit-modulus Jordan block has powers and is unstable under refinement. A uniformly conditioned eigenbasis or an energy estimate can justify a modal conclusion; eigenvalues alone cannot control a general nonnormal matrix. Multilevel schemes likewise produce an amplification polynomial of a multilevel finite difference scheme, with a uniform root condition and control of starting errors. Repeated unit-modulus roots can give polynomial growth, and roots approaching each other require attention to mesh-uniform constants.
Several elementary examples show how the calculation works. For with , forward Euler with centered spatial differences gives , where . Since , it is unstable at every fixed nonzero Courant number. The upwind finite difference scheme instead gives and
so its exact contraction range is . The Lax-Wendroff advection scheme has ; expansion gives , hence . The Courant–Friedrichs–Lewy condition relates these restrictions to the numerical domain of dependence, but is a necessary geometric check rather than a complete stability proof. Implicit schemes can have a global spatial dependence and different Courant ranges, as Question 3 illustrates.
For the heat equation , put . Central spatial differences with forward Euler give , so . With backward Euler the factor is , a contraction for every . For the Crank-Nicolson diffusion scheme it is , again a contraction for all . At large , however, high-frequency factors approach minus one rather than zero: unconditional stability does not imply strong damping or accurate resolution of every mode.
The connection with convergence is the Lax equivalence theorem for a consistent approximation to a well-posed linear evolution problem. Its forward implication follows directly from the error recursion. If and for , then
A convergent initialization and a vanishing normalized local truncation error therefore give convergence. Smooth-data consistency can be extended by density when the approximation and initialization are uniformly bounded. For rough data, cell averages or another L2-compatible initialization of grid data are preferable to undefined point samples. A high formal order does not rescue an unstable amplification operator.
Boundary conditions determine whether Fourier diagonalization is exact. On a periodic grid the update is a circulant matrix, and the finite discrete Fourier transform diagonalizes it at the frequencies . Here an interior symbol controls the entire scheme, including the wrapping boundary. On the whole line, the continuous frequency transform serves the same purpose and there is no boundary closure to check.
For a finite interval with homogeneous Dirichlet boundary conditions, centered diffusion is a symmetric tridiagonal problem diagonalized by discrete sine modes. One tests the same diffusion symbol at the admitted sine frequencies, not at arbitrary periodic modes. For homogeneous Neumann boundary conditions, a suitable reflected closure uses discrete cosine modes; the constant mode is present and is neutral for pure diffusion. With the standard reflected endpoint stencil, the natural norm uses half endpoint weights, in which the matrix is self-adjoint. Consequently stable diffusion need not make every solution tend to zero under Neumann conditions. These special orthogonal bases supply an exact substitute for Fourier modes when the operator and closure have the required symmetry.
For transport, prescribe only the incoming physical boundary data. With , , the inflow is the left endpoint; for it is the right endpoint. Imposing unrelated data at both ends generally overdetermines the first-order PDE. Outflow rows or ghost points must be chosen compatibly with the interior method. A general boundary closure of a difference scheme destroys the circulant structure, so whole-line von Neumann stability analysis is necessary in many settings but not sufficient for the full initial-boundary problem. A defective boundary row that doubles one boundary unknown each step can create growth even beside a stable interior stencil.
A more refined boundary calculation seeks half-line modes with ; these are localized near the boundary. Insert them into both the interior recurrence and boundary equations. A compatible mode with proves boundary instability. Absence of one isolated growing mode is not the whole theorem: weakly controlled limiting modes can still destroy a uniform estimate. The Uniform Kreiss--Lopatinskii condition requires a uniformly bounded inverse boundary system on the incoming/decaying mode space. Direct energy estimates are often a clearer alternative to solving that transformed boundary problem.
For example, suppose a first-derivative matrix obeys the discrete summation by parts identity , with positive norm matrix . The semidiscrete advection equation then gives
With homogeneous inflow and , only a nonpositive outflow term remains; prescribed inflow contributes a controlled forcing term. This is the inflow advection energy estimate from summation by parts, and it tests the boundary as part of the operator. For a dissipative semidiscrete matrix , backward Euler also preserves the estimate, because its update gives
This distinguishes spatial energy stability from stability of an arbitrary chosen time integrator.
Finally, nonhomogeneous boundaries can be homogenized by subtracting a suitable lifting, leaving a forced equation whose solution needs a bound in terms of both initial and boundary data. Variable coefficients and nonuniform grids remove translation invariance, so freezing coefficients gives only local diagnostic information. A full energy method, a mesh-uniform operator estimate, or a dedicated boundary-symbol analysis is then needed. Fourier symbols give complete stability tests when an orthogonal mode decomposition diagonalizes the full operator; otherwise the boundaries, matrix powers and norm estimates must be checked as well.
For fixed real , consider initial data and a solution continuous into at time zero, with homogeneous Dirichlet boundary conditions for positive times. Existence, uniqueness and continuous dependence in this norm give Hadamard well-posedness.
To construct a solution, put . Substitution gives
Let . The Fourier sine series solution is
Multiplication by is bounded on . Completeness of the sine basis gives convergence to in at time zero, while the exponential decay gives smoothness for positive times and the required equation and boundary values. For a classical solution continuous up to the endpoints at time zero, the usual initial-boundary compatibility conditions are additionally required.
For the energy method, integration by parts gives
Both boundary terms vanish. The same identity applies to the difference of two solutions, proving uniqueness and continuous dependence. The Poincaré inequality further gives
with the identical estimate for differences of initial data. This Dirichlet convection-diffusion contraction holds for every real , and its energy constant is independent of the drift strength.
Use the discrete norm , with periodic indices. Two independent arguments prove uniform stability of a numerical method.
For Fourier stability analysis, a discrete Fourier mode with has semidiscrete eigenvalue
Its real part is nonpositive, so . The unitary discrete Fourier transform and discrete Parseval identity then give for every , and fixed real .
For the energy method, denote the centered first difference by and the forward difference by . Periodic discrete summation by parts makes skew-adjoint and gives . Therefore
The constant mode is preserved rather than strictly damped. Both proofs apply equally to differences of two solutions. The semidiscretization is contractive in the discrete L2 norm. A later choice of a time integrator would require its own stability analysis; no time-step condition is needed for this continuous-time result.
A stability analysis asks whether perturbations in an evolution remain bounded on a fixed physical time interval by a constant independent of the mesh. For a linear update , the basic requirement is
This permits physical growth bounded by ; it need not require every step to be a contraction. Consistency of a numerical method measures how well its stencil reproduces the differential equation, whereas stability of a numerical method controls the accumulated defects. For a well-posed linear problem, the Lax equivalence theorem connects stability and convergence for a consistent approximation in the specified norm.
On the whole line or a periodic grid, constant-coefficient stencils commute with translations. The Fourier modes diagonalize such spatial operators, turning a scalar one-step scheme into
The Fourier symbol is found simply by replacing a shift by . The Parseval identity makes this modal calculation a norm estimate: if at every resolvable frequency, then the discrete norm cannot increase. More generally, a uniform gives and a fixed-time stability bound. All frequencies matter, including those near the grid scale; a small-wavenumber expansion establishes consistency but cannot test the entire stability range.
For the heat equation, put and . The Forward Euler diffusion scheme has
The condition for every is exactly . This illustrates a parabolic time-step restriction . The Backward Euler diffusion scheme instead has
which is contractive for every . The Crank-Nicolson diffusion scheme has
and is likewise unconditionally stable. However, its high-frequency amplification approaches for large , so it need not damp rapidly decaying modes effectively and may produce alternating transients from nonsmooth data. An A-stable time integrator can stabilize a diffusion semidiscretization with left-half-plane spectrum, but damping and accuracy remain separate questions.
For transport , define the hyperbolic Courant number . Forward Euler with a centered spatial difference gives and . It is unstable under a fixed nonzero CFL ratio. For , the upwind finite difference scheme has
Thus is the stable range. Upwinding for negative reverses the spatial difference and gives . The Lax-Wendroff advection scheme gives a second-order example:
It is stable for , but that result does not imply monotonicity or exclude oscillations at shocks. The Courant–Friedrichs–Lewy condition has a domain-of-dependence interpretation for explicit hyperbolic schemes; the Fourier calculation supplies the sharper algebraic stability criterion for the particular stencil.
For multilevel methods, each frequency gives an amplification polynomial and a companion matrix. Every amplification root must lie in the closed unit disk, with unit-modulus roots simple. Uniformity across frequencies and meshes is essential: one also needs control of the associated matrix powers, for example through a uniformly bounded diagonalization or the uniform power bound from separated amplification roots. A repeated unit root generates a Jordan block and polynomial growth in the number of steps. The same issue occurs for systems: checking only eigenvalue moduli of a nonnormal Fourier amplification matrix is insufficient. For instance
has unit eigenvalues but no fixed-time mesh-uniform bound as . For a hyperbolic system with a constant coefficient matrix admitting a uniformly bounded characteristic diagonalization, scalar modal estimates for each characteristic speed do give a system estimate. A positive energy symmetrizer provides another route. Frozen-coefficient Fourier tests for variable coefficients are useful local diagnostics, but a global estimate must also account for coefficient variation and boundary terms.
Boundary conditions change the allowable modes and can change the conclusion. A periodic calculation is exact only for a periodic closure. On a finite interval with zero Dirichlet boundary conditions, the centered diffusion matrix is diagonalized instead by the discrete sine transform. On interior points its eigenvalues are before scaling by . Thus the exact fixed-grid Forward Euler restriction is
which tends to the whole-line threshold as the grid is refined. Backward Euler and Crank-Nicolson remain stable for all nonnegative . An appropriate Neumann boundary condition uses cosine-type modes and includes a constant mode with eigenvalue zero. The constant mode must be preserved, rather than forced to decay; depending on the boundary stencil, the natural discrete inner product may have endpoint weights.
For hyperbolic transport, the continuous and discrete boundary closures must respect the direction of propagation. If on , prescribe the left inflow value; prescribing an independent outflow value can overdetermine the problem. The energy method exposes this directly:
Homogeneous inflow is dissipative, while forced inflow contributes data to the estimate. A compatible upwind boundary update has the same one-sided information flow. For diffusion,
The last term vanishes for homogeneous Dirichlet or Neumann conditions. With Robin boundary conditions of dissipative sign it contributes a further nonpositive term. A non-dissipative boundary can produce genuine PDE growth, which a valid stability estimate should represent rather than incorrectly suppress.
Even a perfectly stable interior symbol cannot detect every defective boundary closure of a difference scheme. As a concrete counterexample, leave a stable explicit heat stencil on all grid points away from the left endpoint, but replace its first interior row by , still keeping . The interior Fourier symbol is unchanged, yet makes the finite-interval update unstable. The faulty boundary-adjacent row creates a mode absent from the periodic interior calculation. Thus the entire finite update matrix, or an energy estimate including its boundary rows, must be examined.
A more systematic boundary stability of a finite-difference method analysis transforms time and any tangential spatial variables, then looks for modes with and on a half-line. The interior dispersion relation selects decaying spatial modes; the boundary equations must determine their coefficients without admitting a nonzero growing homogeneous mode. A uniform inverse estimate for the boundary system, expressed by the Uniform Kreiss--Lopatinskii condition, also rules out arbitrarily weak boundary control near limiting frequencies. Merely excluding one obvious unstable mode is weaker than proving a mesh-uniform estimate. Discrete summation by parts and suitable boundary penalties offer an energy-based alternative.
Finally, nonlinear scalar conservation laws can develop discontinuities, so linearized Fourier stability is only one part of the analysis. A monotone conservative scheme, such as the Engquist-Osher method under its CFL restriction, has an invariant state range and L1 contraction of a monotone conservative scheme, with a discrete entropy inequality selecting admissible shocks. These complement the Fourier and boundary estimates. For an evolution problem, the meaningful outcome is a stability bound in a specified norm, uniform over the chosen mesh family and compatible with the actual boundary and initial data.
The orthogonal projection satisfies , hence and . Set . Then and . Crucially, applying the energy identity of part (e) to gives
Solving this scalar equation and taking square roots proves
This argument uses (e) explicitly, rather than bypassing the requested energy method with an explicit solution formula.
Take real and use the L2 norm on the spatial interval. Existence, uniqueness and continuous dependence are the three requirements of Hadamard well-posedness. An energy method supplies the decisive estimate. For a smooth solution with homogeneous Dirichlet boundary conditions, integration by parts gives
The drift contributes only a boundary term, which vanishes. The Poincaré inequality further gives
Apply the same argument to the difference of two solutions to obtain uniqueness and continuous dependence on the initial data.
For existence, use the Dirichlet gauge transform for constant drift: satisfies with zero boundary values. Expanding in its Fourier sine series gives
For the series defines a solution continuous in down to and smooth for positive time; multiplication by the fixed bounded exponentials preserves this interpretation. Its energy estimate follows by approximation with smooth initial data. For a classical solution at the initial corners, require the usual smoothness and boundary compatibility instead. The problem is well posed in , with a contraction estimate independent of the initial data.
A stiff differential equation can contain rapidly decaying modes as well as a slowly changing solution of interest. An explicit scheme may need a very small step solely to keep those already small fast modes from numerical growth. A-stability addresses this restriction through the Dahlquist test equation , whose exact solution decays when .
For a one-step method, write , . Its linear stability domain consists of the points where the update is defined and . A-stability means that this domain contains the closed left half-plane. This is a scalar linear stability property, not an order condition, an existence theorem for an implicit solve, or a general nonlinear contractivity assertion.
For a rational approximation to the exponential, consistency requires , and order requires . Poles must be absent from the relevant half-plane. The Forward Euler method has and the disk , so negative real modes require ; it is not A-stable. The Backward Euler method has , and on the left half-plane, so it is A-stable. The trapezoidal rule and the implicit midpoint rule both have, on the scalar linear problem,
They are second-order and A-stable despite being different nonlinear methods. No nonconstant polynomial approximation is A-stable, because its modulus grows without bound on the negative real axis. In particular every nontrivial explicit Runge-Kutta method has a bounded-step stability restriction.
A-stability prevents growth but need not eliminate extremely stiff modes: the trapezoidal factor tends to minus one as . L-stability additionally requires within the left half-plane. Backward Euler is L-stable; trapezoidal and implicit midpoint are not. The distinction explains persistent alternating transients in otherwise stable Crank-Nicolson calculations. Accuracy still constrains useful step sizes even for an A-stable method.
A linear multistep method is characterized by polynomials , and its scalar modes satisfy . There is generally no single scalar amplification factor: every root must lie in the closed unit disk and unit roots must be simple. At , this is the zero-stability root condition. Consistency plus zero-stability gives convergence by the Dahlquist equivalence theorem, with suitable starting values. A-stability demands the amplification root condition throughout the left half-plane, including the zero-step condition. The Second Dahlquist barrier says that an irreducible A-stable linear multistep method has order at most two, and an explicit linear multistep method cannot be A-stable.
Examples include backward Euler, trapezoidal, and the second-order backward differentiation formula
Its zero-step roots are . Its unit-circle boundary quotient has real part , and the leading coefficient is nonzero on the left half-plane, giving A-stability by the same continuation argument as in Question 2. Conversely the third-order member of that question fails A-stability. A formal high order without zero-stability, or after silently cancelling a problematic unit factor, does not evade the barrier.
For an implicit Runge-Kutta method, the stages on the test equation satisfy . Whenever these stages are solvable, its stability function is
This rational function is used to test scalar A-stability; the Butcher order conditions separately establish nonlinear order. The Lobatto IIIA method in Question 3 is an A-stable fourth-order example with the diagonal degree-two Padé approximant. More generally the -stage Gauss--Legendre Runge-Kutta method has order and is A-stable, with the diagonal Padé approximation to ; its stiff-limit factor is nonzero. The -stage Radau IIA method has order and is L-stable. Thus Runge-Kutta stages permit arbitrarily high A-stable order, unlike irreducible linear multistep formulas.
For a normal matrix, scalar amplification bounds transfer through unitary diagonalization. For a non-normal matrix, eigenvalue information alone does not assert Euclidean contraction: transient growth and eigenvector conditioning can matter. Direct energy method arguments, such as the dissipative Cayley-transform proof in Question 1, use the symmetric part and are more informative in that setting.
For nonlinear dissipative vector fields, the stronger B-stability property asks that distances between two numerical solutions not increase. A standard sufficient condition for Runge-Kutta methods is algebraic stability: and
is positive semidefinite. It follows from the Runge-Kutta contractivity identity when the implicit stages exist. The three-stage Lobatto IIIA method is A-stable but has the first diagonal entry of that matrix equal to , so scalar A-stability should not be confused with that sufficient nonlinear condition. Stage solvability of an implicit Runge-Kutta method remains a separate issue and computational cost of the implicit equations must be considered. A-stability removes a scalar decay-mode stability restriction; order, stiff damping, nonlinear stability and solvability remain distinct properties.
For the long-wave convection equation with broken Boussinesq symmetry, use a sufficiently smooth real temperature field. To make the spatial average and integrations meaningful, take a periodic pattern, or an existing long-interval average with bounded derivatives and vanishing averaged endpoint fluxes. Boundedness of the temperature alone does not guarantee all those averaging properties. Multiply the evolution equation by and average. Integration by parts gives
and . Thus the energy method yields
The energy square completion for long-wave convection starts from
Put . The energy identity becomes
Since pointwise,
Therefore excludes growth of the mean-square temperature, for arbitrary amplitude within this smooth averaging class. This is a nonlinear energy-stability criterion, not a proof of pointwise monotonicity at each position. A spatially constant component instead decays through the term. The criterion is sufficient; it need not coincide with the linear instability threshold.
Use the Dirichlet Laplacian eigenvalues and eigenfunctions on :
An expansion reduces the wave equation to independent ordinary differential equations
When , put ; each coefficient is
For finite-energy data and , a uniform spatial bound follows from the energy method, rather than from unjustified absolute summation of the Fourier series. The conserved quantity is
The Poincaré inequality gives . Hence with for , and with for . Since the Dirichlet boundary condition gives , the Cauchy-Schwarz inequality yields
At , the first coefficient is , which is unbounded for some admissible data. For , that coefficient has an exponentially growing component for some admissible data. Thus all-time boundedness of a wave equation with a reaction term requires
At equality, boundedness for a particular data set requires ; the remaining modes are bounded by their spectral gap. Above the threshold, every unstable mode must have its growing component canceled, and any zero-frequency mode must have zero initial velocity. There is no condition on alone for arbitrary specially chosen data.
The printed reference to a limit needs qualification. Bounded oscillations generally have no limit as . If actual existence of that limit for every admissible initial datum is required, no real works: for every , choose with and nonzero pure oscillatory data in that eigenfunction. The boxed inequality answers the intended long-time boundedness question.
For energy stability for variable-coefficient reaction diffusion, let , let be the Dirichlet discrete Laplacian, and set . Use the mesh-weighted inner product with the corresponding discrete L2 norm. For zero boundary values, summation by parts gives
For a solution, or a difference of two solutions, the energy method gives
The Gronwall inequality therefore proves
The constant is independent of , so this is stability of a numerical method on every fixed finite time interval. The bound allows physical growth if ; stability here does not mean uniform boundedness as .
There is also a uniform maximum-norm bound. At a positive spatial maximum the second difference is nonpositive. Applying this observation to and to its negative gives . With a perturbing source , the Duhamel principle gives the corresponding initial-data bound plus in either norm. Thus the estimate controls accumulated residuals as well as initial perturbations.
For an evolutionary partial differential equation, stability of a numerical method means that errors in the starting data and forcing stay controlled on each fixed interval , with constants independent of the mesh. Fourier stability analysis is especially effective for a constant-coefficient finite difference method on a uniform infinite or periodic grid: translation invariance makes different Fourier modes evolve independently.
For a scalar one-step scheme on the integer lattice, insert , with . The Fourier symbol of each shift is , and the update reduces to
The amplification factor must be defined for every relevant frequency; for an implicit scheme this includes checking that its denominator is nonzero. The Parseval identity turns a bound into a discrete L2 norm bound. Thus gives contractivity, while the more general bound gives for . Conversely, frequencies with amplification uniformly greater than one produce unstable wave packets or periodic Fourier modes under refinement.
For a system, is an amplification matrix; for a multilevel scheme, a companion matrix evolves the vector of time levels. The actual requirement is a uniform bound on matrix powers, not just their spectral radius. A nontrivial Jordan block at a unit-modulus eigenvalue creates polynomial growth in the time index. Even simple eigenvalues inside the unit disk can fail to give a uniform bound if the eigenvector matrices become ill-conditioned as the mesh changes. Uniformly controlled diagonalization of a matrix, or a suitable quadratic energy estimate, resolves this issue. The power boundedness of a two-level Fourier scheme illustrates why root multiplicities and conditioning matter.
For the heat equation, put . Centered space with the Forward Euler method has
The von Neumann stability analysis condition holds exactly for on the full frequency interval. The Backward Euler diffusion scheme instead has and is stable for every . The Crank-Nicolson diffusion scheme has
It too is unconditionally stable, but poorly resolved high-frequency modes have for large , giving oscillatory numerical transients. A-stability therefore does not guarantee strong damping; L-stability distinguishes the damping of the Backward Euler method.
For the advection equation , let . Forward time and centered space give
For nonzero fixed , repeated steps amplify some modes by a fixed factor greater than one, so the method is unstable under the usual refinement . This calculation also shows the refinement qualification: if , its finite-time growth can be bounded by , though the restrictive scaling defeats the usual hyperbolic time-step choice. For , the upwind finite difference scheme has
so it is stable for . The Lax-Wendroff advection scheme instead has
giving . These examples separate the effects of the spatial stencil, temporal approximation and Courant number; a higher order of a numerical method by itself does not establish stability.
A periodic boundary condition is ideal for this analysis. The discrete Fourier transform diagonalizes the circulant update, with only the discrete frequencies needed on a grid of points. A bound on all is a convenient guarantee over every such grid. On the whole line, the Fourier transform uses a continuous frequency interval and the Parseval identity proves the corresponding square-summable-data estimate.
Homogeneous Dirichlet boundary conditions do not admit arbitrary complex exponential Fourier modes. For the standard centered second difference on interior points, a discrete sine transform diagonalizes the actual boundary-value matrix:
The same heat amplification formulas then apply at these sine frequencies. For example, the exact forward-Euler contractivity limit on that fixed grid is ; the mesh-independent sufficient limit follows by including all frequencies. Homogeneous Neumann boundary conditions can similarly permit a discrete cosine transform, provided the endpoint discretization and its weighted inner product are chosen consistently. The constant mode is then present, reflecting conservation of the heat equation's spatial mean. For inhomogeneous boundary conditions, subtract a suitable lifting of the prescribed boundary data and estimate the induced source using the homogeneous evolution's bound and a Duhamel principle estimate. Bounds for the lifting and source must themselves be uniform in the mesh.
General boundary conditions require separate boundary stability of a finite-difference method. For an advection equation, incoming data are prescribed at the inflow boundary, while an outflow closure must respect the outgoing characteristics. An interior periodic Fourier symbol cannot detect a growing mode confined near a boundary. A normal-mode test on a half-line seeks modes with and that satisfy both the interior recurrence and boundary closure. Their existence proves instability, and uniform control requires more than merely excluding isolated growing roots; the Uniform Kreiss--Lopatinskii condition addresses boundary resolvent bounds. Alternatively, a direct energy method using summation by parts can include the boundary terms and establish the required estimate.
Variable coefficients and nonuniform meshes usually destroy exact Fourier transform diagonalization. Frozen-coefficient Fourier stability analysis is then a useful diagnostic, but it is not automatically a proof for the full variable-coefficient boundary problem. The mesh-uniform energy method in question 5 is an example of a direct proof. Also, an L2 norm proof is not automatically a mesh-uniform maximum-norm proof: finite-dimensional norm-equivalence constants may grow with the number of grid points.
Finally, stability measures error propagation; consistency of a numerical method measures the defect of inserting the exact solution. For a well-posed linear initial-value problem in the chosen norm, the Lax equivalence theorem says that a consistent approximation is convergent exactly when it is stable. Boundary discretization and starting data must be included in that assertion. A Fourier calculation proves convergence only after consistency, well-posedness and the actual boundary treatment have also been checked.
The Dirichlet Laplacian eigenfunctions and positive Dirichlet Laplacian eigenvalues on the interval of length two are
A Sturm-Liouville eigenfunction expansion gives , with . Thus all normal modes oscillate precisely when .
To justify a spatially uniform bound for arbitrary appropriate data, assume the usual wave equation energy class and , or smoother compatible data. The energy method conserves
The sharp Poincaré inequality is . For , this makes coercive with constant ; for , coercivity is immediate. The one-dimensional Sobolev representative satisfies by the fundamental theorem of calculus and the Cauchy-Schwarz inequality. Hence the conserved energy bounds uniformly in both variables.
At , the smooth solution is unbounded. At , is unbounded. Therefore
The bound depends on the initial data; it is not a single bound for all arbitrarily rescaled solutions. The energy-class hypothesis supplies pointwise meaning and excludes undefined rough-data interpretations.
The spatial shift in the PDF also requires a boundary value beyond the supplied right endpoint: if is the last interior index, the newest value is outside the interval. Thus the printed Dirichlet method has no specified boundary closure, and no unique stability range can be assigned to it as stated.
For completeness, the literal interior formula has an exact von Neumann stability analysis on an infinite or periodic grid. Substitution of a Fourier mode gives
For the root of a polynomial tending to one as , expansion gives
Consequently is unstable: sufficiently small nonzero frequencies have a root of a polynomial of modulus greater than one, and arbitrarily fine periodic grids contain such frequencies.
Conversely, if and , then
For with ,
Since , the complex quadratic Schur criterion yields both roots of a polynomial in the unit disk, strictly inside except at , where they are and . Uniform stability follows directly from the BDF2 discrete energy identity: the modal recurrence is , whose energy decreases because . Summing the modal energies proves a bound independent of the grid and even of ; no eigenvector-separation assumption is needed. This is the stability of a spatially shifted BDF2 stencil. Thus the literal periodic-grid result is
This cannot establish stability of an unspecified Dirichlet boundary condition closure. It also does not restore consistency of a numerical method.
For the intended unshifted backward differentiation formula, a spatial eigenvalue gives
The Schur stability criterion gives the root condition for a multistep method for every , with strict inequalities for . A useful uniform energy method proof, including the repeated interior roots that a bare separation argument would miss, is the BDF2 discrete energy identity. With and
the corrected Dirichlet discrete Laplacian scheme satisfies
This follows by taking the inner product of with and using summation by parts. It controls both time levels uniformly, regardless of the mesh ratio. Hence the corrected method is stable for
For a fully discrete linear partial differential equation evolution, write in a specified discrete norm. Finite-time stability of a numerical method means
with independent of the allowed meshes. For a multistep method, augment the state with its time-history values and include a stable starter. Bounds may grow as when the continuous problem has growth; demanding decay for all time would be a stronger assertion. The treatment of initial data, forcing, Dirichlet boundary conditions, and the norm is part of the hypothesis, not a detail supplied by an interior calculation.
For constant coefficients on an infinite or periodic uniform grid, von Neumann stability analysis substitutes the Fourier mode . The discrete Fourier transform and the Parseval identity turn a uniform multiplier estimate into a discrete L2 norm estimate. In a one-step scalar scheme, proves contractivity, while gives finite-time stability. In a multilevel scheme, every root of a polynomial in its amplification polynomial of a multilevel finite difference scheme matters, as does uniform control of the associated companion matrix.
For the Forward Euler diffusion scheme with ,
Thus for all frequencies exactly when
Sufficiency follows since ; necessity follows from the highest-frequency mode on even periodic grids. This gives the usual parabolic mesh restriction . For the Backward Euler diffusion scheme,
so every is stable. The Crank-Nicolson method has
again of modulus at most one for all , but stiff modes approach rather than zero. These are PDE manifestations of the A-stability and L-stability distinctions for time integration.
For advection , assume and set . The upwind finite difference scheme is , with
It is contractive when . This also has a direct maximum-norm proof: each newest value is a convex combination of two old values. The resulting Courant–Friedrichs–Lewy condition expresses that the numerical domain of dependence covers the physical one. For negative , the upwind direction must be reversed. By contrast, Forward Euler method time stepping with the centered first finite difference has and for nonzero . Under fixed nonzero refinement it is unstable, since a fixed nontrivial mode grows geometrically over steps. This is not a claim of instability under every imaginable mesh coupling: instead bounds its spurious finite-time growth, since .
The leapfrog advection scheme illustrates a multilevel subtlety. Its amplification polynomial of a multilevel finite difference scheme is
For , both roots of a polynomial have unit modulus and separation at least . A uniformly conditioned eigenbasis of the companion matrix then proves power boundedness of a two-level Fourier scheme for arbitrary history data. At and a grid admitting , the roots coincide on the unit circle, and a Jordan block produces growth. Thus the endpoint fails the ordinary arbitrary-history root condition for a multistep method; checking only that both moduli equal one misses the instability. Restricting the starter or filtering the parasitic mode is an additional hypothesis.
The energy method handles variable coefficients and finite boundaries for which Fourier stability analysis may be unavailable. For the Backward Euler diffusion scheme with homogeneous Dirichlet boundary conditions, define . The discrete summation by parts identity is
Take the inner product of with . The elementary identity gives
This proves unconditional contractivity including the actual boundary treatment. More generally, a dissipative operator gives of operator norm at most one: with , dissipativity implies , and the Cauchy-Schwarz inequality gives . In finite dimensions this also proves invertibility. For the second-order backward differentiation formula, the BDF2 discrete energy identity used in question 4 controls both time levels and proves unconditional diffusion stability. A repeated root strictly inside the disk is harmless here; the energy argument supplies the uniform bound without a singular eigenvector formula.
A second technique is eigenvalue stability analysis of a finite difference method. Under the method of lines, a time integrator advances by . If is a normal matrix, the scalar linear stability domain criterion on all controls its powers exactly in the corresponding L2 norm. For the centered Dirichlet discrete Laplacian, its eigenvalues lie between and zero; intersecting this interval with a time integrator's stability interval determines its mesh restriction. A uniform bound on the diagonalization of a matrix is needed for nonnormal diagonalizable systems. Eigenvalues alone can be misleading. For example,
has both eigenvalues inside the disk for , but the upper-right entry of is . Taking , , this grows like . Hence stable scalar eigenvalues do not give mesh-uniform stability. Boundary closures can introduce precisely the extra growth that an interior Fourier symbol overlooks, so boundary stability of a finite-difference method must be checked separately.
For nonlinear spatial discretizations, a useful replacement for Fourier stability analysis is a convexity argument. If the Forward Euler method map is nonexpansive in a chosen norm for , the second-order strong stability preserving Runge-Kutta method
is also nonexpansive under the same restriction. Indeed, for two inputs, the triangle inequality gives . Its Taylor expansion is , proving order two. Such strong stability preserving Runge-Kutta methods transfer suitable forward-step bounds without relying on a linear spectral calculation.
Finally, consistency of a numerical method explains what stability buys. For a linear Hadamard well-posed problem, the Lax equivalence theorem equates convergence of a consistent discretization with its stability, under the stated approximation-space and norm hypotheses. Directly, if the error satisfies , iteration gives the discrete Duhamel principle
Thus vanishing normalized local truncation error and initial error yield convergence. With a nonlinear Lipschitz step estimate, the discrete Gronwall inequality plays the same role. A stable but inconsistent stencil, such as the literal defective formulas in questions 3 and 4 under their usual refinement, is not rescued by any amplification bound. The decisive checks are a mesh-uniform evolution bound, a valid boundary closure, and consistency with the actual PDE.
For a sufficiently regular solution with zero Dirichlet boundary conditions, differentiate its squared L2 norm. Since ,
Integration by parts and the zero boundary trace give . The potential contribution is real because is real. The quantity in parentheses is consequently real, and its product with has zero real part. Hence
This is the energy method for a skew-adjoint evolution. For general L2 space data, the same result follows from the strongly continuous unitary group generated by a self-adjoint realization of . A sufficient assumption is a bounded real potential with the Dirichlet Laplacian; arbitrary real potentials require appropriate domain and self-adjointness assumptions. The differentiated proof presumes the regularity needed for the displayed integrals, rather than asserting it for every pointwise real function .