Next: 5.7.1 Sequential algorithm
Up: 5. Iterative methods
Previous: 5.6.2 Parallel Schur complement
  Contents
5.7 The multigrid method
We assume there exists a series of regular
(FE-) meshes/grids
(
) where the finer grid
was derived from the coarser one
(simplest case in 2D: subdivide all triangles in 4 congruent ones).
For that hierarchy of grids the relation
should hold, i.e., the grids are nested.
Discretizing the given differential equation on each
grid
results in a series of systems of equations
 |
(5.9) |
with the symmetric and positive definite sparse
stiffness matrices
.
When analyzing the (non-optimal) convergence behavior of
iteration methods presented in Sec 5.3 and 5.4
by means of representing the error
as sum of the
eigenfrequencies of matrix
we achieve the following results :
- $&bull#bullet;$
- Those parts of the error belonging to high eigenfrequencies
are reduced very quickly.
- $&bull#bullet;$
- Low frequency parts of the error yield to the
slow convergence behavior of classical iterative solvers.
-

- There is a need for a method reducing the low
frequency errors
at low costs without losing the good convergence behavior
for the high frequency errors
.
-

- Two grid idea :
Reduce
on grid
(smoothing),
project the remaining error onto coarse
grid
and solve there exactly.
Interpolate the coarse grid solution (named defect correction)
back to the fine grid
and add it to the
solution thereon.
Usually an additional smoothing reduces the high frequency errors
once more.
- $&bull#bullet;$
- Die Multigrid idea substitutes the exact solver in the
defect correction on the coarse grid
recursively by a two grid
method until the coarsest grid
is reached.
There, we have to solve the remaining small system of equations
exactly.
Subsections
Next: 5.7.1 Sequential algorithm
Up: 5. Iterative methods
Previous: 5.6.2 Parallel Schur complement
  Contents
Gundolf Haase
2000-03-20