Use the Backward Euler method in time and the prescribed central finite differences in space. With and , the implicit finite difference method for the advection-diffusion equation is
Equivalently, for and , the new time level solves
The spatial terms are evaluated at the new time level, making this an implicit scheme. On the whole line there are no finite-endpoint boundary conditions; in the next part its solution is chosen in the l2 sequence space.
For a grid sequence define its semidiscrete Fourier transform in the dimensionless frequency variable by
For general square-summable data the transform is interpreted as an limit in the L2 norm, rather than an absolutely convergent pointwise sum. The Parseval identity in this normalization is
The Fourier symbols of and are and . Transforming the implicit equation gives
Its amplification factor is consequently
The denominator has real part at least one because . It never vanishes, so multiplication by defines a unique next value in the l2 sequence space, and
The Parseval identity now gives
This is unconditional practical stability of a finite difference scheme: in the course's terminology the numerical evolution does not increase this norm. Linearity gives the same estimate for perturbations of the initial data. This contraction convention is stronger than a finite-time mesh-uniform bound allowing physical exponential growth.[ref]
Use the forward Euler method in time and evaluate both spatial finite difference operators at the old time level:
With and , the explicit update is
Every value on the new time level is computed directly from three old values. The sum of the stencil weights is one, as required to preserve constant solutions of the advection-diffusion equation.
Using the semidiscrete Fourier transform from (b), the explicit scheme has amplification factor
Set and , so . Direct expansion gives
The expression in square brackets is an affine function of . At the two endpoints its values are
using precisely . Every intermediate value is a convex combination of these endpoints, so for every frequency. The Parseval identity proves
Thus the scheme is practically stable under the given condition. For it is equivalent to and . This is the Forward Euler stability for centered advection-diffusion calculation with the diffusion coefficient retained. The proof does not require all three stencil weights to be nonnegative.
When , the explicit amplification factor becomes
A 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. Let
The inverse Fourier transform here gives the real sequence
By the Parseval identity, its squared norm is , finite and strictly positive. These data are also compatible with sampling a bounded continuous function: use
The value at zero is the limit of the displayed quotient, and .
On we have . Therefore the transformed solution and the Parseval identity give
For each fixed pair , take
Taking square roots proves for every . 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 before the universal quantifier over mesh pairs. If this means a single positive independent of , that assertion is false for nonzero data. Indeed, for every datum the same Fourier symbol gives
For any proposed fixed , choose . The upper bound then contradicts the requested lower bound at . The correct quantifiers are , 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 , then gives
Thus 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.

Articles by others on the same topic (0)

There are currently no matching articles.