|
| enum | { UpLo = _UpLo
} |
| |
| typedef _MatrixType | MatrixType |
| |
| typedef SimplicialCholeskyBase< SimplicialLLT > | Base |
| |
| typedef MatrixType::Scalar | Scalar |
| |
| typedef MatrixType::RealScalar | RealScalar |
| |
| typedef MatrixType::StorageIndex | StorageIndex |
| |
| typedef SparseMatrix< Scalar, ColMajor, Index > | CholMatrixType |
| |
| typedef Matrix< Scalar, Dynamic, 1 > | VectorType |
| |
| typedef internal::traits< SimplicialLLT > | Traits |
| |
| typedef Traits::MatrixL | MatrixL |
| |
| typedef Traits::MatrixU | MatrixU |
| |
| enum | |
| |
| enum | |
| |
| typedef internal::traits< SimplicialLLT< _MatrixType, _UpLo, _Ordering > >::MatrixType | MatrixType |
| |
| typedef internal::traits< SimplicialLLT< _MatrixType, _UpLo, _Ordering > >::OrderingType | OrderingType |
| |
| typedef MatrixType::Scalar | Scalar |
| |
| typedef MatrixType::RealScalar | RealScalar |
| |
| typedef MatrixType::StorageIndex | StorageIndex |
| |
| typedef SparseMatrix< Scalar, ColMajor, StorageIndex > | CholMatrixType |
| |
| typedef CholMatrixType const * | ConstCholMatrixPtr |
| |
| typedef Matrix< Scalar, Dynamic, 1 > | VectorType |
| |
| typedef Matrix< StorageIndex, Dynamic, 1 > | VectorI |
| |
|
| | SimplicialLLT () |
| |
| | SimplicialLLT (const MatrixType &matrix) |
| |
| const MatrixL | matrixL () const |
| |
| const MatrixU | matrixU () const |
| |
| SimplicialLLT & | compute (const MatrixType &matrix) |
| |
| void | analyzePattern (const MatrixType &a) |
| |
| void | factorize (const MatrixType &a) |
| |
| Scalar | determinant () const |
| |
| | SimplicialCholeskyBase () |
| |
| | SimplicialCholeskyBase (const MatrixType &matrix) |
| |
| | ~SimplicialCholeskyBase () |
| |
| SimplicialLLT< _MatrixType, _UpLo, _Ordering > & | derived () |
| |
| const SimplicialLLT< _MatrixType, _UpLo, _Ordering > & | derived () const |
| |
| SimplicialLLT< _MatrixType, _UpLo, _Ordering > & | derived () |
| |
| const SimplicialLLT< _MatrixType, _UpLo, _Ordering > & | derived () const |
| |
| Index | cols () const |
| |
| Index | rows () const |
| |
| ComputationInfo | info () const |
| | Reports whether previous computation was successful.
|
| |
| 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) |
| |
| void | dumpMemory (Stream &s) |
| |
| void | _solve_impl (const MatrixBase< Rhs > &b, MatrixBase< Dest > &dest) const |
| |
| void | _solve_impl (const SparseMatrixBase< Rhs > &b, SparseMatrixBase< Dest > &dest) const |
| |
| | SparseSolverBase () |
| |
| | ~SparseSolverBase () |
| |
| Derived & | derived () |
| |
| const Derived & | derived () const |
| |
| template<typename Rhs > |
| const Solve< Derived, Rhs > | solve (const MatrixBase< Rhs > &b) const |
| |
| template<typename Rhs > |
| const Solve< Derived, Rhs > | solve (const SparseMatrixBase< Rhs > &b) const |
| |
| template<typename Rhs , typename Dest > |
| void | _solve_impl (const SparseMatrixBase< Rhs > &b, SparseMatrixBase< Dest > &dest) const |
| |
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<> |
\implsparsesolverconcept
- See also
- class SimplicialLDLT, class AMDOrdering, class NaturalOrdering