fdurastante
/
amg4psblas
mirror of https://github.com/sfilippone/amg4psblas.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Doc fixes.

Browse Source
stopcriterion
Salvatore Filippone 9 years ago
parent a5826047b7
commit 1c7dcd4f51
22 changed files with 171 additions and 172 deletions
Show Stats Download Patch File Download Diff File

2
docs/html/index.html
Unescape Escape View File

@ -43,7 +43,7 @@ original version by: Nikos Drakos, CBLU, University of Leeds
<BR>
<BR>
User's and Reference Guide</B></FONT>
<BR><I><FONT SIZE="+1">A guide for the Multi-Level Domain Decomposition
<BR><I><FONT SIZE="+1">A guide for the MultiLevel Domain Decomposition
Parallel Preconditioners Package
based on PSBLAS</FONT></I>
<BR>

14
docs/html/node1.html
Unescape Escape View File

@ -55,12 +55,12 @@ original version by: Nikos Drakos, CBLU, University of Leeds
Abstract</A>
</H1><FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">
MLD2P4 (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) is a package of parallel algebraic multi-level preconditioners.
The first release of MLD2P4 made available multi-level additive and hybrid Schwarz
MLD2P4 (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) is a package of parallel algebraic multilevel preconditioners.
The first release of MLD2P4 made available multilevel additive and hybrid Schwarz
preconditioners, as well as one-level additive Schwarz preconditioners. The package
has been extended to include further multi-level cycles and smoothers widely used in
multigrid methods. In the multi-level case, a purely algebraic approach is applied to
has been extended to include further multilevel cycles and smoothers widely used in
multigrid methods. In the multilevel case, a purely algebraic approach is applied to
generate coarse-level corrections, so that no geometric background is needed
concerning the matrix to be preconditioned. The matrix is assumed to be square,
real or complex.
@ -70,14 +70,14 @@ real or complex.
in the context of the PSBLAS (Parallel Sparse Basic Linear Algebra Subprograms)
computational framework and can be used in conjuction with the Krylov solvers
available in this framework. MLD2P4 enables the user to easily specify different
features of an algebraic multi-level preconditioner, thus allowing to search
features of an algebraic multilevel preconditioner, thus allowing to search
for the ``best'' preconditioner for the problem at hand.
</FONT></FONT></FONT>
<P>
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">The package employs object-oriented design techniques in
Fortran&nbsp;2003, with interfaces to additional third party libraries
such as MUMPS, UMFPACK, SuperLU, and SuperLU_Dist, which
can be exploited in building multi-level preconditioners. The parallel
can be exploited in building multilevel preconditioners. The parallel
implementation is based on a Single Program Multiple Data (SPMD)
paradigm; the inter-process communication is based on MPI and
is managed mainly through PSBLAS.

2
docs/html/node11.html
Unescape Escape View File

@ -62,7 +62,7 @@ both of them are further divided into <code>fileread</code> and
<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
multi-level preconditioners available in MLD2P4.
multilevel preconditioners available in MLD2P4.
</DD>
<DT><STRONG><TT>tests</TT></STRONG></DT>
<DD>contains a set of more sophisticated examples that

2
docs/html/node14.html
Unescape Escape View File

@ -265,7 +265,7 @@ P^k = S^k \bar{P}^k,
<BR CLEAR="ALL">
<P></P><FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">
in order to remove nonsmooth components from the range of the prolongator,
and hence to improve the convergence properties of the multi-level
and hence to improve the convergence properties of the multilevel
method&nbsp;[<A
HREF="node30.html#BREZINA_VANEK">2</A>,<A
HREF="node30.html#Stuben_01">23</A>].

4
docs/html/node16.html
Unescape Escape View File

@ -56,7 +56,7 @@ original version by: Nikos Drakos, CBLU, University of Leeds
Getting Started
</H1><FONT SIZE="+1"><FONT SIZE="+1"></FONT></FONT>
<P>
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">We describe the basics for building and applying MLD2P4 one-level and multi-level
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">We describe the basics for building and applying MLD2P4 one-level and multilevel
(i.e., AMG) preconditioners with the Krylov solvers included in PSBLAS [<A
HREF="node30.html#PSBLASGUIDE">13</A>].
The following steps are required:
@ -90,7 +90,7 @@ The following steps are required:
Section&nbsp;<A HREF="node18.html#sec:userinterface">6</A>, Tables&nbsp;<A HREF="#tab:p_cycle">2</A>-<A HREF="#tab:p_smoother_1">8</A>.
</LI>
<LI><I>Build the preconditioner for a given matrix</I>. If the selected preconditioner
is multi-level, then two steps must be performed, as specified next.
is multilevel, then two steps must be performed, as specified next.
<DL COMPACT>
<DT>4.1</DT>
<DD><I>Build the aggregation hierarchy for a given matrix.</I> This is

14
docs/html/node17.html
Unescape Escape View File

@ -56,7 +56,7 @@ Examples
</H2><FONT SIZE="+1"><FONT SIZE="+1"></FONT></FONT>
<P>
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">The code reported in Figure&nbsp;<A HREF="#fig:ex1">2</A> shows how to set and apply the default
multi-level preconditioner available in the real double precision version
multilevel preconditioner available in the real double precision version
of MLD2P4 (see Table&nbsp;<A HREF="#tab:precinit">1</A>). This preconditioner is chosen
by simply specifying <code>'ML'</code> as the second argument of <code>P%init</code>
(a call to <code>P%set</code> is not needed) and is applied with the CG
@ -80,7 +80,7 @@ Guide&nbsp;[<A
HREF="node30.html#PSBLASGUIDE">13</A>].
</FONT></FONT></FONT>
<P>
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">The setup and application of the default multi-level preconditioner
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">The setup and application of the default multilevel preconditioner
for the real single precision and the complex, single and double
precision, versions are obtained with straightforward modifications of the previous
example (see Section&nbsp;<A HREF="node18.html#sec:userinterface">6</A> for details). If these versions are installed,
@ -91,7 +91,7 @@ the corresponding codes are available in <code>examples/fileread/</code>.
<DIV ALIGN="CENTER"><A NAME="fig:ex1"></A><A NAME="907"></A>
<TABLE>
<CAPTION ALIGN="BOTTOM"><STRONG>Figure 2:</STRONG>
setup and application of the default multi-level preconditioner (example 1).
setup and application of the default multilevel preconditioner (example 1).
</CAPTION>
<TR><TD>
<DIV ALIGN="CENTER">
@ -122,7 +122,7 @@ setup and application of the default multi-level preconditioner (example 1).
! using PSBLAS routines for sparse matrix / vector management
... ...
!
! initialize the default multi-level preconditioner, i.e. V-cycle
! initialize the default multilevel preconditioner, i.e. V-cycle
! with basic smoothed aggregation, 1 hybrid forward/backward
! GS sweep as pre/post-smoother and UMFPACK as coarsest-level
! solver
@ -159,7 +159,7 @@ setup and application of the default multi-level preconditioner (example 1).
</DIV>
<FONT SIZE="+1"><FONT SIZE="+1"></FONT></FONT>
<P>
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">Different versions of the multi-level preconditioner can be obtained by changing
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">Different versions of the multilevel preconditioner can be obtained by changing
the default values of the preconditioner parameters. The code reported in
Figure&nbsp;<A HREF="#fig:ex2">3</A> shows how to set a V-cycle preconditioner
which applies 1 block-Jacobi sweep as pre- and post-smoother,
@ -197,7 +197,7 @@ boundary conditions are also available in the directory <code>examples/pdegen</c
<DIV ALIGN="CENTER"><A NAME="fig:ex2"></A><A NAME="909"></A>
<TABLE>
<CAPTION ALIGN="BOTTOM"><STRONG>Figure 3:</STRONG>
setup of a multi-level preconditioner</CAPTION>
setup of a multilevel preconditioner</CAPTION>
<TR><TD>
<DIV ALIGN="CENTER">
</DIV><TABLE WIDTH="90%">
@ -230,7 +230,7 @@ setup of a multi-level preconditioner</CAPTION>
<DIV ALIGN="CENTER"><A NAME="fig:ex3"></A><A NAME="911"></A>
<TABLE>
<CAPTION ALIGN="BOTTOM"><STRONG>Figure 4:</STRONG>
setup of a multi-level preconditioner</CAPTION>
setup of a multilevel preconditioner</CAPTION>
<TR><TD>
<DIV ALIGN="CENTER">
</DIV><TABLE WIDTH="90%">

2
docs/html/node18.html
Unescape Escape View File

@ -60,7 +60,7 @@ User Interface
routines <code>init</code>, <code>set</code>,
<code>hierarchy_build</code>, <code>smoothers_build</code>,
<code>bld</code>, and <code>apply</code> encapsulate all the
functionalities for the setup and the application of any multi-level and one-level
functionalities for the setup and the application of any multilevel and one-level
preconditioner implemented in the package.
The routine <code>free</code> deallocates the preconditioner data structure, while
<code>descr</code> prints a description of the preconditioner setup by the user.

31
docs/html/node20.html
Unescape Escape View File

@ -109,7 +109,7 @@ contained in <code>val</code>.
</TR>
<TR><TD ALIGN="LEFT" VALIGN="TOP" WIDTH=34><FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">
</FONT></FONT></FONT></TD>
<TD ALIGN="LEFT" VALIGN="TOP" WIDTH=340><FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1"> For the multi-level preconditioner, the level at which the
<TD ALIGN="LEFT" VALIGN="TOP" WIDTH=340><FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1"> For the multilevel preconditioner, the level at which the
preconditioner parameter has to be set.
The levels are numbered in increasing
order starting from the finest one, i.e., level 1 is the finest level.
@ -123,7 +123,7 @@ contained in <code>val</code>.
</TR>
<TR><TD ALIGN="LEFT" VALIGN="TOP" WIDTH=34><FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">
</FONT></FONT></FONT></TD>
<TD ALIGN="LEFT" VALIGN="TOP" WIDTH=340><FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1"> For the multi-level preconditioner, when both
<TD ALIGN="LEFT" VALIGN="TOP" WIDTH=340><FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1"> For the multilevel preconditioner, when both
<code>ilev</code> and <code>ilmax</code> are present, the settings
are applied at all levels <code>ilev:ilmax</code>. When
<code>ilev</code> is present but <code>ilmax</code> is not, then
@ -164,14 +164,14 @@ by a suitable setting of the preconditioner parameters. These parameters
can be logically divided into four groups, i.e., parameters defining
</FONT></FONT></FONT>
<OL>
<LI>the type of multi-level cycle and how many cycles must be applied;
<LI>the type of multilevel cycle and how many cycles must be applied;
</LI>
<LI>the aggregation algorithm;
</LI>
<LI>the coarse-space correction at the coarsest level (for multi-level
<LI>the coarse-space correction at the coarsest level (for multilevel
preconditioners only);
</LI>
<LI>the smoother of the multi-level preconditioners, or the one-level
<LI>the smoother of the multilevel preconditioners, or the one-level
preconditioner.
<P>
@ -252,7 +252,7 @@ solver is changed to the default sequential solver.
<DIV ALIGN="CENTER"><A NAME="1337"></A>
<TABLE>
<CAPTION><STRONG>Table 2:</STRONG>
Parameters defining the multi-level cycle and the number of cycles to
Parameters defining the multilevel cycle and the number of cycles to
be applied.
</CAPTION>
<TR><TD>
@ -276,7 +276,7 @@ be applied.
<P>
<TT>'ADD'</TT></TD>
<TD ALIGN="LEFT" VALIGN="TOP" WIDTH=68><TT>'VCYCLE'</TT></TD>
<TD ALIGN="LEFT" VALIGN="TOP" WIDTH=204>Multi-level cycle: V-cycle, W-cycle, K-cycle, hybrid Multiplicative Schwarz,
<TD ALIGN="LEFT" VALIGN="TOP" WIDTH=204>Multilevel cycle: V-cycle, W-cycle, K-cycle, hybrid Multiplicative Schwarz,
and Additive Schwarz.
<P>
Note that hybrid Multiplicative Schwarz is equivalent to V-cycle and
@ -291,7 +291,7 @@ number <IMG
SRC="img74.png"
ALT="$\ge 1$"></TD>
<TD ALIGN="LEFT" VALIGN="TOP" WIDTH=68>1</TD>
<TD ALIGN="LEFT" VALIGN="TOP" WIDTH=204>Number of multi-level cycles.</TD>
<TD ALIGN="LEFT" VALIGN="TOP" WIDTH=204>Number of multilevel cycles.</TD>
</TR>
</TABLE>
</DIV>
@ -533,12 +533,11 @@ level.</CAPTION>
Note that <TT>UMF</TT> and <TT>SLU</TT> require the coarsest
matrix to be replicated, <TT>SLUDIST</TT>, <TT>JACOBI</TT>,
<TT>GS</TT> and <TT>BJAC</TT> require it to be
distributed, <TT>MUMPS</TT> can be used with either
distributed, and <TT>MUMPS</TT> can be used with either
a replicated or a distributed matrix. When any of the previous
solvers is specified, the matrix layout is set to a default
value
which allows the use
value UMFPACK and SuperLU_Dist
solvers is specified, the matrix layout is set to a default
value which allows the use of the solver (see Remark 3, p.&nbsp;24).
Note also that UMFPACK and SuperLU_Dist
are available only in double precision.</TD>
</TR>
<TR><TD ALIGN="LEFT" VALIGN="TOP" WIDTH=111><code>'COARSE_SUBSOLVE'</code></TD>
@ -690,7 +689,7 @@ Parameters defining the smoother or the details of the one-level preconditioner.
</FONT></TD>
<TD ALIGN="LEFT" VALIGN="TOP" WIDTH=102><FONT SIZE="-1"> <code>'FBGS'</code>
</FONT></TD>
<TD ALIGN="LEFT" VALIGN="TOP" WIDTH=184><FONT SIZE="-1"> Type of smoother used in the multi-level preconditioner:
<TD ALIGN="LEFT" VALIGN="TOP" WIDTH=184><FONT SIZE="-1"> Type of smoother used in the multilevel preconditioner:
point-Jacobi, hybrid (forward) Gauss-Seidel,
hybrid backward Gauss-Seidel, block-Jacobi, and
Additive Schwarz. </FONT>
@ -719,7 +718,7 @@ Parameters defining the smoother or the details of the one-level preconditioner.
<FONT SIZE="-1"><TT>'UMF'</TT>
</FONT></TD>
<TD ALIGN="LEFT" VALIGN="TOP" WIDTH=102><FONT SIZE="-1"> <TT>GS</TT> and <TT>BGS</TT> for pre- and post-smoothers
of multi-level preconditioners, respectively </FONT>
of multilevel preconditioners, respectively </FONT>
<P>
<FONT SIZE="-1"><TT>ILU</TT> for block-Jacobi and Additive Schwarz
one-level preconditioners
@ -754,7 +753,7 @@ Parameters defining the smoother or the details of the one-level preconditioner.
<TD ALIGN="LEFT" VALIGN="TOP" WIDTH=102><FONT SIZE="-1"> 1
</FONT></TD>
<TD ALIGN="LEFT" VALIGN="TOP" WIDTH=184><FONT SIZE="-1"> Number of sweeps of the smoother or one-level preconditioner.
In the multi-level case, no pre-smother or
In the multilevel case, no pre-smother or
post-smoother is used if this parameter is set to 0
together with <code>pos='PRE'</code> or <code>pos='POST</code>,
respectively. </FONT></TD>

4
docs/html/node21.html
Unescape Escape View File

@ -63,7 +63,7 @@ Subroutine build
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">
This routine builds the one-level preconditioner <code>p</code> according to the requirements
made by the user through the routines <code>init</code> and <code>set</code>
(see Sections&nbsp;<A HREF="node22.html#sec:hier_bld">6.4</A> and&nbsp;<A HREF="node23.html#sec:smooth_bld">6.5</A> for multi-level preconditioners).
(see Sections&nbsp;<A HREF="node22.html#sec:hier_bld">6.4</A> and&nbsp;<A HREF="node23.html#sec:smooth_bld">6.5</A> for multilevel preconditioners).
</FONT></FONT></FONT>
<P>
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1"><B>Arguments</B></FONT> </FONT></FONT></FONT>
@ -111,7 +111,7 @@ as follows:
</FONT></FONT></FONT></DIV><FONT SIZE="+1"><FONT SIZE="+1"></FONT></FONT>
<P>
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">
In this case, the routine can be used to build multi-level preconditioners too.
In this case, the routine can be used to build multilevel preconditioners too.
</FONT></FONT></FONT>
<P>
<FONT SIZE="+1"><FONT SIZE="+1"></FONT></FONT>

2
docs/html/node22.html
Unescape Escape View File

@ -62,7 +62,7 @@ Subroutine hierarchy_build
<P>
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">
This routine builds the hierarchy of matrices and restriction/prolongation
operators for the multi-level preconditioner <code>p</code>, according to the requirements
operators for the multilevel preconditioner <code>p</code>, according to the requirements
made by the user through the routines <code>init</code> and <code>set</code>.
</FONT></FONT></FONT>
<P>

2
docs/html/node23.html
Unescape Escape View File

@ -62,7 +62,7 @@ Subroutine smoothers_build
<P>
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">
This routine builds the smoothers and the coarsest-level solvers for the
multi-level preconditioner <code>p</code>, according to the requirements made by
multilevel preconditioner <code>p</code>, according to the requirements made by
the user through the routines <code>init</code> and <code>set</code>, and based on the aggregation
hierarchy produced by a previous call to <code>hierarchy_build</code>
(see Section&nbsp;<A HREF="node22.html#sec:hier_bld">6.4</A>).

2
docs/html/node28.html
Unescape Escape View File

@ -56,7 +56,7 @@ original version by: Nikos Drakos, CBLU, University of Leeds
Error Handling
</H1><FONT SIZE="+1"><FONT SIZE="+1"></FONT></FONT>
<P>
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">The error handling in MLD2P4 is based on the PSBLAS (version 2) error
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">The error handling in MLD2P4 is based on the PSBLAS error
handling. Error conditions are signaled via an integer argument
<code>info</code>; whenever an error condition is detected, an error trace
stack is built by the library up to the top-level, user-callable

5
docs/html/node29.html
Unescape Escape View File

@ -58,13 +58,12 @@ License
<P>
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">The MLD2P4 is freely distributable under the following copyright
terms: </FONT></FONT></FONT><PRE>
MLD2P4 version 2.1
MultiLevel Domain Decomposition Parallel Preconditioners Package
based on PSBLAS (Parallel Sparse BLAS version 3.4)
based on PSBLAS (Parallel Sparse BLAS version 3.5)
(C) Copyright 2008, 2010, 2012, 2017
(C) Copyright 2008, 2010, 2012, 2015, 2017
Salvatore Filippone Cranfield University, Cranfield, UK
Pasqua D'Ambra IAC-CNR, Naples, IT

14
docs/html/node3.html
Unescape Escape View File

@ -56,7 +56,7 @@ original version by: Nikos Drakos, CBLU, University of Leeds
General Overview
</H1><FONT SIZE="+1"><FONT SIZE="+1"></FONT></FONT>
<P>
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">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
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">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 parallel Algebraic MultiGrid (AMG) and Domain
Decomposition preconditioners (see, e.g., [<A
HREF="node30.html#Briggs2000">3</A>,<A
@ -87,18 +87,18 @@ where <IMG
WIDTH="18" HEIGHT="15" ALIGN="BOTTOM" BORDER="0"
SRC="img3.png"
ALT="$A$"> is a square, real or complex, sparse matrix. The name of the package comes from its original implementation, containing
multi-level additive and hybrid Schwarz preconditioners, as well as one-level additive
multilevel additive and hybrid Schwarz preconditioners, as well as one-level additive
Schwarz preconditioners. The current version extends the original plan by including
multi-level cycles and smoothers widely used in multigrid methods.
multilevel cycles and smoothers widely used in multigrid methods.
</FONT></FONT></FONT>
<P>
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">The multi-level preconditioners implemented in MLD2P4 are obtained by combining
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">The multilevel preconditioners implemented in MLD2P4 are obtained by combining
AMG cycles with smoothers and coarsest-level solvers. The V-, W-, and
K-cycles&nbsp;[<A
HREF="node30.html#Briggs2000">3</A>,<A
HREF="node30.html#Notay2008">19</A>] are available, which allow to define
almost all the preconditioners in the package, including the multi-level hybrid
Schwarz ones; a specific cycle is implemented to obtain multi-level additive
almost all the preconditioners in the package, including the multilevel hybrid
Schwarz ones; a specific cycle is implemented to obtain multilevel additive
Schwarz preconditioners. The Jacobi, hybridforward/backward Gauss-Seidel, block-Jacobi, and additive Schwarz methods
are available as smoothers. An algebraic approach is used to generate a hierarchy of
coarse-level matrices and operators, without explicitly using any information on the
@ -154,7 +154,7 @@ Section&nbsp;<A HREF="node27.html#sec:adding">7</A>).
</FONT></FONT></FONT>
<P>
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">We note that the user interface of MLD2P4 2.1 has been extended with respect to the
previous versions in order to separate the construction of the multi-level hierarchy from
previous versions in order to separate the construction of the multilevel hierarchy from
the construction of the smoothers and solvers, and to allow for more flexibility
at each level. The software architecture described in&nbsp;[<A
HREF="node30.html#MLD2P4_TOMS">8</A>] has significantly

224
docs/html/node30.html
Unescape Escape View File

@ -56,121 +56,121 @@ Bibliography</A>
<P>
<P></P><DT><A NAME="MUMPS">1</A>
<DD>
P.&nbsp;R.&nbsp;Amestoy, C.&nbsp;Ashcraft, O.&nbsp;Boiteau, A.&nbsp;Buttari, J.&nbsp;L'Excellent, C.&nbsp;Weisbecker,
<EM>Improving multifrontal methods by means of block low-rank representations</EM>,
SIAM Journal on Scientific Computing, volume 37 (3), 2015, A1452-A1474.
See also <TT>http://mumps.enseeiht.fr</TT>. <P></P><DT><A NAME="BREZINA_VANEK">2</A>
<DD>
M.&nbsp;Brezina, P.&nbsp;Vanek,
<EM>A Black-Box Iterative Solver Based on a Two-Level Schwarz Method</EM>,
Computing, 63, 1999, 233-263. <P></P><DT><A NAME="Briggs2000">3</A>
<DD>
W.&nbsp;L.&nbsp;Briggs, V.&nbsp;E.&nbsp;Henson, S.&nbsp;F.&nbsp;McCormick,
<EM>A Multigrid Tutorial, Second Edition</EM>,
SIAM, 2000. <P></P><DT><A NAME="para_04">4</A>
<DD>
A.&nbsp;Buttari, P.&nbsp;D'Ambra, D.&nbsp;di Serafino, S.&nbsp;Filippone,
<EM>Extending PSBLAS to Build Parallel Schwarz Preconditioners</EM>,
in J.&nbsp;Dongarra, K.&nbsp;Madsen, J.&nbsp;Wasniewski, editors,
Proceedings of PARA&nbsp;04 Workshop on State of the Art
in Scientific Computing, Lecture Notes in Computer Science,
Springer, 2005, 593-602. <P></P><DT><A NAME="aaecc_07">5</A>
<DD>
A.&nbsp;Buttari, P.&nbsp;D'Ambra, D.&nbsp;di&nbsp;Serafino, S.&nbsp;Filippone,
<EM>2LEV-D2P4: a package of high-performance preconditioners
for scientific and engineering applications</EM>,
Applicable Algebra in Engineering, Communications and Computing,
18 (3) 2007, 223-239. <P></P><DT><A NAME="CAI_SARKIS">6</A>
<DD>
X.&nbsp;C.&nbsp;Cai, M.&nbsp;Sarkis,
<EM>A Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems</EM>,
SIAM Journal on Scientific Computing, 21 (2), 1999, 792-797. <P></P><DT><A NAME="apnum_07">7</A>
<DD>
P.&nbsp;D'Ambra, S.&nbsp;Filippone, D.&nbsp;di&nbsp;Serafino,
<EM>On the Development of PSBLAS-based Parallel Two-level Schwarz Preconditioners</EM>,
Applied Numerical Mathematics, Elsevier Science,
57 (11-12), 2007, 1181-1196. <P></P><DT><A NAME="MLD2P4_TOMS">8</A>
<DD>
P.&nbsp;D'Ambra, D.&nbsp;di&nbsp;Serafino, S.&nbsp;Filippone,
<I>MLD2P4: a Package of Parallel Multilevel
Algebraic Domain Decomposition Preconditioners
in Fortran 95</I>, ACM Trans. Math. Softw., 37(3), 2010, art. 30. <P></P><DT><A NAME="UMFPACK">9</A>
<DD>
T.&nbsp;A.&nbsp;Davis,
<EM>Algorithm 832: UMFPACK - an Unsymmetric-pattern Multifrontal
Method with a Column Pre-ordering Strategy</EM>,
ACM Transactions on Mathematical Software, 30, 2004, 196-199.
(See also <TT>http://www.cise.ufl.edu/&nbsp;davis/</TT>) <P></P><DT><A NAME="SUPERLU">10</A>
<DD>
J.&nbsp;W.&nbsp;Demmel, S.&nbsp;C.&nbsp;Eisenstat, J.&nbsp;R.&nbsp;Gilbert, X.&nbsp;S.&nbsp;Li, J.&nbsp;W.&nbsp;H.&nbsp;Liu,
A supernodal approach to sparse partial pivoting,
SIAM Journal on Matrix Analysis and Applications, 20 (3), 1999, 720-755. <P></P><DT><A NAME="blas3">11</A>
<DD>
J.&nbsp;J.&nbsp;Dongarra, J.&nbsp;Du Croz, I.&nbsp;S.&nbsp;Duff, S.&nbsp;Hammarling,
<I>A set of Level 3 Basic Linear Algebra Subprograms</I>,
ACM Transactions on Mathematical Software, 16 (1) 1990, 1-17. <P></P><DT><A NAME="blas2">12</A>
<DD>
J.&nbsp;J.&nbsp;Dongarra, J.&nbsp;Du Croz, S.&nbsp;Hammarling, R.&nbsp;J.&nbsp;Hanson,
<I>An extended set of FORTRAN Basic Linear Algebra Subprograms</I>,
ACM Transactions on Mathematical Software, 14 (1) 1988, 1-17. <P></P><DT><A NAME="PSBLASGUIDE">13</A>
<DD>
S.&nbsp;Filippone, A.&nbsp;Buttari,
<EM>PSBLAS-3.0 User's Guide. A Reference Guide for the Parallel Sparse BLAS Library</EM>, 2012,
available from <TT>http://www.ce.uniroma2.it/psblas/</TT>. <P></P><DT><A NAME="PSBLAS3">14</A>
<DD>
S.&nbsp;Filippone, A.&nbsp;Buttari,
<EM>Object-Oriented Techniques for Sparse Matrix Computations in Fortran 2003</EM>.
ACM Transactions on on Mathematical Software, 38 (4), 2012, art.&nbsp;23. <P></P><DT><A NAME="psblas_00">15</A>
<DD>
S.&nbsp;Filippone, M.&nbsp;Colajanni,
<EM>PSBLAS: A Library for Parallel Linear Algebra
Computation on Sparse Matrices</EM>,
ACM Transactions on Mathematical Software, 26 (4), 2000, 527-550. <P></P><DT><A NAME="MPI2">16</A>
<DD>
W.&nbsp;Gropp, S.&nbsp;Huss-Lederman, A.&nbsp;Lumsdaine, E.&nbsp;Lusk, B.&nbsp;Nitzberg, W.&nbsp;Saphir, M.&nbsp;Snir,
<EM>MPI: The Complete Reference. Volume 2 - The MPI-2 Extensions</EM>,
MIT Press, 1998. <P></P><DT><A NAME="blas1">17</A>
<DD>
C.&nbsp;L.&nbsp;Lawson, R.&nbsp;J.&nbsp;Hanson, D.&nbsp;Kincaid, F.&nbsp;T.&nbsp;Krogh,
<I>Basic Linear Algebra Subprograms for FORTRAN usage</I>,
ACM Transactions on Mathematical Software, 5 (3), 1979, 308-323. <P></P><DT><A NAME="SUPERLUDIST">18</A>
<DD>
X.&nbsp;S.&nbsp;Li, J.&nbsp;W.&nbsp;Demmel,
<EM>SuperLU_DIST: A Scalable Distributed-memory
Sparse Direct Solver for Unsymmetric Linear Systems</EM>,
ACM Transactions on Mathematical Software, 29 (2), 2003, 110-140. <P></P><DT><A NAME="Notay2008">19</A>
<DD>
Y.&nbsp;Notay, P.&nbsp;S.&nbsp;Vassilevski,
<EM>Recursive Krylov-based multigrid cycles</EM>,
Numerical Linear Algebra with Applications, 15 (5), 2008, 473-487. <P></P><DT><A NAME="Saad_book">20</A>
<DD>
Y.&nbsp;Saad,
<EM>Iterative methods for sparse linear systems</EM>, 2nd edition, SIAM, 2003. <P></P><DT><A NAME="dd2_96">21</A>
<DD>
B.&nbsp;Smith, P.&nbsp;Bjorstad, W.&nbsp;Gropp,
<EM>Domain Decomposition: Parallel Multilevel Methods for Elliptic
Partial Differential Equations</EM>,
Cambridge University Press, 1996. <P></P><DT><A NAME="MPI1">22</A>
<DD>
M.&nbsp;Snir, S.&nbsp;Otto, S.&nbsp;Huss-Lederman, D.&nbsp;Walker, J.&nbsp;Dongarra,
<EM>MPI: The Complete Reference. Volume 1 - The MPI Core</EM>, second edition,
MIT Press, 1998. <P></P><DT><A NAME="Stuben_01">23</A>
<DD>
K.&nbsp;St&#252;ben,
<EM>An Introduction to Algebraic Multigrid</EM>,
in A.&nbsp;Sch&#252;ller, U.&nbsp;Trottenberg, C.&nbsp;Oosterlee, Multigrid,
Academic Press, 2001. <P></P><DT><A NAME="TUMINARO_TONG">24</A>
<DD>
R.&nbsp;S.&nbsp;Tuminaro, C.&nbsp;Tong,
<EM>Parallel Smoothed Aggregation Multigrid: Aggregation Strategies on Massively Parallel Machines</EM>, in J. Donnelley, editor, Proceedings of SuperComputing 2000, Dallas, 2000. <P></P><DT><A NAME="VANEK_MANDEL_BREZINA">25</A>
<DD>
P.&nbsp;Vanek, J.&nbsp;Mandel, M.&nbsp;Brezina,
<EM>Algebraic Multigrid by Smoothed Aggregation for Second and Fourth Order Elliptic Problems</EM>,
<DD>
P.&nbsp;R.&nbsp;Amestoy, C.&nbsp;Ashcraft, O.&nbsp;Boiteau, A.&nbsp;Buttari, J.&nbsp;L'Excellent, C.&nbsp;Weisbecker,
<EM>Improving multifrontal methods by means of block low-rank representations</EM>,
SIAM Journal on Scientific Computing, volume 37 (3), 2015, A1452-A1474.
See also <TT>http://mumps.enseeiht.fr</TT>.<P></P><DT><A NAME="BREZINA_VANEK">2</A>
<DD>
M.&nbsp;Brezina, P.&nbsp;Vanek,
<EM>A Black-Box Iterative Solver Based on a Two-Level Schwarz Method</EM>,
Computing, 63, 1999, 233-263.<P></P><DT><A NAME="Briggs2000">3</A>
<DD>
W.&nbsp;L.&nbsp;Briggs, V.&nbsp;E.&nbsp;Henson, S.&nbsp;F.&nbsp;McCormick,
<EM>A Multigrid Tutorial, Second Edition</EM>,
SIAM, 2000.<P></P><DT><A NAME="para_04">4</A>
<DD>
A.&nbsp;Buttari, P.&nbsp;D'Ambra, D.&nbsp;di Serafino, S.&nbsp;Filippone,
<EM>Extending PSBLAS to Build Parallel Schwarz Preconditioners</EM>,
in J.&nbsp;Dongarra, K.&nbsp;Madsen, J.&nbsp;Wasniewski, editors,
Proceedings of PARA&nbsp;04 Workshop on State of the Art
in Scientific Computing, Lecture Notes in Computer Science,
Springer, 2005, 593-602.<P></P><DT><A NAME="aaecc_07">5</A>
<DD>
A.&nbsp;Buttari, P.&nbsp;D'Ambra, D.&nbsp;di&nbsp;Serafino, S.&nbsp;Filippone,
<EM>2LEV-D2P4: a package of high-performance preconditioners
for scientific and engineering applications</EM>,
Applicable Algebra in Engineering, Communications and Computing,
18 (3) 2007, 223-239.<P></P><DT><A NAME="CAI_SARKIS">6</A>
<DD>
X.&nbsp;C.&nbsp;Cai, M.&nbsp;Sarkis,
<EM>A Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems</EM>,
SIAM Journal on Scientific Computing, 21 (2), 1999, 792-797.<P></P><DT><A NAME="apnum_07">7</A>
<DD>
P.&nbsp;D'Ambra, S.&nbsp;Filippone, D.&nbsp;di&nbsp;Serafino,
<EM>On the Development of PSBLAS-based Parallel Two-level Schwarz Preconditioners</EM>,
Applied Numerical Mathematics, Elsevier Science,
57 (11-12), 2007, 1181-1196.<P></P><DT><A NAME="MLD2P4_TOMS">8</A>
<DD>
P.&nbsp;D'Ambra, D.&nbsp;di&nbsp;Serafino, S.&nbsp;Filippone,
<I>MLD2P4: a Package of Parallel Multilevel
Algebraic Domain Decomposition Preconditioners
in Fortran 95</I>, ACM Trans. Math. Softw., 37(3), 2010, art. 30.<P></P><DT><A NAME="UMFPACK">9</A>
<DD>
T.&nbsp;A.&nbsp;Davis,
<EM>Algorithm 832: UMFPACK - an Unsymmetric-pattern Multifrontal
Method with a Column Pre-ordering Strategy</EM>,
ACM Transactions on Mathematical Software, 30, 2004, 196-199.
(See also <TT>http://www.cise.ufl.edu/~davis/</TT>)<P></P><DT><A NAME="SUPERLU">10</A>
<DD>
J.&nbsp;W.&nbsp;Demmel, S.&nbsp;C.&nbsp;Eisenstat, J.&nbsp;R.&nbsp;Gilbert, X.&nbsp;S.&nbsp;Li, J.&nbsp;W.&nbsp;H.&nbsp;Liu,
<EM>A supernodal approach to sparse partial pivoting</EM>,
SIAM Journal on Matrix Analysis and Applications, 20 (3), 1999, 720-755.<P></P><DT><A NAME="blas3">11</A>
<DD>
J.&nbsp;J.&nbsp;Dongarra, J.&nbsp;Du Croz, I.&nbsp;S.&nbsp;Duff, S.&nbsp;Hammarling,
<I>A set of Level 3 Basic Linear Algebra Subprograms</I>,
ACM Transactions on Mathematical Software, 16 (1) 1990, 1-17.<P></P><DT><A NAME="blas2">12</A>
<DD>
J.&nbsp;J.&nbsp;Dongarra, J.&nbsp;Du Croz, S.&nbsp;Hammarling, R.&nbsp;J.&nbsp;Hanson,
<I>An extended set of FORTRAN Basic Linear Algebra Subprograms</I>,
ACM Transactions on Mathematical Software, 14 (1) 1988, 1-17.<P></P><DT><A NAME="PSBLASGUIDE">13</A>
<DD>
S.&nbsp;Filippone, A.&nbsp;Buttari,
<EM>PSBLAS 3.5.0 User's Guide. A Reference Guide for the Parallel Sparse BLAS Library</EM>, 2012,
available from <TT>https://github.com/sfilippone/psblas3/tree/master/docs</TT>.<P></P><DT><A NAME="PSBLAS3">14</A>
<DD>
S.&nbsp;Filippone, A.&nbsp;Buttari,
<EM>Object-Oriented Techniques for Sparse Matrix Computations in Fortran 2003</EM>.
ACM Transactions on on Mathematical Software, 38 (4), 2012, art.&nbsp;23.<P></P><DT><A NAME="psblas_00">15</A>
<DD>
S.&nbsp;Filippone, M.&nbsp;Colajanni,
<EM>PSBLAS: A Library for Parallel Linear Algebra
Computation on Sparse Matrices</EM>,
ACM Transactions on Mathematical Software, 26 (4), 2000, 527-550.<P></P><DT><A NAME="MPI2">16</A>
<DD>
W.&nbsp;Gropp, S.&nbsp;Huss-Lederman, A.&nbsp;Lumsdaine, E.&nbsp;Lusk, B.&nbsp;Nitzberg, W.&nbsp;Saphir, M.&nbsp;Snir,
<EM>MPI: The Complete Reference. Volume 2 - The MPI-2 Extensions</EM>,
MIT Press, 1998.<P></P><DT><A NAME="blas1">17</A>
<DD>
C.&nbsp;L.&nbsp;Lawson, R.&nbsp;J.&nbsp;Hanson, D.&nbsp;Kincaid, F.&nbsp;T.&nbsp;Krogh,
<I>Basic Linear Algebra Subprograms for FORTRAN usage</I>,
ACM Transactions on Mathematical Software, 5 (3), 1979, 308-323.<P></P><DT><A NAME="SUPERLUDIST">18</A>
<DD>
X.&nbsp;S.&nbsp;Li, J.&nbsp;W.&nbsp;Demmel,
<EM>SuperLU_DIST: A Scalable Distributed-memory
Sparse Direct Solver for Unsymmetric Linear Systems</EM>,
ACM Transactions on Mathematical Software, 29 (2), 2003, 110-140.<P></P><DT><A NAME="Notay2008">19</A>
<DD>
Y.&nbsp;Notay, P.&nbsp;S.&nbsp;Vassilevski,
<EM>Recursive Krylov-based multigrid cycles</EM>,
Numerical Linear Algebra with Applications, 15 (5), 2008, 473-487. <P></P><DT><A NAME="Saad_book">20</A>
<DD>
Y.&nbsp;Saad,
<EM>Iterative methods for sparse linear systems</EM>, 2nd edition, SIAM, 2003.<P></P><DT><A NAME="dd2_96">21</A>
<DD>
B.&nbsp;Smith, P.&nbsp;Bjorstad, W.&nbsp;Gropp,
<EM>Domain Decomposition: Parallel Multilevel Methods for Elliptic
Partial Differential Equations</EM>,
Cambridge University Press, 1996.<P></P><DT><A NAME="MPI1">22</A>
<DD>
M.&nbsp;Snir, S.&nbsp;Otto, S.&nbsp;Huss-Lederman, D.&nbsp;Walker, J.&nbsp;Dongarra,
<EM>MPI: The Complete Reference. Volume 1 - The MPI Core</EM>, second edition,
MIT Press, 1998.<P></P><DT><A NAME="Stuben_01">23</A>
<DD>
K.&nbsp;St&#252;ben,
<EM>An Introduction to Algebraic Multigrid</EM>,
in A.&nbsp;Sch&#252;ller, U.&nbsp;Trottenberg, C.&nbsp;Oosterlee, Multigrid,
Academic Press, 2001.<P></P><DT><A NAME="TUMINARO_TONG">24</A>
<DD>
R.&nbsp;S.&nbsp;Tuminaro, C.&nbsp;Tong,
<EM>Parallel Smoothed Aggregation Multigrid: Aggregation Strategies on Massively Parallel Machines</EM>, in J. Donnelley, editor, Proceedings of SuperComputing 2000, Dallas, 2000.<P></P><DT><A NAME="VANEK_MANDEL_BREZINA">25</A>
<DD>
P.&nbsp;Vanek, J.&nbsp;Mandel, M.&nbsp;Brezina,
<EM>Algebraic Multigrid by Smoothed Aggregation for Second and Fourth Order Elliptic Problems</EM>,
Computing, 56 (3) 1996, 179-196.
<P>
</DL><FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">
</DL><FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">
</FONT></FONT></FONT>
<P>
<FONT SIZE="+1"><FONT SIZE="+1"></FONT></FONT><BR><HR>

2
docs/html/node31.html
Unescape Escape View File

@ -63,7 +63,7 @@ Mathematics Department, Macquarie University, Sydney.
The command line arguments were: <BR>
<STRONG>latex2html</STRONG> <TT>-local_icons -noaddress -dir ../../html userhtml.tex</TT>
<P>
The translation was initiated by Salvatore Filippone on 2017-08-09<FONT SIZE="+1"><FONT SIZE="+1"></FONT></FONT>
The translation was initiated by Salvatore Filippone on 2017-09-15<FONT SIZE="+1"><FONT SIZE="+1"></FONT></FONT>
<BR><HR>
</BODY>

2
docs/html/node4.html
Unescape Escape View File

@ -59,7 +59,7 @@ Code Distribution
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">
MLD2P4 is available from the web site
</FONT></FONT></FONT>
<BLOCKQUOTE><FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1"><TT>http://www.mld2p4.it</TT>
<BLOCKQUOTE><FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1"><TT>https://github.com/sfilippone/mld2p4-2</TT>
</FONT></FONT></FONT></BLOCKQUOTE><FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">
where contact points for further information can be also found.
</FONT></FONT></FONT>

2
docs/html/node7.html
Unescape Escape View File

@ -95,7 +95,7 @@ in the make.inc file of the LAPACK library.
HREF="node30.html#PSBLASGUIDE">13</A>,<A
HREF="node30.html#psblas_00">15</A>] Parallel Sparse BLAS (PSBLAS) is
available from <TT><A NAME="tex2html4"
HREF="www.ce.uniroma2.it/psblas">www.ce.uniroma2.it/psblas</A></TT>; version
HREF="github.com/sfilippone/psblas3">github.com/sfilippone/psblas3</A></TT>; version
3.5.0 (or later) is required. Indeed, all the prerequisites
listed so far are also prerequisites of PSBLAS.
</DD>

2
docs/html/node8.html
Unescape Escape View File

@ -58,7 +58,7 @@ Optional third party libraries
<P>
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">We provide interfaces to the following third-party software libraries;
note that these are optional, but if you enable them some defaults
for multi-level preconditioners may change to reflect their presence.
for multilevel preconditioners may change to reflect their presence.
</FONT></FONT></FONT>
<P>
<FONT SIZE="+1"><FONT SIZE="+1"></FONT></FONT><DL>

3
docs/html/node9.html
Unescape Escape View File

@ -225,7 +225,8 @@ Some influential environment variables:
Use these variables to override the choices made by `configure' or to help
it to find libraries and programs with nonstandard names/locations.
Report bugs to &lt;bugreport@mld2p4.it&gt;.
Report bugs to &lt;pasqua.dambra@cnr.it; daniela.diserafino@unicampania.it;
salvatore.filippone@cranfield.ac.uk&gt;.
</PRE><FONT SIZE="+1"><FONT SIZE="+1"></FONT></FONT>
<P>
<FONT SIZE="+1"><FONT SIZE="+1"><FONT SIZE="+1">For instance, if a user has built and installed PSBLAS 3.5 under the

2
docs/html/userhtml.html
Unescape Escape View File

@ -43,7 +43,7 @@ original version by: Nikos Drakos, CBLU, University of Leeds
<BR>
<BR>
User's and Reference Guide</B></FONT>
<BR><I><FONT SIZE="+1">A guide for the Multi-Level Domain Decomposition
<BR><I><FONT SIZE="+1">A guide for the MultiLevel Domain Decomposition
Parallel Preconditioners Package
based on PSBLAS</FONT></I>
<BR>

6
docs/mld2p4-2.1-guide.pdf
Unescape Escape View File

@ -10002,8 +10002,8 @@ endobj
681 0 obj
<<
/Title (MultiLevel Domain Decomposition Parallel Preconditioners Package based on PSBLAS, V. 2.1) /Subject (MultiLevel Domain Decomposition Parallel Preconditioners Package) /Keywords (Parallel Numerical Software, Algebraic Multilevel Preconditioners, Sparse Iterative Solvers, PSBLAS, MPI) /Creator (pdfLaTeX) /Producer ($Id: userguide.tex 2008-04-08 Pasqua D'Ambra, Daniela di Serafino, Salvatore Filippone$) /Author()/Title()/Subject()/Creator(LaTeX with hyperref package)/Producer(pdfTeX-1.40.17)/Keywords()
/CreationDate (D:20170915113419+02'00')
/ModDate (D:20170915113419+02'00')
/CreationDate (D:20170915111631+01'00')
/ModDate (D:20170915111631+01'00')
/Trapped /False
/PTEX.Fullbanner (This is pdfTeX, Version 3.14159265-2.6-1.40.17 (TeX Live 2016) kpathsea version 6.2.2)
>>
@ -10061,7 +10061,7 @@ endobj
/W [1 3 1]
/Root 680 0 R
/Info 681 0 R
/ID [<D8B4C2DC44E079751A5DE854C50958B8> <D8B4C2DC44E079751A5DE854C50958B8>]
/ID [<B8570AD008CCB415791C0F3020850AA5> <B8570AD008CCB415791C0F3020850AA5>]
/Length 3415
>>
stream

Write Preview
Loading…
Cancel
Save