|
|
|
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
|
|
|
|
|
|
|
|
|
|
<!--Converted with LaTeX2HTML 2002-2-1 (1.71)
|
|
|
|
|
original version by: Nikos Drakos, CBLU, University of Leeds
|
|
|
|
|
* revised and updated by: Marcus Hennecke, Ross Moore, Herb Swan
|
|
|
|
|
* with significant contributions from:
|
|
|
|
|
Jens Lippmann, Marek Rouchal, Martin Wilck and others -->
|
|
|
|
|
<HTML>
|
|
|
|
|
<HEAD>
|
|
|
|
|
<TITLE>Multi-level Domain Decomposition Background</TITLE>
|
|
|
|
|
<META NAME="description" CONTENT="Multi-level Domain Decomposition Background">
|
|
|
|
|
<META NAME="keywords" CONTENT="userhtml">
|
|
|
|
|
<META NAME="resource-type" CONTENT="document">
|
|
|
|
|
<META NAME="distribution" CONTENT="global">
|
|
|
|
|
|
|
|
|
|
<META NAME="Generator" CONTENT="LaTeX2HTML v2002-2-1">
|
|
|
|
|
<META HTTP-EQUIV="Content-Style-Type" CONTENT="text/css">
|
|
|
|
|
|
|
|
|
|
<LINK REL="STYLESHEET" HREF="userhtml.css">
|
|
|
|
|
|
|
|
|
|
<LINK REL="next" HREF="node14.html">
|
|
|
|
|
<LINK REL="previous" HREF="node5.html">
|
|
|
|
|
<LINK REL="up" HREF="userhtml.html">
|
|
|
|
|
<LINK REL="next" HREF="node12.html">
|
|
|
|
|
</HEAD>
|
|
|
|
|
|
|
|
|
|
<BODY >
|
|
|
|
|
<!--Navigation Panel-->
|
|
|
|
|
<A NAME="tex2html195"
|
|
|
|
|
HREF="node12.html">
|
|
|
|
|
<IMG WIDTH="37" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="next"
|
|
|
|
|
SRC="file:/usr/share/latex2html/icons/next.png"></A>
|
|
|
|
|
<A NAME="tex2html191"
|
|
|
|
|
HREF="userhtml.html">
|
|
|
|
|
<IMG WIDTH="26" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="up"
|
|
|
|
|
SRC="file:/usr/share/latex2html/icons/up.png"></A>
|
|
|
|
|
<A NAME="tex2html185"
|
|
|
|
|
HREF="node10.html">
|
|
|
|
|
<IMG WIDTH="63" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="previous"
|
|
|
|
|
SRC="file:/usr/share/latex2html/icons/prev.png"></A>
|
|
|
|
|
<A NAME="tex2html193"
|
|
|
|
|
HREF="node2.html">
|
|
|
|
|
<IMG WIDTH="65" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="contents"
|
|
|
|
|
SRC="file:/usr/share/latex2html/icons/contents.png"></A>
|
|
|
|
|
<BR>
|
|
|
|
|
<B> Next:</B> <A NAME="tex2html196"
|
|
|
|
|
HREF="node12.html">Multi-level Schwarz Preconditioners</A>
|
|
|
|
|
<B> Up:</B> <A NAME="tex2html192"
|
|
|
|
|
HREF="userhtml.html">userhtml</A>
|
|
|
|
|
<B> Previous:</B> <A NAME="tex2html186"
|
|
|
|
|
HREF="node10.html">Example and test programs</A>
|
|
|
|
|
<B> <A NAME="tex2html194"
|
|
|
|
|
HREF="node2.html">Contents</A></B>
|
|
|
|
|
<BR>
|
|
|
|
|
<BR>
|
|
|
|
|
<!--End of Navigation Panel-->
|
|
|
|
|
|
|
|
|
|
<H1><A NAME="SECTION00060000000000000000"></A><A NAME="sec:background"></A>
|
|
|
|
|
<BR>
|
|
|
|
|
Multi-level Domain Decomposition Background
|
|
|
|
|
</H1>
|
|
|
|
|
|
|
|
|
|
<P>
|
|
|
|
|
<I>Domain Decomposition</I> (DD) preconditioners, coupled with Krylov iterative
|
|
|
|
|
solvers, are widely used in the parallel solution of large and sparse linear systems.
|
|
|
|
|
These preconditioners are based on the divide and conquer technique: the matrix
|
|
|
|
|
to be preconditioned is divided into submatrices, a ``local'' linear system
|
|
|
|
|
involving each submatrix is (approximately) solved, and the local solutions are used
|
|
|
|
|
to build a preconditioner for the whole original matrix. This process
|
|
|
|
|
often corresponds to dividing a physical domain associated to the original matrix
|
|
|
|
|
into subdomains, e.g. in a PDE discretization, to (approximately) solving the
|
|
|
|
|
subproblems corresponding to the subdomains and to building an approximate
|
|
|
|
|
solution of the original problem from the local solutions
|
|
|
|
|
[<A
|
|
|
|
|
HREF="node25.html#Cai_Widlund_92">6</A>,<A
|
|
|
|
|
HREF="node25.html#dd1_94">7</A>,<A
|
|
|
|
|
HREF="node25.html#dd2_96">20</A>].
|
|
|
|
|
|
|
|
|
|
<P>
|
|
|
|
|
<I>Additive Schwarz</I> preconditioners are DD preconditioners using overlapping
|
|
|
|
|
submatrices, i.e. with some common rows, to couple the local information
|
|
|
|
|
related to the submatrices (see, e.g., [<A
|
|
|
|
|
HREF="node25.html#dd2_96">20</A>]).
|
|
|
|
|
The main motivation for choosing Additive Schwarz preconditioners is their
|
|
|
|
|
intrinsic parallelism. A drawback of these
|
|
|
|
|
preconditioners is that the number of iterations of the preconditioned solvers
|
|
|
|
|
generally grows with the number of submatrices. This may be a serious limitation
|
|
|
|
|
on parallel computers, since the number of submatrices usually matches the number
|
|
|
|
|
of available processors. Optimal convergence rates, i.e. iteration numbers
|
|
|
|
|
independent of the number of submatrices, can be obtained by correcting the
|
|
|
|
|
preconditioner through a suitable approximation of the original linear system
|
|
|
|
|
in a coarse space, which globally couples the information related to the single
|
|
|
|
|
submatrices.
|
|
|
|
|
|
|
|
|
|
<P>
|
|
|
|
|
<I>Two-level Schwarz</I> preconditioners are obtained
|
|
|
|
|
by combining basic (one-level) Schwarz preconditioners with a coarse-level
|
|
|
|
|
correction. In this context, the one-level preconditioner is often
|
|
|
|
|
called `smoother'. Different two-level preconditioners are obtained by varying the
|
|
|
|
|
choice of the smoother and of the coarse-level correction, and the
|
|
|
|
|
way they are combined [<A
|
|
|
|
|
HREF="node25.html#dd2_96">20</A>]. The same reasoning can be applied starting
|
|
|
|
|
from the coarse-level system, i.e. a coarse-space correction can be built
|
|
|
|
|
from this system, thus obtaining <I>multi-level</I> preconditioners.
|
|
|
|
|
|
|
|
|
|
<P>
|
|
|
|
|
It is worth noting that optimal preconditioners do not necessarily correspond
|
|
|
|
|
to minimum execution times. Indeed, to obtain effective multi-level preconditioners
|
|
|
|
|
a tradeoff between optimality of convergence and the cost of building and applying
|
|
|
|
|
the coarse-space corrections must be achieved. The choice of the number of levels,
|
|
|
|
|
i.e. of the coarse-space corrections, also affects the effectiveness of the
|
|
|
|
|
preconditioners. One more goal is to get convergence rates as less sensitive
|
|
|
|
|
as possible to variations in the matrix coefficients.
|
|
|
|
|
|
|
|
|
|
<P>
|
|
|
|
|
Two main approaches can be used to build coarse-space corrections. The geometric approach
|
|
|
|
|
applies coarsening strategies based on the knowledge of some physical grid associated
|
|
|
|
|
to the matrix and requires the user to define grid transfer operators from the fine
|
|
|
|
|
to the coarse levels and vice versa. This may result difficult for complex geometries;
|
|
|
|
|
furthermore, suitable one-level preconditioners may be required to get efficient
|
|
|
|
|
interplay between fine and coarse levels, e.g. when matrices with highly varying coefficients
|
|
|
|
|
are considered. The algebraic approach builds coarse-space corrections using only matrix
|
|
|
|
|
information. It performs a fully automatic coarsening and enforces the interplay between
|
|
|
|
|
the fine and coarse levels by suitably choosing the coarse space and the coarse-to-fine
|
|
|
|
|
interpolation [<A
|
|
|
|
|
HREF="node25.html#StubenGMD69_99">22</A>].
|
|
|
|
|
|
|
|
|
|
<P>
|
|
|
|
|
MLD2P4 uses a pure algebraic approach for building the sequence of coarse matrices
|
|
|
|
|
starting from the original matrix. The algebraic approach is based on the <I>smoothed
|
|
|
|
|
aggregation</I> algorithm [<A
|
|
|
|
|
HREF="node25.html#BREZINA_VANEK">1</A>,<A
|
|
|
|
|
HREF="node25.html#VANEK_MANDEL_BREZINA">24</A>]. A decoupled version
|
|
|
|
|
of this algorithm is implemented, where the smoothed aggregation is applied locally
|
|
|
|
|
to each submatrix [<A
|
|
|
|
|
HREF="node25.html#TUMINARO_TONG">23</A>]. In the next two subsections we provide
|
|
|
|
|
a brief description of the multi-level Schwarz preconditioners and of the smoothed
|
|
|
|
|
aggregation technique as implemented in MLD2P4. For further details the reader
|
|
|
|
|
is referred to [<A
|
|
|
|
|
HREF="node25.html#para_04">2</A>,<A
|
|
|
|
|
HREF="node25.html#aaecc_07">3</A>,<A
|
|
|
|
|
HREF="node25.html#apnum_07">4</A>,,<A
|
|
|
|
|
HREF="node25.html#dd2_96">20</A>].
|
|
|
|
|
|
|
|
|
|
<P>
|
|
|
|
|
<BR><HR>
|
|
|
|
|
<!--Table of Child-Links-->
|
|
|
|
|
<A NAME="CHILD_LINKS"><STRONG>Subsections</STRONG></A>
|
|
|
|
|
|
|
|
|
|
<UL>
|
|
|
|
|
<LI><A NAME="tex2html197"
|
|
|
|
|
HREF="node12.html">Multi-level Schwarz Preconditioners</A>
|
|
|
|
|
<LI><A NAME="tex2html198"
|
|
|
|
|
HREF="node13.html">Smoothed Aggregation</A>
|
|
|
|
|
</UL>
|
|
|
|
|
<!--End of Table of Child-Links-->
|
|
|
|
|
<HR>
|
|
|
|
|
<!--Navigation Panel-->
|
|
|
|
|
<A NAME="tex2html195"
|
|
|
|
|
HREF="node12.html">
|
|
|
|
|
<IMG WIDTH="37" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="next"
|
|
|
|
|
SRC="file:/usr/share/latex2html/icons/next.png"></A>
|
|
|
|
|
<A NAME="tex2html191"
|
|
|
|
|
HREF="userhtml.html">
|
|
|
|
|
<IMG WIDTH="26" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="up"
|
|
|
|
|
SRC="file:/usr/share/latex2html/icons/up.png"></A>
|
|
|
|
|
<A NAME="tex2html185"
|
|
|
|
|
HREF="node10.html">
|
|
|
|
|
<IMG WIDTH="63" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="previous"
|
|
|
|
|
SRC="file:/usr/share/latex2html/icons/prev.png"></A>
|
|
|
|
|
<A NAME="tex2html193"
|
|
|
|
|
HREF="node2.html">
|
|
|
|
|
<IMG WIDTH="65" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="contents"
|
|
|
|
|
SRC="file:/usr/share/latex2html/icons/contents.png"></A>
|
|
|
|
|
<BR>
|
|
|
|
|
<B> Next:</B> <A NAME="tex2html196"
|
|
|
|
|
HREF="node12.html">Multi-level Schwarz Preconditioners</A>
|
|
|
|
|
<B> Up:</B> <A NAME="tex2html192"
|
|
|
|
|
HREF="userhtml.html">userhtml</A>
|
|
|
|
|
<B> Previous:</B> <A NAME="tex2html186"
|
|
|
|
|
HREF="node10.html">Example and test programs</A>
|
|
|
|
|
<B> <A NAME="tex2html194"
|
|
|
|
|
HREF="node2.html">Contents</A></B>
|
|
|
|
|
<!--End of Navigation Panel-->
|
|
|
|
|
|
|
|
|
|
</BODY>
|
|
|
|
|
</HTML>
|
