LinearPDE symbols/members

$\begin{memberdesc}[LinearPDE]{DEFAULT} default method, preconditioner or package... ...opriate method should be chosen by the used PDE solver library. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{SCSL} the SCSL library by SGI,~Reference~\cite{SCSL}\footnotemark \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{MKL} the MKL library by Intel,~Reference~\cite{MKL}\footnotemark . \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{UMFPACK} the UMFPACK,~Reference~\cite{UMFPACK}. Remark: UMFPACK is not parallelized. \end{memberdesc}$

$\begin{memberdesc} % latex2html id marker 5891 [LinearPDE]{PASO} the solver libr... ...dule{esys.finley}\xspace , see Section~\ref{CHAPTER ON FINLEY}. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{ITERATIVE} the default iterative method and precon... ...space\index{preconditioner!Jacobi}\index{Jacobi}preconditioner. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{DIRECT} the default direct linear solver. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{CHOLEVSKY} direct solver based on Cholevsky factor... ...Reference~\cite{Saad}. The solver will require a symmetric PDE. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{PCG} preconditioned conjugate gradient method, see... ...olver!PCG}\index{PCG}. The solver will require a symmetric PDE. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{TFQMR} transpose-free quasi-minimal residual metho... ...Reference~\cite{WEISS}\index{linear solver!TFQMR}\index{TFQMR}. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{GMRES} the GMRES method, see~Reference~\cite{WEISS... ...ers \var{truncation} and \var{restart} of \method{getSolution}. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{MINRES} minimal residual method method, \index{linear solver!MINRES}\index{MINRES} \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{LUMPING} uses lumping to solve the system of linea... ...s finer. Lumping does not use the linear system solver library. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{PRES20} the GMRES method with truncation after fiv... ...siduals and restart after 20 steps, see~Reference~\cite{WEISS}. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{CGS} conjugate gradient squared method, see~Reference~\cite{WEISS}. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{BICGSTAB} stabilized bi-conjugate gradients methods, see~Reference~\cite{WEISS}. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{SSOR} symmetric successive over-relaxation method,... ...oner but some linear solver libraries support this as a solver. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{ILU0} the incomplete LU factorization preconditioner with no fill-in, see~Reference~\cite{Saad}. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{ILUT} the incomplete LU factorization precondition... ...ar{drop_storage} are both set in the \method{getSolution} call. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{JACOBI} the Jacobi preconditioner, see~Reference~\cite{Saad}. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{AMG} the algebraic--multi grid method, see~Referen... ...solver method but is more robust when used in a preconditioner. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{GS} the symmetric Gauss-Seidel preconditioner, see~Reference~\cite{Saad}. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{RILU} recursive incomplete LU factorization precon... ...ar{drop_storage} are both set in the \method{getSolution} call. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{NO_REORDERING} no ordering is used during factorization. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{MINIMUM_FILL_IN} applies reordering before factori... ... advisable to apply reordering on the mesh to minimize fill-in. \end{memberdesc}$

$\begin{memberdesc}[LinearPDE]{NESTED_DISSECTION} applies reordering before facto... ... advisable to apply reordering on the mesh to minimize fill-in. \end{memberdesc}$

esys@esscc.uq.edu.au