\doxysubsection{Solvers }
\hypertarget{group__solvers}{}\label{group__solvers}\index{Solvers@{Solvers}}


A module dedicated to the implementation and usage of the Solvers in Ginkgo.  


Collaboration diagram for Solvers:\+
\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=350pt]{group__solvers}
\end{center}
\end{figure}
\doxysubsubsubsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
namespace \doxymbox{\hyperlink{namespacegko_1_1solver}{gko::\+solver}}
\begin{DoxyCompactList}\small\item\em The ginkgo Solve namespace. \end{DoxyCompactList}\end{DoxyCompactItemize}
\doxysubsubsubsection*{Classes}
\begin{DoxyCompactItemize}
\item 
class \doxymbox{\hyperlink{classgko_1_1batch_1_1solver_1_1Bicgstab}{gko::\+batch::\+solver::\+\+Bicgstab$<$ Value\+Type $>$}}
\begin{DoxyCompactList}\small\item\em Bi\+CGSTAB or the Bi-\/\+Conjugate Gradient-\/\+Stabilized is a Krylov subspace solver. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1batch_1_1solver_1_1Cg}{gko::\+batch::\+solver::\+\+Cg$<$ Value\+Type $>$}}
\begin{DoxyCompactList}\small\item\em \doxylink{classgko_1_1batch_1_1solver_1_1Cg}{Cg} or the Conjugate Gradient is a Krylov subspace solver. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1batch_1_1solver_1_1BatchSolver}{gko::\+batch::\+solver::\+\+Batch\+Solver}}
\begin{DoxyCompactList}\small\item\em The \doxylink{classgko_1_1batch_1_1solver_1_1BatchSolver}{Batch\+Solver} is a base class for all batched solvers and provides the common getters and setter for these batched solver classes. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1solver_1_1Bicg}{gko::\+solver::\+\+Bicg$<$ Value\+Type $>$}}
\begin{DoxyCompactList}\small\item\em BICG or the Biconjugate gradient method is a Krylov subspace solver. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1solver_1_1Bicgstab}{gko::\+solver::\+\+Bicgstab$<$ Value\+Type $>$}}
\begin{DoxyCompactList}\small\item\em Bi\+CGSTAB or the Bi-\/\+Conjugate Gradient-\/\+Stabilized is a Krylov subspace solver. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1solver_1_1CbGmres}{gko::\+solver::\+\+Cb\+Gmres$<$ Value\+Type $>$}}
\begin{DoxyCompactList}\small\item\em CB-\/\+GMRES or the compressed basis generalized minimal residual method is an iterative type Krylov subspace method which is suitable for nonsymmetric linear systems. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1solver_1_1Cg}{gko::\+solver::\+\+Cg$<$ Value\+Type $>$}}
\begin{DoxyCompactList}\small\item\em CG or the conjugate gradient method is an iterative type Krylov subspace method which is suitable for symmetric positive definite methods. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1solver_1_1Cgs}{gko::\+solver::\+\+Cgs$<$ Value\+Type $>$}}
\begin{DoxyCompactList}\small\item\em CGS or the conjugate gradient square method is an iterative type Krylov subspace method which is suitable for general systems. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1solver_1_1Chebyshev}{gko::\+solver::\+\+Chebyshev$<$ Value\+Type $>$}}
\begin{DoxyCompactList}\small\item\em \doxylink{classgko_1_1solver_1_1Chebyshev}{Chebyshev} iteration is an iterative method for solving nonsymmetric problems based on some knowledge of the spectrum of the (preconditioned) system matrix. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1solver_1_1Fcg}{gko::\+solver::\+\+Fcg$<$ Value\+Type $>$}}
\begin{DoxyCompactList}\small\item\em FCG or the flexible conjugate gradient method is an iterative type Krylov subspace method which is suitable for symmetric positive definite methods. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1solver_1_1Gcr}{gko::\+solver::\+\+Gcr$<$ Value\+Type $>$}}
\begin{DoxyCompactList}\small\item\em GCR or the generalized conjugate residual method is an iterative type Krylov subspace method similar to GMRES which is suitable for nonsymmetric linear systems. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1solver_1_1Gmres}{gko::\+solver::\+\+Gmres$<$ Value\+Type $>$}}
\begin{DoxyCompactList}\small\item\em GMRES or the generalized minimal residual method is an iterative type Krylov subspace method which is suitable for nonsymmetric linear systems. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1solver_1_1Idr}{gko::\+solver::\+\+Idr$<$ Value\+Type $>$}}
\begin{DoxyCompactList}\small\item\em IDR(s) is an efficient method for solving large nonsymmetric systems of linear equations. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1solver_1_1Minres}{gko::\+solver::\+\+Minres$<$ Value\+Type $>$}}
\begin{DoxyCompactList}\small\item\em \doxylink{classgko_1_1solver_1_1Minres}{Minres} is an iterative type Krylov subspace method, which is suitable for indefinite and full-\/rank symmetric/\+hermitian operators. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1solver_1_1Multigrid}{gko::\+solver::\+\+Multigrid}}
\begin{DoxyCompactList}\small\item\em \doxylink{classgko_1_1solver_1_1Multigrid}{Multigrid} methods have a hierarchy of many levels, whose corase level is a subset of the fine level, of the problem. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1solver_1_1PipeCg}{gko::\+solver::\+\+Pipe\+Cg$<$ Value\+Type $>$}}
\begin{DoxyCompactList}\small\item\em PIPE\+\_\+\+CG or the pipelined conjugate gradient method is an iterative type Krylov subspace method which is suitable for symmetric positive definite methods. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1solver_1_1LowerTrs}{gko::\+solver::\+\+Lower\+Trs$<$ Value\+Type, Index\+Type $>$}}
\begin{DoxyCompactList}\small\item\em \doxylink{classgko_1_1solver_1_1LowerTrs}{Lower\+Trs} is the triangular solver which solves the system L x = b, when L is a lower triangular matrix. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1solver_1_1UpperTrs}{gko::\+solver::\+\+Upper\+Trs$<$ Value\+Type, Index\+Type $>$}}
\begin{DoxyCompactList}\small\item\em \doxylink{classgko_1_1solver_1_1UpperTrs}{Upper\+Trs} is the triangular solver which solves the system U x = b, when U is an upper triangular matrix. \end{DoxyCompactList}\end{DoxyCompactItemize}


\doxysubsubsection{Detailed Description}
A module dedicated to the implementation and usage of the Solvers in Ginkgo. 

