mld2p4:

copyright and internal doc adjustments for version 1.1.

docs/src/Makefile

@@ -139,7 +139,7 @@ PDF      = $(join $(BASEFILE),.pdf)
 PS       = $(join $(BASEFILE),.ps)
 GXS      = $(join $(BASEFILE),.gxs)
 GLX      = $(join $(BASEFILE),.glx)
-TARGETPDF= ../mld2p4-1.0-guide.pdf
+TARGETPDF= ../mld2p4-1.1-guide.pdf
 BASEHTML = $(patsubst %.tex,%,$(HTMLFILE))
 HTML     = $(join $(HTMLFILE),.html)
 HTMLDIR  = ../html

docs/src/abstract.tex

@@ -5,7 +5,7 @@ PSBLAS}) is a package of parallel algebraic multi-level preconditioners.
 It implements various versions of one-level additive and of multi-level additive
 and hybrid Schwarz algorithms. In the multi-level 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 required to be square, real
+concerning the matrix to be preconditioned. The matrix is assumed to be square, real
 or complex, with a symmetric sparsity pattern. 
 
 MLD2P4 has been designed to provide scalable and easy-to-use preconditioners in the

docs/src/background.tex

@@ -62,8 +62,8 @@ aggregation} algorithm \cite{BREZINA_VANEK,VANEK_MANDEL_BREZINA}. A decoupled ve
 of this algorithm is implemented, where the smoothed aggregation is applied locally
 to each submatrix \cite{TUMINARO_TONG}. 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 \cite{para_04,aaecc_07,apnum_07,dd2_96}.
+aggregation technique as implemented in MLD2P4. For further details the reader
+is referred to \cite{para_04,aaecc_07,apnum_07,MLD2P4_TOMS,dd2_96}.
 
 
 \subsection{Multi-level Schwarz Preconditioners\label{sec:multilevel}}
@@ -144,7 +144,7 @@ of the number of iterations on the degree of parallelism we may
 introduce a global coupling among the overlapping partitions by defining 
 a coarse-space approximation $A_C$ of the matrix $A$. 
 In a pure algebraic setting, $A_C$ is usually built with
-a Galerkin approach. Given a set $W_C$ of \emph{coarse vertices},
+the Galerkin approach. Given a set $W_C$ of \emph{coarse vertices},
 with size $n_C$, and a suitable restriction operator
 $R_C \in \Re^{n_C \times n}$, $A_C$ is defined as
 \[
@@ -225,7 +225,8 @@ example, in Figure~\ref{fig:mlhpost_alg}. Here the number of levels
 is denoted by $nlev$ and the levels are numbered in increasing order starting
 from the finest one, i.e.\ the finest level is level 1; the coarse matrix
 and the corresponding basic preconditioner at each level $l$ are denoted by $A_l$ and
-$M_l$, respectively, with $A_1=A$.
+$M_l$, respectively, with $A_1=A$, while the related restriction operator is
+denoted by $R_l$.
 % 
 \begin{figure}[t]
 \begin{center}

docs/src/bibliography.tex

@@ -69,7 +69,14 @@ T.~Chan and T.~Mathew,
 {\em Domain Decomposition Algorithms},
 in A.~Iserles, editor, Acta Numerica 1994, 61--143.
 Cambridge University Press.
-% 
+%
+%% \bibitem{MLD2P4_TOMS} 
+%% P.~D'Ambra, D.~di~Serafino, S.~Filippone,
+%% \emph{MLD2P4: a Package of Parallel Multilevel
+%% Algebraic Domain Decomposition Preconditioners
+%% in Fortran 95},
+%% COMPLETARE.
+%
 \bibitem{UMFPACK}
 T.A.~Davis, 
 {\em Algorithm 832: UMFPACK - an Unsymmetric-pattern Multifrontal

docs/src/building.tex

@@ -96,7 +96,7 @@ be specified with an {\em absolute} path).
 The full set of options may be looked at by issuing the command
 \verb|./configure --help|, which produces:
 \begin{verbatim}
-`configure' configures MLD2P4 1.0 to adapt to many kinds of systems.
+`configure' configures MLD2P4 1.1 to adapt to many kinds of systems.
 
 Usage: ./configure [OPTION]... [VAR=VALUE]...
 

docs/src/gettingstarted.tex

@@ -94,7 +94,7 @@ Multilevel        &\verb|'ML'|    & Multi-level hybrid preconditioner (additive
                                     Coarsest matrix: distributed among the processors.
                                     Coarsest-level solver: 
                                     4 sweeps of the block-Jacobi solver, 
-                                    with LU (or ILU) factorization of the blocks
+                                    with LU or ILU factorization of the blocks
                                     (UMFPACK for the double precision versions and
                                     SuperLU for the single precision ones, if the packages
                                     have been installed; ILU(0), otherwise).         \\

docs/src/license.tex

@@ -5,11 +5,11 @@
 The MLD2P4 is freely distributable under the following copyright
 terms: {\small
 \begin{verbatim} 
-                         MLD2P4  version 1.0
+                         MLD2P4  version 1.1
 MultiLevel Domain Decomposition Parallel Preconditioners Package
            based on PSBLAS (Parallel Sparse BLAS version 2.3)
 
-(C) Copyright 2008
+(C) Copyright 2008, 2009
 
                     Salvatore Filippone  University of Rome Tor Vergata       
                     Alfredo Buttari      University of Rome Tor Vergata
@@ -41,4 +41,4 @@ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 POSSIBILITY OF SUCH DAMAGE.
 \end{verbatim}
-}
+}

docs/src/overview.tex

@@ -69,7 +69,8 @@ build any preconditioner available in MLD2P4 and to apply it within a PSBLAS Kry
 On the other hand, the routines of the middle and lower layer can be used and extended
 by expert users to build new versions of multi-level Schwarz preconditioners.
 We provide here a description of the upper-layer routines, but not of the
-medium-layer ones.
+medium-layer ones.%%  For a detailed description of the overall software architecture
+%% of MLD2P4 the reader is referred to~\cite{MLD2P4_TOMS}.
 
 This guide is organized as follows. General information on the distribution of the source code
 is reported in Section~\ref{sec:distribution}, while details on the configuration

docs/src/userguide.tex

@@ -27,7 +27,7 @@
 \pdfcompresslevel=0             %-- 0 = none, 9 = best
 \pdfinfo{                       %-- Info dictionary of PDF output  /Author (PD, DdS, SF)
   /Title    (MultiLevel Domain Decomposition Parallel Preconditioners Package
-             based on PSBLAS, V. 1.0)
+             based on PSBLAS, V. 1.1)
   /Subject  (MultiLevel Domain Decomposition Parallel Preconditioners Package)
   /Keywords (Parallel Numerical Software, Algebraic Multilevel Preconditioners, Sparse Iterative Solvers, PSBLAS, MPI)
   /Creator  (pdfLaTeX)
@@ -125,9 +125,9 @@ based on PSBLAS}
 \vspace{\stretch{1}}
 \noindent\hspace*{\centeroffset}\makebox[0pt][l]{\begin{minipage}{\textwidth}
 \flushright
-\large Software version: 1.0\\
+\large Software version: 1.1\\
 %\today
-\large Sept. 9th, 2008
+\large March 13, 2009
 \end{minipage}}
 %\addtolength{\textwidth}{\centeroffset}
 \vspace{\stretch{2}}

docs/src/userhtml.tex

@@ -102,9 +102,9 @@ based on PSBLAS}\\[3ex]
  University of Rome ``Tor Vergata'', Italy\\[2ex]
 %\\[10ex]
 %\today
-Software version: 1.0\\
+Software version: 1.1\\
 %\today
-Sept. 9th, 2008
+March 13, 2009
 \clearpage
 \ \\
 \thispagestyle{empty}

docs/src/userinterface.tex

@@ -228,9 +228,10 @@ refer to Section~\ref{sec:background}.
                          & Aggregation algorithm. Currently, only the
                          decoupled aggregation is available. \\ \hline 
 \verb|mld_aggr_kind_|    & \verb|character(len=*)|
-                         & \texttt{'SMOOTH'} \hspace{2.5cm} \texttt{'RAW'}
-                         & \texttt{'SMOOTH'}
-                         & Type of aggregation: smoothed, raw (i.e.\ using the tentative prolongator). \\ \hline
+                         & \texttt{'SMOOTHED'} \hspace{2.5cm} \texttt{'NONSMOOTHED'}
+                         & \texttt{'SMOOTHED'}
+                         & Type of aggregation: smoothed, nonsmoothed
+                         (i.e.\ using the tentative prolongator). \\ \hline
 \verb|mld_aggr_thresh_|  & \verb|real(|\emph{kind\_parameter}\verb|)|
                          & Any~real~num. $\in [0, 1]$
                          & 0
@@ -312,10 +313,10 @@ refer to Section~\ref{sec:background}.
                          & 0
                          & Drop tolerance $t$ in the ILU($p,t$) factorization. \\
 \hline
-\multicolumn{5}{|l|}{{\bfseries Note} Defaults for
+\multicolumn{5}{|l|}{{\bfseries Note:} defaults for
   {\texttt mld\_coarse\_subsolve\_} are chosen as }\\ 
-\multicolumn{5}{|l|}{Single precision version: 'SLU' if installed, 'ILU' otherwise}\\
-\multicolumn{5}{|l|}{Double precision version: 'UMF' if installed,
+\multicolumn{5}{|l|}{single precision version: 'SLU' if installed, 'ILU' otherwise}\\
+\multicolumn{5}{|l|}{double precision version: 'UMF' if installed,
   else 'SLU' if installed, 'ILU' otherwise}\\
 \hline
 \end{tabular}
@@ -379,7 +380,7 @@ preconditioner, stored into \verb|p|, and $op$
 denotes the preconditioner itself or its transpose, according to
 the value of \verb|trans|.
 Note that, when MLD2P4 is used with a Krylov solver from PSBLAS,
-\verb|mld_precaply| is called within the PSBLAS routine \verb|mld_krylov|
+\verb|mld_precaply| is called within the PSBLAS routine \verb|psb_krylov|
 and hence it is completely transparent to the user.
 
 {\vskip2\baselineskip\noindent\large\bfseries Arguments}