The characteristic polynomials of a linear multistep method are
The consistency of a numerical method conditions hold for every real :
Both roots of a polynomial of , namely and , are simple and have modulus one. The root condition for a multistep method therefore gives zero-stability for every . The Dahlquist equivalence theorem now gives convergence for every fixed . As usual, this means convergence of a numerical method on each fixed finite interval for a sufficiently regular ordinary differential equation with a Lipschitz continuous vector field and starting values tending to the exact starting values. When , the implicit time-stepping method update is locally uniquely solvable for sufficiently small , for example by a contraction mapping if . Zero-stability does not assert that a large fixed step is suitable for a stiff differential equation.
Expand the exact solution about . The unscaled local truncation error is
Only odd powers occur in this centered expansion. Unless , the first nonzero coefficient is the coefficient, giving order of a numerical method two. For , that term vanishes but the next coefficient is , giving order of a numerical method four. Thus
These are exact orders for general smooth ordinary differential equations, since the respective first surviving derivatives need not vanish. With starting errors , the zero-stability established in part (a) makes the global error .
Apply the Dahlquist test equation and put . Every recurrence mode must satisfy
The amplification polynomial of a multistep method, rather than just its root near one, determines absolute stability. Put and use the Cayley transform between the half-plane and disk
For , the characteristic equation becomes
If , the denominator cannot vanish at a root of the characteristic equation: would force , a contradiction. Hence forces , so all amplification roots have modulus less than one. On the imaginary axis the roots have modulus one and are simple: the transformed quadratic has discriminant for imaginary . At they are the two simple roots . Also cannot be a root when and , and the leading coefficient cannot vanish in the closed left half-plane.
If , the root near is
For small negative real it lies below , violating absolute stability. The endpoint deserves separate treatment:
One root is always ; the other is the trapezoidal rule multiplier . They are distinct for every finite in the left half-plane. Consequently, with absolute stability understood as the bounded root condition for a multistep method,
There is a convention at this reducible endpoint: if A-stability is defined to require every unreduced recurrence mode to decay for , the answer is , since the mode persists at . Canceling the common factor gives the A-stable trapezoidal rule, but cancellation removes an actual starting-error mode of the original two-step recurrence. The fourth-order member is outside either A-stability range.
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 Poincare 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.
Set and . The Dirichlet discrete Laplacian has the eigenvectors
and its negative has the eigenvalues
The discrete sine transform therefore reduces the method of lines equations to . Each coefficient is an oscillator, a linear function, or a hyperbolic function according to the sign of . A finite collection of oscillators is bounded in every fixed-grid norm. A zero-frequency mode can grow linearly, and a negative-frequency-square mode can grow exponentially. Consequently,
is necessary and sufficient for all-time boundedness of a semidiscrete reaction wave equation on this grid. Equality allows bounded displacement only when the initial velocity has zero projection onto the first eigenvector; above it, the growing components must be absent in every unstable mode. A strictly positive spectral gap also gives a time-independent displacement bound uniform over grids whose gaps are bounded below.
The discrete threshold is strictly smaller than , because for , and tends to as . A coarse grid can therefore introduce long-time growth into a continuum problem with . This is distinct from displacement stability of a symmetric semidiscrete wave equation on fixed finite time intervals. As in part (a), if existence of the printed limit is required for every initial datum, no qualifies: any one mode admits oscillatory, secular, or growing initial data, depending on its coefficient.
For the quadratic variational principle for a symmetric positive operator below, use a symmetric operator on the real Hilbert space . Strict positive definiteness means
A uniformly positive definite symmetric operator satisfies the stronger coercive operator condition
In this variational setting, “positive definite” is often used for a symmetric operator with this uniform bound. We will state explicitly where the coercive operator bound is needed. For a bounded linear operator defined on all of , symmetry means that the operator is self-adjoint. For an unbounded operator, positivity is imposed on its operator domain, and the variational formulation is made on its form domain.
Symmetry is essential in a real Hilbert space: positivity of the quadratic expression alone does not imply symmetry. For example, with nonzero real skew-symmetric matrix satisfies , but its quadratic functional has derivative involving , not . A positive definite symmetric operator supplies both the positivity and symmetry needed in part (b).
First let be a bounded linear operator on satisfying the symmetric positive-definiteness convention in part (a). For any direction , expansion of the quadratic functional gives
Thus vanishing of the first variation in every direction is precisely the weak equation for every . In this whole-space bounded-operator setting it is equivalent to , the Euler-Lagrange equation.
If solves that equation, set . The linear terms cancel:
with equality only when . Hence the weak solution is the unique global minimizer. Conversely, any minimizer has zero first variation, and therefore solves the weak equation. For a symmetric bounded bilinear form on a form space , exactly the same calculation gives and for every ; it does not require an unbounded differential operator to map every into .
Existence for every requires an extra hypothesis if “positive definite” means only strict positivity. The coercive operator bound makes the form coercive, so the Lax-Milgram theorem supplies existence and uniqueness. Without that bound, the diagonal operator on sequence space on is symmetric and strictly positive, but belongs to and its formal inverse does not. Thus strict positivity alone proves uniqueness and the minimizing property of a solution when one exists, not existence for all .
There is a genuine conflict in the printed coefficient assumptions: no uniformly positive coefficient in a zero-boundary Sobolev space exists. A function cannot also obey almost everywhere. Indeed, the Lipschitz truncation has , so Lipschitz truncation preserves zero-boundary Sobolev spaces, giving . But would be the nonzero constant . Its zero gradient contradicts the Poincare inequality in the zero-boundary Sobolev space. Thus the literal coefficient class is empty.
For the meaningful uniformly elliptic problem, take with , and impose the Dirichlet boundary condition on the unknown and test functions: . Additional regularity of is harmless, but a zero trace for must be removed. The divergence-form elliptic operator is . Integration by parts defines the symmetric bounded bilinear form
In particular,
Here is the first Dirichlet Laplacian eigenvalue on the unit square; the Poincare inequality follows, for example, by applying the one-dimensional inequality in each coordinate and adding. Thus is coercive in the gradient norm on , and the Dirichlet realization of is a positive definite symmetric operator. On its operator domain, .
The required functional and weak equation are
Because , the right side is a bounded linear functional by the Cauchy-Schwarz inequality and Poincare inequality. The Lax-Milgram theorem gives a unique weak solution, and part (b) proves that it uniquely minimizes . These formulas prove the intended conclusion under the repaired coefficient hypothesis; under the literal hypothesis there is no coefficient to which the conclusion can be applied.
The tableau is the three-stage Lobatto IIIA method. To check its order of a Runge-Kutta method directly, write , , and . The eight fourth-order conditions for a Runge-Kutta method evaluate to
Powers of here mean componentwise powers. For example, , , and , which make the last three checks immediate. These Butcher order conditions establish order at least four for general nonlinear ordinary differential equations.
It is not order five: part (b)'s stability function has expansion
The fifth coefficient already fails on the Dahlquist test equation. The order is exactly four.
For a Runge-Kutta method, the stability function is . Solving the stage equations on the Dahlquist test equation gives
The denominator has roots of a polynomial , both in the open right half-plane. If , direct expansion gives
Since , the modulus of is at most one exactly when . Thus
The method is A-stable. Its stability function has unit modulus on the imaginary axis and tends to one as , so it is not L-stable.
The criterion for algebraic stability of a Runge-Kutta method is and positive semidefiniteness of
The Runge-Kutta contractivity identity implies that this criterion is sufficient for B-stability, namely contractivity for a dissipative vector field, whenever the stage equations are defined. The implication from algebraic stability to B-stability is the relevant nonlinear theorem; A-stability alone is a linear property.
All weights here are positive, but
A positive semidefinite matrix cannot have this negative quadratic value. Hence the method is not algebraically stable. Failure of this sufficient criterion alone would not be a proof of failure of B-stability; no such converse is needed for the 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.
The original PDF has on the left of the update; the converted TeX omits its . Use the Forward Euler method with and . The explicit time stepping for bounded reaction diffusion update matrix is
When , the heat update has nonnegative stencil weights and row sums at most one. Hence its induced maximum operator norm is at most one. It is also a symmetric matrix with eigenvalues
all in , so its discrete L2 norm operator bound is at most one too. Let . In either of these norms,
Iteration gives the mesh-uniform stability estimate
The same estimate applies to differences of solutions. Adding a per-step defect gives .
This proof only requires and bounded reaction coefficients. It does not assume the full update is nonnegative: a negative can make its middle stencil weight negative when . Nor does it claim contractivity or an all-time bound for every coefficient. The required stability is a bound uniform in the discretization on fixed finite intervals.

Articles by others on the same topic (0)

There are currently no matching articles.