template<typename _MatrixType, int _UpLo = Lower>
CholmodDecomposition class
A general Cholesky factorization and solver based on Cholmod.
| Template parameters | |
|---|---|
| _MatrixType | the type of the sparse matrix A, it must be a SparseMatrix<> |
| _UpLo | the triangular part that will be used for the computations. It can be Lower or Upper. Default is Lower. |
This class allows to solve for A.X = B sparse linear problems via a LL^T or LDL^T Cholesky factorization using the Cholmod library. The sparse matrix A must be selfadjoint and positive definite. The vectors or matrices X and B can be either dense or sparse.
This variant permits to change the underlying Cholesky method at runtime. On the other hand, it does not provide access to the result of the factorization. The default is to let Cholmod automatically choose between a simplicial and supernodal factorization.
This class follows the sparse solver concept.
This class supports all kind of SparseMatrix<>: row or column major; upper, lower, or both; compressed or non compressed.
Base classes
-
template<typename _MatrixType, int _UpLo, typename Derived>class CholmodBase
- The base class for the direct Cholesky factorization of Cholmod.