mirror of
https://github.com/sfilippone/amg4psblas.git
synced 2026-10-06 22:55:12 +00:00
mld2p4:
html/index.html html/node1.html html/node10.html html/node11.html html/node12.html html/node13.html html/node14.html html/node15.html html/node16.html html/node17.html html/node18.html html/node19.html html/node2.html html/node20.html html/node21.html html/node22.html html/node23.html html/node24.html html/node25.html html/node26.html html/node3.html html/node4.html html/node5.html html/node6.html html/node7.html html/node8.html html/node9.html html/userhtml.html src/Makefile src/building.tex src/userguide.tex src/userhtml.tex userguide.pdf Fixed mail hyperlink.
This commit is contained in:
+40
-142
@@ -7,8 +7,8 @@ original version by: Nikos Drakos, CBLU, University of Leeds
|
||||
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">
|
||||
<TITLE>Example and test programs</TITLE>
|
||||
<META NAME="description" CONTENT="Example and test programs">
|
||||
<META NAME="keywords" CONTENT="userhtml">
|
||||
<META NAME="resource-type" CONTENT="document">
|
||||
<META NAME="distribution" CONTENT="global">
|
||||
@@ -18,170 +18,68 @@ original version by: Nikos Drakos, CBLU, University of Leeds
|
||||
|
||||
<LINK REL="STYLESHEET" HREF="userhtml.css">
|
||||
|
||||
<LINK REL="next" HREF="node13.html">
|
||||
<LINK REL="previous" HREF="node5.html">
|
||||
<LINK REL="up" HREF="userhtml.html">
|
||||
<LINK REL="previous" HREF="node9.html">
|
||||
<LINK REL="up" HREF="node5.html">
|
||||
<LINK REL="next" HREF="node11.html">
|
||||
</HEAD>
|
||||
|
||||
<BODY >
|
||||
<!--Navigation Panel-->
|
||||
<A NAME="tex2html180"
|
||||
<A NAME="tex2html183"
|
||||
HREF="node11.html">
|
||||
<IMG WIDTH="37" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="next"
|
||||
SRC="file:/usr/share/latex2html/icons/next.png"></A>
|
||||
<A NAME="tex2html176"
|
||||
HREF="userhtml.html">
|
||||
<A NAME="tex2html179"
|
||||
HREF="node5.html">
|
||||
<IMG WIDTH="26" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="up"
|
||||
SRC="file:/usr/share/latex2html/icons/up.png"></A>
|
||||
<A NAME="tex2html170"
|
||||
<A NAME="tex2html175"
|
||||
HREF="node9.html">
|
||||
<IMG WIDTH="63" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="previous"
|
||||
SRC="file:/usr/share/latex2html/icons/prev.png"></A>
|
||||
<A NAME="tex2html178"
|
||||
<A NAME="tex2html181"
|
||||
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="tex2html181"
|
||||
HREF="node11.html">Multi-level Schwarz Preconditioners</A>
|
||||
<B> Up:</B> <A NAME="tex2html177"
|
||||
HREF="userhtml.html">userhtml</A>
|
||||
<B> Previous:</B> <A NAME="tex2html171"
|
||||
HREF="node9.html">Example and test programs</A>
|
||||
<B> <A NAME="tex2html179"
|
||||
<B> Next:</B> <A NAME="tex2html184"
|
||||
HREF="node11.html">Multi-level Domain Decomposition Background</A>
|
||||
<B> Up:</B> <A NAME="tex2html180"
|
||||
HREF="node5.html">Configuring and Building MLD2P4</A>
|
||||
<B> Previous:</B> <A NAME="tex2html176"
|
||||
HREF="node9.html">Bug reporting</A>
|
||||
<B> <A NAME="tex2html182"
|
||||
HREF="node2.html">Contents</A></B>
|
||||
<BR>
|
||||
<BR>
|
||||
<!--End of Navigation Panel-->
|
||||
|
||||
<H1><A NAME="SECTION00060000000000000000"></A><A NAME="sec:background"></A>
|
||||
<H2><A NAME="SECTION00055000000000000000"></A><A NAME="sec:ex_and_test"></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="node24.html#Cai_Widlund_92">6</A>,<A
|
||||
HREF="node24.html#dd1_94">7</A>,<A
|
||||
HREF="node24.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="node24.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="node24.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="node24.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="node24.html#BREZINA_VANEK">1</A>,<A
|
||||
HREF="node24.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="node24.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 user
|
||||
is referred to [<A
|
||||
HREF="node24.html#para_04">2</A>,<A
|
||||
HREF="node24.html#aaecc_07">3</A>,<A
|
||||
HREF="node24.html#apnum_07">4</A>,<A
|
||||
HREF="node24.html#dd2_96">20</A>].
|
||||
|
||||
<P>
|
||||
Example and test programs
|
||||
</H2>
|
||||
The package contains the <code>examples</code> and <code>tests</code> directories;
|
||||
both of them are further divided into <code>fileread</code> and
|
||||
<code>pdegen</code> subdirectories. Their purpose is as follows:
|
||||
<DL>
|
||||
<DT><STRONG><TT>examples</TT></STRONG></DT>
|
||||
<DD>contains a set of simple example programs with a
|
||||
predefined choice of preconditioners, selectable via integer
|
||||
values. These are intended to get an acquaintance with the
|
||||
multilevel preconditioners.
|
||||
</DD>
|
||||
<DT><STRONG><TT>tests</TT></STRONG></DT>
|
||||
<DD>contains a set of more sophisticated examples that
|
||||
will allow the user, via the input files in the <code>runs</code>
|
||||
subdirectories, to experiment with the full range of preconditioners
|
||||
implemented in the library.
|
||||
</DD>
|
||||
</DL>
|
||||
The <code>fileread</code> directories contain sample programs that read
|
||||
sparse matrices from files, according to the Matrix Market or the
|
||||
Harwell-Boeing storage format; the <code>pdegen</code> instead generate
|
||||
matrices in full parallel mode from the discretization of a sample PDE.
|
||||
<BR><HR>
|
||||
<!--Table of Child-Links-->
|
||||
<A NAME="CHILD_LINKS"><STRONG>Subsections</STRONG></A>
|
||||
|
||||
<UL>
|
||||
<LI><A NAME="tex2html182"
|
||||
HREF="node11.html">Multi-level Schwarz Preconditioners</A>
|
||||
<LI><A NAME="tex2html183"
|
||||
HREF="node12.html">Smoothed Aggregation</A>
|
||||
</UL>
|
||||
<!--End of Table of Child-Links-->
|
||||
<HR>
|
||||
<!--Navigation Panel-->
|
||||
<A NAME="tex2html180"
|
||||
HREF="node11.html">
|
||||
<IMG WIDTH="37" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="next"
|
||||
SRC="file:/usr/share/latex2html/icons/next.png"></A>
|
||||
<A NAME="tex2html176"
|
||||
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="tex2html170"
|
||||
HREF="node9.html">
|
||||
<IMG WIDTH="63" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="previous"
|
||||
SRC="file:/usr/share/latex2html/icons/prev.png"></A>
|
||||
<A NAME="tex2html178"
|
||||
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="tex2html181"
|
||||
HREF="node11.html">Multi-level Schwarz Preconditioners</A>
|
||||
<B> Up:</B> <A NAME="tex2html177"
|
||||
HREF="userhtml.html">userhtml</A>
|
||||
<B> Previous:</B> <A NAME="tex2html171"
|
||||
HREF="node9.html">Example and test programs</A>
|
||||
<B> <A NAME="tex2html179"
|
||||
HREF="node2.html">Contents</A></B>
|
||||
<!--End of Navigation Panel-->
|
||||
|
||||
</BODY>
|
||||
</HTML>
|
||||
|
||||
Reference in New Issue
Block a user