The Factorization namespace. More...
Classes | |
| class | Ic |
| Represents an incomplete Cholesky factorization (IC(0)) of a sparse matrix. More... | |
| class | Ilu |
| Represents an incomplete LU factorization – ILU(0) – of a sparse matrix. More... | |
| class | ParIc |
| ParIC is an incomplete Cholesky factorization which is computed in parallel. More... | |
| class | ParIct |
| ParICT is an incomplete threshold-based Cholesky factorization which is computed in parallel. More... | |
| class | ParIlu |
| ParILU is an incomplete LU factorization which is computed in parallel. More... | |
| class | ParIlut |
| ParILUT is an incomplete threshold-based LU factorization which is computed in parallel. More... | |
Enumerations | |
| enum class | incomplete_algorithm { sparselib , syncfree } |
| An enum class for algorithm selection in the incomplete factorization. More... | |
The Factorization namespace.
|
strong |
An enum class for algorithm selection in the incomplete factorization.
sparselib is only available for CUDA, HIP, and reference. syncfree is Ginkgo's implementation by using the Lu/Cholesky factorization components with given sparsity.