At an interior grid point, the five-point finite difference method gives
Let
where the zero Dirichlet boundary values are already incorporated. Stack the unknowns with the index varying fastest. Using the Kronecker product, define
Then the semidiscrete equation is
Moreover,
Thus the directional matrices commute, as in the five-point Dirichlet Laplacian as a Kronecker sum.
The first stage is
Because , this consists of independent tridiagonal systems of dimension . The Thomas algorithm solves each in operations, for a total of .
The second stage,
is multiplication by a matrix with only nonzero entries, so it also costs . Hence one complete step uses at most
arithmetic operations.
Eliminating the intermediate vector gives the amplification matrix
The commuting real symmetric matrices admit simultaneous diagonalization in the orthonormal basis from the question. On this vector,
Since the basis is orthonormal, stability in the discrete Euclidean norm is equivalent to for every .
Put
Then . The smallest denominator is , while the largest numerator modulus occurs at an endpoint of this interval. The condition involving is automatic, and the other is
For , this is equivalent to
Since , the exact finite-grid stability condition is
For there is only one mode and the method is stable for every . A simple grid-independent condition, and the limiting condition as , is
This is the stability limit of one-implicit-direction diffusion splitting.
The first two modified stages give
The correction stage is
Using ,
Therefore
On the common eigenvector , the eigenvalue of is
Set and . Then
Both numerator and denominator are positive, and
Hence
for every mode and every . Orthogonal diagonalization now gives , so the method is stable without a time-step restriction. This is the unconditionally stable corrected directional diffusion splitting.

Articles by others on the same topic (0)

There are currently no matching articles.