Next: 5.6.2 Parallel Schur complement
Up: 5.6 Schur complement CG
Previous: 5.6 Schur complement CG
  Contents
5.6.1 The Schur complement
The Schur complement is named in honor of the mathematician
Isaai Schur5.1
(1894-1939 working in Germany).
We introduce it from a FE point of view.
Figure 5.5:
2 super elements (=subdomains) with discretization
 |
The distribution of the FE-node in Fig. 5.5
implies a block structure in the system of
equations (5.1) :
 |
(5.6) |
A Gauß-elimination of the upper right entry of
the matrix results in the cascaded system of equations
 |
(5.7) |
with the Schur complement
Therein,
and
are block matrices.
The matrix
is in general fully occupied -
the Schur complement can be given explicitly in special cases.
The main advantage of system (5.7) consists in
the fact that due to the block structure of
the inversion
of the local matrices
and
can be done
successively on each super element.
Therefore it possible by means of storing unused data on disc
to solve problems which would otherwise exceed the main memory.
This was used intensively in the 60/70-ies by engineers
and is well-known as Element-by-Element method (EBE).
Because of the expensive inversion of the Schur complement
(no more a sparse matrix) the system in II) will be often solved
by means of an iteration method.
The great advantage is that we need therein only
matrix-times-vector multiplications with the Schur complement on
the super elements :
The inversion of matrices
will be done in each
super element by a LU- or Cholesky-factorization so that in the
following the application of
consists only in
the elimination steps.
Next: 5.6.2 Parallel Schur complement
Up: 5.6 Schur complement CG
Previous: 5.6 Schur complement CG
  Contents
Gundolf Haase
2000-03-20