\doxysection{gko::\+factorization Namespace Reference}
\hypertarget{namespacegko_1_1factorization}{}\label{namespacegko_1_1factorization}\index{gko::factorization@{gko::factorization}}


The Factorization namespace.  


\doxysubsubsection*{Classes}
\begin{DoxyCompactItemize}
\item 
class \doxymbox{\hyperlink{classgko_1_1factorization_1_1Ic}{Ic}}
\begin{DoxyCompactList}\small\item\em Represents an incomplete Cholesky factorization (IC(0)) of a sparse matrix. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1factorization_1_1Ilu}{Ilu}}
\begin{DoxyCompactList}\small\item\em Represents an incomplete LU factorization -- ILU(0) -- of a sparse matrix. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1factorization_1_1ParIc}{Par\+Ic}}
\begin{DoxyCompactList}\small\item\em Par\+IC is an incomplete Cholesky factorization which is computed in parallel. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1factorization_1_1ParIct}{Par\+Ict}}
\begin{DoxyCompactList}\small\item\em Par\+ICT is an incomplete threshold-\/based Cholesky factorization which is computed in parallel. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1factorization_1_1ParIlu}{Par\+Ilu}}
\begin{DoxyCompactList}\small\item\em Par\+ILU is an incomplete LU factorization which is computed in parallel. \end{DoxyCompactList}\item 
class \doxymbox{\hyperlink{classgko_1_1factorization_1_1ParIlut}{Par\+Ilut}}
\begin{DoxyCompactList}\small\item\em Par\+ILUT is an incomplete threshold-\/based LU factorization which is computed in parallel. \end{DoxyCompactList}\end{DoxyCompactItemize}
\doxysubsubsection*{Enumerations}
\begin{DoxyCompactItemize}
\item 
enum class \doxymbox{\hyperlink{namespacegko_1_1factorization_a42430a5d93539c24303273804684ef67}{incomplete\+\_\+algorithm}} \{ {\bfseries sparselib}
, {\bfseries syncfree}
 \}
\begin{DoxyCompactList}\small\item\em An enum class for algorithm selection in the incomplete factorization. \end{DoxyCompactList}\end{DoxyCompactItemize}


\doxysubsection{Detailed Description}
The Factorization namespace. 

\label{doc-enum-members}
\Hypertarget{namespacegko_1_1factorization_doc-enum-members}
\doxysubsection{Enumeration Type Documentation}
\Hypertarget{namespacegko_1_1factorization_a42430a5d93539c24303273804684ef67}\index{gko::factorization@{gko::factorization}!incomplete\_algorithm@{incomplete\_algorithm}}
\index{incomplete\_algorithm@{incomplete\_algorithm}!gko::factorization@{gko::factorization}}
\doxysubsubsection{\texorpdfstring{incomplete\_algorithm}{incomplete\_algorithm}}
{\footnotesize\ttfamily \label{namespacegko_1_1factorization_a42430a5d93539c24303273804684ef67} 
enum class \doxymbox{\hyperlink{namespacegko_1_1factorization_a42430a5d93539c24303273804684ef67}{gko::\+factorization::\+incomplete\+\_\+algorithm}}\hspace{0.3cm}{\ttfamily [strong]}}



An enum class for algorithm selection in the incomplete factorization. 

{\ttfamily sparselib} is only available for CUDA, HIP, and reference. {\ttfamily syncfree} is Ginkgo\textquotesingle{}s implementation by using the Lu/\+\+Cholesky factorization components with given sparsity. 