A direct sparse LLT Cholesky factorizations. More...
#include <SimplicialCholesky.h>

Public Types | |
| enum | { UpLo = _UpLo } |
| typedef SimplicialCholeskyBase< SimplicialLLT > | Base |
| typedef SparseMatrix< Scalar, ColMajor, Index > | CholMatrixType |
| typedef Traits::MatrixL | MatrixL |
| typedef _MatrixType | MatrixType |
| typedef Traits::MatrixU | MatrixU |
| typedef MatrixType::RealScalar | RealScalar |
| typedef MatrixType::Scalar | Scalar |
| typedef MatrixType::StorageIndex | StorageIndex |
| typedef internal::traits< SimplicialLLT > | Traits |
| typedef Matrix< Scalar, Dynamic, 1 > | VectorType |
Public Types inherited from Eigen::SimplicialCholeskyBase< SimplicialLLT< _MatrixType, _UpLo, _Ordering > > | |
| enum | |
| enum | |
| typedef SparseMatrix< Scalar, ColMajor, StorageIndex > | CholMatrixType |
| typedef CholMatrixType const * | ConstCholMatrixPtr |
| typedef internal::traits< SimplicialLLT< _MatrixType, _UpLo, _Ordering > >::MatrixType | MatrixType |
| typedef internal::traits< SimplicialLLT< _MatrixType, _UpLo, _Ordering > >::OrderingType | OrderingType |
| typedef MatrixType::RealScalar | RealScalar |
| typedef MatrixType::Scalar | Scalar |
| typedef MatrixType::StorageIndex | StorageIndex |
| typedef Matrix< StorageIndex, Dynamic, 1 > | VectorI |
| typedef Matrix< Scalar, Dynamic, 1 > | VectorType |
Public Member Functions | |
| 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) | |
Public Member Functions inherited from Eigen::SimplicialCholeskyBase< SimplicialLLT< _MatrixType, _UpLo, _Ordering > > | |
| void | _solve_impl (const MatrixBase< Rhs > &b, MatrixBase< Dest > &dest) const |
| void | _solve_impl (const SparseMatrixBase< Rhs > &b, SparseMatrixBase< Dest > &dest) const |
| Index | cols () const |
| SimplicialLLT< _MatrixType, _UpLo, _Ordering > & | derived () |
| const SimplicialLLT< _MatrixType, _UpLo, _Ordering > & | derived () const |
| void | dumpMemory (Stream &s) |
| ComputationInfo | info () const |
| Reports whether previous computation was successful. More... | |
| const PermutationMatrix< Dynamic, Dynamic, StorageIndex > & | permutationP () const |
| const PermutationMatrix< Dynamic, Dynamic, StorageIndex > & | permutationPinv () const |
| Index | rows () const |
| SimplicialLLT< _MatrixType, _UpLo, _Ordering > & | setShift (const RealScalar &offset, const RealScalar &scale=1) |
| SimplicialCholeskyBase () | |
| SimplicialCholeskyBase (const MatrixType &matrix) | |
| ~SimplicialCholeskyBase () | |
Public Member Functions inherited from Eigen::SparseSolverBase< SimplicialLLT< _MatrixType, _UpLo, _Ordering > > | |
| void | _solve_impl (const SparseMatrixBase< Rhs > &b, SparseMatrixBase< Dest > &dest) const |
| SimplicialLLT< _MatrixType, _UpLo, _Ordering > & | derived () |
| const SimplicialLLT< _MatrixType, _UpLo, _Ordering > & | derived () const |
| 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 () | |
| ~SparseSolverBase () | |
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.
| _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<> |
Definition at line 266 of file SimplicialCholesky.h.
| typedef SimplicialCholeskyBase<SimplicialLLT> Eigen::SimplicialLLT< _MatrixType, _UpLo, _Ordering >::Base |
Definition at line 335 of file SimplicialCholesky.h.
| typedef SparseMatrix<Scalar,ColMajor,Index> Eigen::SimplicialLLT< _MatrixType, _UpLo, _Ordering >::CholMatrixType |
Definition at line 339 of file SimplicialCholesky.h.
| typedef Traits::MatrixL Eigen::SimplicialLLT< _MatrixType, _UpLo, _Ordering >::MatrixL |
Definition at line 342 of file SimplicialCholesky.h.
| typedef _MatrixType Eigen::SimplicialLLT< _MatrixType, _UpLo, _Ordering >::MatrixType |
Definition at line 333 of file SimplicialCholesky.h.
| typedef Traits::MatrixU Eigen::SimplicialLLT< _MatrixType, _UpLo, _Ordering >::MatrixU |
Definition at line 343 of file SimplicialCholesky.h.
| typedef MatrixType::RealScalar Eigen::SimplicialLLT< _MatrixType, _UpLo, _Ordering >::RealScalar |
Definition at line 337 of file SimplicialCholesky.h.
| typedef MatrixType::Scalar Eigen::SimplicialLLT< _MatrixType, _UpLo, _Ordering >::Scalar |
Definition at line 336 of file SimplicialCholesky.h.
| typedef MatrixType::StorageIndex Eigen::SimplicialLLT< _MatrixType, _UpLo, _Ordering >::StorageIndex |
Definition at line 338 of file SimplicialCholesky.h.
| typedef internal::traits<SimplicialLLT> Eigen::SimplicialLLT< _MatrixType, _UpLo, _Ordering >::Traits |
Definition at line 341 of file SimplicialCholesky.h.
| typedef Matrix<Scalar,Dynamic,1> Eigen::SimplicialLLT< _MatrixType, _UpLo, _Ordering >::VectorType |
Definition at line 340 of file SimplicialCholesky.h.
| anonymous enum |
| Enumerator | |
|---|---|
| UpLo | |
Definition at line 334 of file SimplicialCholesky.h.
|
inline |
Default constructor
Definition at line 346 of file SimplicialCholesky.h.
|
inlineexplicit |
Constructs and performs the LLT factorization of matrix
Definition at line 348 of file SimplicialCholesky.h.
|
inline |
Performs a symbolic decomposition on the sparcity of matrix.
This function is particularly useful when solving for several problems having the same structure.
Definition at line 376 of file SimplicialCholesky.h.
|
inline |
Computes the sparse Cholesky decomposition of matrix
Definition at line 364 of file SimplicialCholesky.h.
|
inline |
Definition at line 393 of file SimplicialCholesky.h.
|
inline |
Performs a numeric decomposition of matrix
The given matrix must has the same sparcity than the matrix on which the symbolic decomposition has been performed.
Definition at line 387 of file SimplicialCholesky.h.
|
inline |
Definition at line 352 of file SimplicialCholesky.h.
|
inline |
Definition at line 358 of file SimplicialCholesky.h.