Public Member Functions |
void | analyzePattern (const MatrixType &matrix) |
cholmod_common & | cholmod () |
| CholmodDecomposition (const MatrixType &matrix) |
Index | cols () const |
void | compute (const MatrixType &matrix) |
template<typename Stream > |
void | dumpMemory (Stream &s) |
void | factorize (const MatrixType &matrix) |
ComputationInfo | info () const |
| Reports whether previous computation was successful.
|
Index | rows () const |
void | setMode (CholmodMode mode) |
template<typename Rhs > |
const internal::solve_retval
< CholmodDecomposition, Rhs > | solve (const MatrixBase< Rhs > &b) const |
template<typename Rhs > |
const
internal::sparse_solve_retval
< CholmodDecomposition, Rhs > | solve (const SparseMatrixBase< Rhs > &b) const |
template<typename _MatrixType, int _UpLo = Lower>
class Eigen::CholmodDecomposition< _MatrixType, _UpLo >
A Cholesky factorization and solver based on Cholmod.
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 selfajoint 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. |