Some insight into why the relaxation process converges can be gained by
looking at properties of the matrix
which propagates
the field to the next step of iteration:
. Here, following Ref. [18],
we analyze
the so-called
weighted Jacobi method, which is a direct realization of
Eq. 13. We assume that the function values
are pinned at zero on the boundaries and we
set
for this discussion. Therefore, the final result
of the iterations
will be
everywhere.
The matrix propagator can be written as:
![]() |
(14) |
The eigenfunctions of
are simply Fourier sin waves (or modes) labeled by the index k, with
, where N is the number of grid points.
The corresponding eigenvalues are given by:
| (15) |
The small k
modes have long wavelengths.
The error in the function (before it has fully converged)
can be expanded in the sin waves,
and the kth mode of the error
is reduced by
an amount proportional to
after t iterations.
Thus, for this weighted
Jacobi method it is necessary that
for the
method to converge.
The spectral radius is the
eigenvalue with largest
magnitude (closest to one), and it is clear
that the convergence degrades as we go
to higher resolution grids, or equivalently to larger domains.
Specifically, the longest wavelength eigenvalue is:
| (16) |
By expanding the sin squared function, we see that the eigenvalue
is 1 - O(h2); as
that mode takes a longer and longer time to converge. One is then
left with a problem common to all real space relaxation
solvers, critical slowing down (CSD). The
(important!) long wavelength
portions of the solution become very difficult to handle for
large systems.