Doc fixes

This commit is contained in:
Salvatore Filippone
2024-11-16 16:20:55 +01:00
parent 9c4f4c4d15
commit 7187575915
28 changed files with 3435 additions and 3184 deletions
+13 -1
View File
@@ -8,6 +8,11 @@ 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{BERTACCINIFILIPPONE}
D. Bertaccini\ and\ S. Filippone,
{\em Sparse approximate inverse preconditioners on high performance GPU platforms},
Comput. Math. Appl., 71, (2016), no.~3, 693--711.
%
\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,
@@ -183,7 +188,14 @@ MIT Press, 1998.
{\em Scientific Programming\/}~{\em 22,\/}~1, 1--19.
\bibitem{OurTechRep}
D.~Barbieri, V.~Cardellini, A.~Fanfarillo, S.~Filippone, Three storage formats
for sparse matrices on {GPGPUs}, Tech. Rep. DICII RR-15.6, Universit\`a di
for sparse matrices on {GPGPUs}, Tech. Rep. DICII RR-15.6,
Universit\`a di
Roma Tor Vergata (February 2015).
\bibitem{Filippone:2017:SMM:3034774.3017994}
S.~Filippone, V.~Cardellini, D.~Barbieri, and A.~Fanfarillo.
Sparse matrix-vector multiplication on {GPGPUs}.
{\em ACM Trans. Math. Softw.}, 43(4):30:1--30:49, 2017.
\end{thebibliography}
+1 -1
View File
@@ -1,6 +1,6 @@
\section{Error handling}
\section{Error handling\label{sec:errors}}
The PSBLAS library error handling policy has been completely rewritten
in version 2.0. The idea behind the design of this new error handling
+42 -27
View File
@@ -76,11 +76,10 @@ $ptype$ string as follows\footnote{The string is case-insensitive}:
\item[DIAG] Diagonal scaling; each entry of the input vector is
multiplied by the reciprocal of the sum of the absolute values of
the coefficients in the corresponding row of matrix $A$;
\item[BJAC] Precondition by a factorization of the
block-diagonal of matrix $A$, where block boundaries are determined
by the data allocation boundaries for each process; requires no
communication. Only the incomplete factorization $ILU(0)$ is
currently implemented.
\item[BJAC] Precondition by a factorization or an approximante inverse
of the block-diagonal of matrix $A$, where block boundaries are
determined by the data allocation boundaries for each process;
requires no communication. See also Table-\ref{tab:p_subsolve_1}.
\end{description}
@@ -105,13 +104,13 @@ contained in \fortinline|val|.
\fortinline|what| & \fortinline|character(len=*)|. \\
& The parameter to be set. It can be specified through its name;
the string is case-insensitive. See
Tables~\ref{tab:p_cycle}-\ref{tab:p_smoother_1}.\\
Table~\ref{tab:p_subsolve_1}.\\
\fortinline|val | & \fortinline|integer| \emph{or} \fortinline|character(len=*)| \emph{or}
\fortinline|real(psb_spk_)| \emph{or} \fortinline|real(psb_dpk_)|,
\fortinline|intent(in)|.\\
& The value of the parameter to be set. The list of allowed
values and the corresponding data types is given in
Tables~\ref{tab:p_cycle}-\ref{tab:p_smoother_1}.
Table~\ref{tab:p_subsolve_1}.
When the value is of type \fortinline|character(len=*)|,
it is also treated as case insensitive.\\
\fortinline|info| & \fortinline|integer, intent(out)|.\\
@@ -123,13 +122,14 @@ contained in \fortinline|val|.
\noindent
A number of subdomain solvers can be chosen with this method;
a list of the parameters that can be set, along with their allowed and
default values, is given in Tables~\ref{tab:p_cycle}-\ref{tab:p_smoother_1}.\\
default values, is given in Table-\ref{tab:p_subsolve_1}.\\
\bsideways
\begin{center}
\small
\begin{tabular}{|p{3.6cm}|l|p{1.9cm}|p{3.6cm}|p{6.5cm}|}
% \begin{tabular}{|p{3.6cm}|l|p{1.9cm}|p{3.6cm}|p{6.5cm}|}
\begin{tabular}{|p{3.2cm}|l|p{2.6cm}|p{2.6cm}|p{6.7cm}|}
\hline
\fortinline|what| & \textsc{data type} & \fortinline|val| & \textsc{default} &
\textsc{comments} \\ \hline
@@ -148,20 +148,6 @@ default values, is given in Tables~\ref{tab:p_cycle}-\ref{tab:p_smoother_1}.\\
do not employ triangular system solve
kernels,
see~\cite{BERTACCINIFILIPPONE}.\\ \hline
\hline
\end{tabular}
\end{center}
\caption{Parameters defining the solver or the details of the one-level preconditioner.
\label{tab:p_smoother}}
\esideways
\bsideways
\begin{center}
\small
\begin{tabular}{|p{3.2cm}|l|p{2.6cm}|p{2.6cm}|p{6.7cm}|}
\hline
\fortinline|what| & \textsc{data type} & \fortinline|val| & \textsc{default} &
\textsc{comments} \\ \hline
\fortinline|'SUB_FILLIN'| & \fortinline|integer|
& Any integer \par number~$\ge 0$
& 0
@@ -170,12 +156,41 @@ default values, is given in Tables~\ref{tab:p_cycle}-\ref{tab:p_smoother_1}.\\
& Any real number~$\ge 0$
& 0
& Drop tolerance $t$ in the ILU($p,t$) factorization. \\ \hline
\hline
\fortinline|'ILU_ALG'| & \fortinline|character(len=*)|
& \fortinline|'MILU'|
& \fortinline|'NONE'|
& ILU algorithmic variant \\ \hline
\fortinline|'ILUT_SCALE'| & \fortinline|character(len=*)|
& \fortinline|'MAXVAL'| \par
\fortinline|'DIAG'| \par
\fortinline|'ARSWUM'| \par
\fortinline|'ARCSUM'| \par
\fortinline|'ACLSUM'| \par
\fortinline|'NONE'|
& \fortinline|'NONE'|
& ILU scaling strategy \\ \hline
\fortinline|'INV_FILLIN'| & \fortinline|integer|
& Any integer \par number~$\ge 0$
& 0
& Second fill-in level $q$ of the INVK($p,q$)
approximate inverse. \\ \hline
\fortinline|'INV_ILUTHRS'| & \fortinline|real(kind_parameter)|
& Any real number~$\ge 0$
& 0
& Second drop tolerance $s$ in the
INVT($t,s$) approximate inverse. \\ \hline
\fortinline|'AINV_ALG'| & \fortinline|character(len=*)|
& \fortinline|'LLK'| \par
\fortinline|'SYM-LLK'| \par
\fortinline|'STAB-LLK'| \par
\fortinline|'MLK,LMX'|
& \fortinline|'LLK'|
& AINV algorithmic strategy. \\ \hline
\end{tabular}
\end{center}
\caption{Parameters defining the smoother or the details of the one-level preconditioner
(continued).\label{tab:p_smoother_1}}
\esideways
\caption{Parameters defining the solver of the BJAC
preconditioner.\label{tab:p_subsolve_1}}
\esideways
+1 -1
View File
@@ -93,7 +93,7 @@
\newcommand{\example}{\stepcounter{example}%
\section*{\examplename~\theexample}}
\newcommand{\precdata}{\hyperlink{precdata}{{\tt psb\_prec\_type}}}
\newcommand{\precdata}{\hyperlink{precdata}{{\tt psb\_Tprec\_type}}}
\newcommand{\descdata}{\hyperlink{descdata}{{\tt psb\_desc\_type}}}
\newcommand{\spdata}{\hyperlink{spdata}{{\tt psb\_Tspmat\_type}}}
\newcommand{\vdata}{\hyperlink{vdata}{{\tt psb\_T\_vect\_type}}}
+1 -1
View File
@@ -84,7 +84,7 @@
\newcommand{\example}{\stepcounter{example}%
\section*{\examplename~\theexample}}
\newcommand{\precdata}{\hyperlink{precdata}{{\tt psb\_prec\_type}}}
\newcommand{\precdata}{\hyperlink{precdata}{{\tt psb\_Tprec\_type}}}
\newcommand{\descdata}{\hyperlink{descdata}{{\tt psb\_desc\_type}}}
\newcommand{\spdata}{\hyperlink{spdata}{{\tt psb\_Tspmat\_type}}}
\newcommand{\vdata}{\hyperlink{vdata}{{\tt psb\_T\_vect\_type}}}