Next: 2 Conjugate Gradient Iteration
Up: 1 Introduction
Previous: 4 Some General Theory
  Contents
Consider now the discretisation of
|
(157) |
with condition on the boundary. If we use central differences with mesh size
in both and directions,
|
(158) |
and boundary conditions
,
and
. For an appropriately defined vector
we have
|
(159) |
|
(160) |
Suppose that is an eigenvalue of the Jacobi iteration matrix for this problem,
then
|
(161) |
Consider now a vector
whose elements are defined by
,
then the
element of
is
|
(162) |
and the RHS is
so that is also an
eigenvalue of the matrix
for any .
If we define the asymptotic convergence rate as the Lemma implies that
Gauss-Seidel converges twice as fast as Jacobi. To show this result in this case (it is a more
general result valid for a wider class of matrices) we use the fact that
so that
|
(163) |
since
, so that
|
(164) |
and using our result above,
must be an eigenvalue of
In addition to this result we can find the eigenvalues and eigenvectors of
explicitly.
If we let
|
(165) |
then
|
(166) |
and the eigenvalue associated with eigenvector
is
|
(167) |
so that the largest eigenvalue occurs when or and
|
(168) |
|
(169) |
Next: 2 Conjugate Gradient Iteration
Up: 1 Introduction
Previous: 4 Some General Theory
  Contents
Last changed 2000-11-21