fdurastante/amg4psblas
1
0
Fork 0
mirror of https://github.com/sfilippone/amg4psblas.git synced 2026-10-06 22:55:12 +00:00
Code Issues Packages Projects Releases Wiki Activity

mld2p4:

Browse Source 
Further doc fixes.
This commit is contained in:
Salvatore Filippone
2008-07-24 06:05:46 +00:00
parent 4dda0494a7
commit 78805bf653
130 changed files with 10569 additions and 7036 deletions
Download Patch File Download Diff File Expand all files Collapse all files
docs/html/node3.html
+20 -23
View File
@@ -1,4 +1,4 @@
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<!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
@@ -25,8 +25,7 @@ original version by: Nikos Drakos, CBLU, University of Leeds
</HEAD>
<BODY >
<DIV CLASS="navigation"><!--Navigation Panel-->
<!--Navigation Panel-->
<A NAME="tex2html94"
HREF="node4.html">
<IMG WIDTH="37" HEIGHT="24" ALIGN="BOTTOM" BORDER="0" ALT="next"
@@ -53,7 +52,7 @@ original version by: Nikos Drakos, CBLU, University of Leeds
&nbsp; <B> <A NAME="tex2html93"
HREF="node2.html">Contents</A></B>
<BR>
<BR></DIV>
<BR>
<!--End of Navigation Panel-->
<H1><A NAME="SECTION00030000000000000000"></A><A NAME="sec:overview"></A>
@@ -63,45 +62,44 @@ General Overview
<P>
The M<SMALL>ULTI-</SMALL>L<SMALL>EVEL </SMALL>D<SMALL>OMAIN </SMALL>D<SMALL>ECOMPOSITION </SMALL>P<SMALL>ARALLEL </SMALL>P<SMALL>RECONDITIONERS </SMALL>P<SMALL>ACKAGE BASED ON
</SMALL>PSBLAS (MLD2P4) provides <SPAN CLASS="textit">multi-level Schwarz preconditioners</SPAN>&nbsp;[<A
</SMALL>PSBLAS (MLD2P4) provides <I>multi-level Schwarz preconditioners</I>&nbsp;[<A
HREF="node24.html#dd2_96">20</A>],
to be used in the iterative solutions of sparse linear systems:
<BR>
<DIV ALIGN="RIGHT" CLASS="mathdisplay">
<DIV ALIGN="RIGHT">
<!-- MATH
\begin{equation}
Ax=b,
\end{equation}
-->
<A NAME="system1"></A>
<TABLE WIDTH="100%" ALIGN="CENTER">
<TR VALIGN="MIDDLE"><TD ALIGN="CENTER" NOWRAP><A NAME="system1"></A><IMG
WIDTH="57" HEIGHT="30" BORDER="0"
WIDTH="58" HEIGHT="30" BORDER="0"
SRC="img1.png"
ALT="\begin{displaymath}
Ax=b,
\end{displaymath}"></TD>
<TD CLASS="eqno" WIDTH=10 ALIGN="RIGHT">
(<SPAN CLASS="arabic">1</SPAN>)</TD></TR>
<TD WIDTH=10 ALIGN="RIGHT">
(1)</TD></TR>
</TABLE>
<BR CLEAR="ALL"></DIV><P></P>
where <SPAN CLASS="MATH"><IMG
where <IMG
WIDTH="18" HEIGHT="15" ALIGN="BOTTOM" BORDER="0"
SRC="img2.png"
ALT="$A$"></SPAN> is a square, real or complex, sparse matrix with a symmetric sparsity pattern.
ALT="$A$"> is a square, real or complex, sparse matrix with a symmetric sparsity pattern.
These preconditioners have the following general features:
<UL>
<LI>both <SPAN CLASS="textit">additive and hybrid multilevel</SPAN> variants are implemented,
<LI>both <I>additive and hybrid multilevel</I> variants are implemented,
i.e. variants that are additive among the levels and inside each level, and variants
that are multiplicative among the levels and additive inside each level;
the basic Additive Schwarz (AS) preconditioners are obtained by considering only one level;
</LI>
<LI>a <SPAN CLASS="textit">purely algebraic</SPAN> approach is used to
<LI>a <I>purely algebraic</I> approach is used to
generate a sequence of coarse-level corrections to a basic AS preconditioner, without
explicitly using any information on the geometry of the original problem (e.g. the
discretization of a PDE). The <SPAN CLASS="textit">smoothed aggregation</SPAN> technique is applied
discretization of a PDE). The <I>smoothed aggregation</I> technique is applied
as algebraic coarsening strategy&nbsp;[<A
HREF="node24.html#BREZINA_VANEK">1</A>,<A
HREF="node24.html#VANEK_MANDEL_BREZINA">24</A>].
@@ -109,8 +107,8 @@ as algebraic coarsening strategy&nbsp;[<A
</UL>
<P>
The package is written in <SPAN CLASS="textit">Fortran&nbsp;95</SPAN>, following an
<SPAN CLASS="textit">object-oriented approach</SPAN> through the exploitation of features
The package is written in <I>Fortran&nbsp;95</I>, following an
<I>object-oriented approach</I> through the exploitation of features
such as abstract data type creation, functional
overloading and dynamic memory management.
The parallel implementation is based
@@ -120,8 +118,8 @@ real and the complex case, that can be used through a single interface.
<P>
MLD2P4 has been designed to implement scalable and easy-to-use multilevel preconditioners
in the context of the <SPAN CLASS="textit">PSBLAS (Parallel Sparse BLAS)
computational framework</SPAN>&nbsp;[<A
in the context of the <I>PSBLAS (Parallel Sparse BLAS)
computational framework</I>&nbsp;[<A
HREF="node24.html#psblas_00">15</A>].
PSBLAS is a library originally developed to address the parallel implementation of
iterative solvers for sparse linear system, by providing basic linear algebra
@@ -169,8 +167,7 @@ in Section&nbsp;<A HREF="node22.html#sec:errors">7</A>. The copyright terms conc
of MLD2P4 are reported in Appendix&nbsp;<A HREF="node23.html#sec:license">A</A>.
<P>
<DIV CLASS="navigation"><HR>
<HR>
<!--Navigation Panel-->
<A NAME="tex2html94"
HREF="node4.html">
@@ -196,11 +193,11 @@ of MLD2P4 are reported in Appendix&nbsp;<A HREF="node23.html#sec:license">A</A>.
<B> Previous:</B> <A NAME="tex2html85"
HREF="node2.html">Contents</A>
&nbsp; <B> <A NAME="tex2html93"
HREF="node2.html">Contents</A></B> </DIV>
HREF="node2.html">Contents</A></B>
<!--End of Navigation Panel-->
<ADDRESS>
Salvatore Filippone
2008-07-23
2008-07-24
</ADDRESS>
</BODY>
</HTML>