template<typename MatrixType_, int UpLo_ = Lower>
class Eigen::CholmodSimplicialLLT< MatrixType_, UpLo_ >
A simplicial direct Cholesky (LLT) factorization and solver based on Cholmod.
This class allows to solve for A.X = B sparse linear problems via a simplicial LL^T Cholesky factorization using the Cholmod library. This simplicial variant is equivalent to Eigen's built-in SimplicialLLT class. Therefore, it has little practical interest. The sparse matrix A must be selfadjoint and positive definite. The vectors or matrices X and B can be either dense or sparse.
- 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 follows the sparse solver concept .
This class supports all kind of SparseMatrix<>: row or column major; upper, lower, or both; compressed or non compressed.
- Warning
- Only double precision real and complex scalar types are supported by Cholmod.
- See also
- Sparse solver concept, class CholmodSupernodalLLT, class SimplicialLLT
1.15.0 