Fixed image of PSBLAS.

docs/pdf/datastruct.tex

@@ -94,7 +94,7 @@ Specified as: an allocatable integer array of rank one.
 \item[{\bf glob\_to\_loc, glb\_lc, hashv}] Contain a mapping from
   global to local indices. 
 \end{description}
-The Fortran95 definition  for \verb|psb_desc_type| structures is 
+The Fortran~95 definition  for \verb|psb_desc_type| structures is 
 as follows:
 \begin{figure}[h!]
   \begin{Sbox}
@@ -203,8 +203,9 @@ as in Coordinate Storage or Compressed Sparse Rows, should be greater
 than or equal to the maximum column  index actually present in the sparse matrix.
 Specified as: integer variable.
 \end{description}
-FORTRAN95 interface for distributed sparse matrices containing double precision
-real entries is defined as in figure~\ref{fig:spmattype}.
+The Fortran~95 interface for distributed sparse matrices containing
+double precision real entries is defined as shown in
+figure~\ref{fig:spmattype}. 
 \begin{figure}[h!]
   \begin{Sbox}
     \begin{minipage}[tl]{0.85\textwidth}

docs/pdf/intro.tex

@@ -11,8 +11,10 @@ dense matrix operations.  The current implementation of PSBLAS
 addresses a distributed memory execution model operating with message
 passing. 
 
-The PSBLAS library is internally implemented in a mixture of
-Fortran~77 and Fortran~95~\cite{metcalf} programming languages. 
+The PSBLAS library is internally implemented in
+ the Fortran~95~\cite{metcalf} programming language, with reuse and/or
+ adaptation of some existing Fortran~77 software, and a handful of C
+ routines. 
 A similar approach has been advocated by a number of authors,
 e.g.~\cite{machiels}.  Moreover, the Fortran~95 facilities for dynamic
 memory management and interface overloading greatly enhance the
@@ -92,7 +94,7 @@ user does not need to delve into their details (see Sec.~\ref{sec:parenv}).
 %% grid and store internally for further use. 
 
 \begin{figure}[h] \begin{center}
-\includegraphics[scale=0.45]{figures/psblas}
+\rotatebox{-90}{\includegraphics[scale=0.65]{figures/psblas}}
 \end{center}
 \caption{PSBLAS library components hierarchy.\label{fig:psblas}}
 \end{figure}
@@ -173,7 +175,12 @@ another domain such that there is a boundary point which {\em depends\/}
 on it. Whenever performing a computational step, such as a
 matrix-vector product, the values associated with halo points are
 requested from other domains. A boundary point of a given 
-domain is a halo point for (at least) another domain; therefore
+domain is usually a halo point for some other domain\footnote{This is
+  the normal situation when the pattern of the sparse matrix is
+  symmetric, which is equivalent to say that the interaction between
+  two variables is reciprocal. If the matrix pattern is non-symmetric
+  we may have one-way interactions, and these could cause a situation
+  in which a boundary point is not a halo point for its neighbour.}; therefore
 the cardinality of the boundary points set denotes the amount of data
  sent to other domains. 
 \item[Overlap.] An overlap point is a boundary point assigned to
@@ -182,8 +189,8 @@ has to be replicated for each assignment.
 \end{description}
 Overlap points do not usually exist in the basic data
 distribution, but they are a feature of Domain Decomposition
-Schwarz preconditioners which we are in the process of including in
-our distribution~\cite{PARA04,APNUM06}. 
+Schwarz preconditioners which we are the subject of related research
+work~\cite{2007c,2007d}.  
 
 We denote the sets of  internal, boundary and halo points for a given
 subdomain  by $\cal I$, $\cal B$ and $\cal H$.

docs/pdf/toolsrout.tex

@@ -1352,8 +1352,9 @@ position as the corresponding entries in $x$.
 \end{description}
 \section*{Usage notes}
 \begin{enumerate}
-\item The sorting can be performed in the up/down direction; for
-  complex data the sorting must be done on the absolute values;
+\item The sorting can be performed in the up/down direction, on the
+  natural or absolute values; for  complex data the sorting can only
+  be done on the absolute values; 
 \item The routines return the items in the chosen ordering; the
   output difference is the handling of  ties (i.e. items with an
   equal   value) in the original input. With the merge-sort algorithm

docs/pdf/userguide.tex

@@ -103,11 +103,28 @@
 \cleardoublepage
 
 \begin{thebibliography}{99}
+
+\bibitem{PARA04FOREST}
+G.~Bella, S.~Filippone, A.~De Maio and M.~Testa,
+{\em A Simulation Model for Forest Fires},
+in J.~Dongarra, K.~Madsen, J.~Wasniewski, editors,
+Proceedings of PARA~04 Workshop on State of the Art
+in Scientific Computing, pp.~546--553, Lecture Notes in Computer Science,
+Springer, 2005.
+\bibitem{2007d} A. Buttari, D. di Serafino, P. D'Ambra, S. Filippone,\newblock
+2LEV-D2P4: a package of high-performance preconditioners,\newblock
+Applicable Algebra in Engineering, Communications and Computing, 
+Volume 18, Number 3, May, 2007, pp.  223-239
+%Published online: 13 February 2007, {\tt http://dx.doi.org/10.1007/s00200-007-0035-z}
 %
-\bibitem{BLAS1}
-Lawson, C.,  Hanson, R., Kincaid, D. and Krogh, F.,
-   Basic {L}inear {A}lgebra {S}ubprograms for {F}ortran usage,
-{ACM Trans. Math. Softw.} vol.~{5}, 38--329, 1979.
+\bibitem{2007c}  P. D'Ambra, S. Filippone,  D. Di Serafino\newblock
+On the Development of PSBLAS-based Parallel Two-level Schwarz Preconditioners
+\newblock
+Applied Numerical Mathematics, Elsevier Science, 
+Volume 57, Issues 11-12, November-December 2007, Pages 1181-1196.
+%published online 3 February 2007, {\tt
+%  http://dx.doi.org/10.1016/j.apnum.2007.01.006}
+
 \bibitem{BLAS2}
  Dongarra, J. J.,  DuCroz, J.,  Hammarling, S. and Hanson, R.,
 An Extended Set of {F}ortran {B}asic {L}inear {A}lgebra {S}ubprograms,
@@ -122,13 +139,6 @@ A  Set of level 3 Basic Linear Algebra Subprograms,
 %% Advances in Computational Mathematics, 1993, 1, 127-137.
 %% (See also {\tt http://www.mgnet.org/~douglas/ccd-codes.html}) 
 %
-\bibitem{PARA04FOREST}
-G.~Bella, S.~Filippone, A.~De Maio and M.~Testa,
-{\em A Simulation Model for Forest Fires},
-in J.~Dongarra, K.~Madsen, J.~Wasniewski, editors,
-Proceedings of PARA~04 Workshop on State of the Art
-in Scientific Computing, pp.~546--553, Lecture Notes in Computer Science,
-Springer, 2005.
 %
 %% \bibitem{PARA04}
 %% A.~Buttari, P.~D'Ambra, D.~di Serafino and S.~Filippone,
@@ -215,6 +225,11 @@ Karypis, G. and Kumar, V.,
 Minneapolis, MN 55455: University of Minnesota, Department of
   Computer Science, 1995. 
 Internet Address: {\verb|http://www.cs.umn.edu/~karypis|}.
+\bibitem{BLAS1}
+Lawson, C.,  Hanson, R., Kincaid, D. and Krogh, F.,
+   Basic {L}inear {A}lgebra {S}ubprograms for {F}ortran usage,
+{ACM Trans. Math. Softw.} vol.~{5}, 38--329, 1979.
+
 \bibitem{machiels}
 {Machiels, L. and Deville, M.}
 {\em Fortran 90: An entry to object-oriented programming for the solution