![]() |
Eigen
3.4.90 (git rev 5a9f66fb35d03a4da9ef8976e67a61b30aa16dcf)
|
A general 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 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.
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.
Additional Inherited Members | |
![]() | |
void | analyzePattern (const MatrixType &matrix) |
cholmod_common & | cholmod () |
CholmodDecomposition< MatrixType_, Lower > & | compute (const MatrixType &matrix) |
Scalar | determinant () const |
void | factorize (const MatrixType &matrix) |
ComputationInfo | info () const |
Reports whether previous computation was successful. | |
Scalar | logDeterminant () const |
CholmodDecomposition< MatrixType_, Lower > & | setShift (const RealScalar &offset) |
![]() | |
const Solve< CholmodDecomposition< MatrixType_, Lower >, Rhs > | solve (const MatrixBase< Rhs > &b) const |
const Solve< CholmodDecomposition< MatrixType_, Lower >, Rhs > | solve (const SparseMatrixBase< Rhs > &b) const |
SparseSolverBase () | |