template<typename MatrixType_, int UpLo_, typename Ordering_>
class Eigen::SimplicialLLT< MatrixType_, UpLo_, Ordering_ >
A direct sparse LLT Cholesky factorizations.
This class provides a LL^T Cholesky factorizations of sparse matrices that are selfadjoint and positive definite. The factorization allows for solving A.X = B where X and B can be either dense or sparse.
In order to reduce the fill-in, a symmetric permutation P is applied prior to the factorization such that the factorized matrix is P A P^-1.
- 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. |
Ordering_ | The ordering method to use, either AMDOrdering<> or NaturalOrdering<>. Default is AMDOrdering<> |
This class follows the sparse solver concept .
- See also
- class SimplicialLDLT, class AMDOrdering, class NaturalOrdering
|
void | analyzePattern (const MatrixType &a) |
|
SimplicialLLT & | compute (const MatrixType &matrix) |
|
Scalar | determinant () const |
|
void | factorize (const MatrixType &a) |
|
const MatrixL | matrixL () const |
|
const MatrixU | matrixU () const |
|
| SimplicialLLT () |
|
| SimplicialLLT (const MatrixType &matrix) |
|
ComputationInfo | info () const |
| Reports whether previous computation was successful. More...
|
|
const PermutationMatrix< Dynamic, Dynamic, StorageIndex > & | permutationP () const |
|
const PermutationMatrix< Dynamic, Dynamic, StorageIndex > & | permutationPinv () const |
|
SimplicialLLT< MatrixType_, UpLo_, Ordering_ > & | setShift (const RealScalar &offset, const RealScalar &scale=1) |
|
| SimplicialCholeskyBase () |
|
const Solve< SimplicialLLT< MatrixType_, UpLo_, Ordering_ >, Rhs > | solve (const MatrixBase< Rhs > &b) const |
|
const Solve< SimplicialLLT< MatrixType_, UpLo_, Ordering_ >, Rhs > | solve (const SparseMatrixBase< Rhs > &b) const |
|
| SparseSolverBase () |
|