A direct sparse LDLT Cholesky factorizations without square root. More...
#include <SimplicialCholesky.h>

| Public Types | |
| enum | { UpLo = _UpLo } | 
| typedef SimplicialCholeskyBase< SimplicialLDLT > | Base | 
| typedef SparseMatrix< Scalar, ColMajor, StorageIndex > | 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< SimplicialLDLT > | Traits | 
| typedef Matrix< Scalar, Dynamic, 1 > | VectorType | 
|  Public Types inherited from Eigen::SimplicialCholeskyBase< SimplicialLDLT< _MatrixType, _UpLo, _Ordering > > | |
| enum | |
| enum | |
| typedef SparseMatrix< Scalar, ColMajor, StorageIndex > | CholMatrixType | 
| typedef CholMatrixType const * | ConstCholMatrixPtr | 
| typedef internal::traits< SimplicialLDLT< _MatrixType, _UpLo, _Ordering > >::MatrixType | MatrixType | 
| typedef internal::traits< SimplicialLDLT< _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) | 
| SimplicialLDLT & | compute (const MatrixType &matrix) | 
| Scalar | determinant () const | 
| void | factorize (const MatrixType &a) | 
| const MatrixL | matrixL () const | 
| const MatrixU | matrixU () const | 
| SimplicialLDLT () | |
| SimplicialLDLT (const MatrixType &matrix) | |
| const VectorType | vectorD () const | 
|  Public Member Functions inherited from Eigen::SimplicialCholeskyBase< SimplicialLDLT< _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 | 
| SimplicialLDLT< _MatrixType, _UpLo, _Ordering > & | derived () | 
| const SimplicialLDLT< _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 | 
| SimplicialLDLT< _MatrixType, _UpLo, _Ordering > & | setShift (const RealScalar &offset, const RealScalar &scale=1) | 
| SimplicialCholeskyBase () | |
| SimplicialCholeskyBase (const MatrixType &matrix) | |
| ~SimplicialCholeskyBase () | |
|  Public Member Functions inherited from Eigen::SparseSolverBase< SimplicialLDLT< _MatrixType, _UpLo, _Ordering > > | |
| void | _solve_impl (const SparseMatrixBase< Rhs > &b, SparseMatrixBase< Dest > &dest) const | 
| SimplicialLDLT< _MatrixType, _UpLo, _Ordering > & | derived () | 
| const SimplicialLDLT< _MatrixType, _UpLo, _Ordering > & | derived () const | 
| const Solve< SimplicialLDLT< _MatrixType, _UpLo, _Ordering >, Rhs > | solve (const MatrixBase< Rhs > &b) const | 
| const Solve< SimplicialLDLT< _MatrixType, _UpLo, _Ordering >, Rhs > | solve (const SparseMatrixBase< Rhs > &b) const | 
| SparseSolverBase () | |
| ~SparseSolverBase () | |
A direct sparse LDLT Cholesky factorizations without square root.
This class provides a LDL^T Cholesky factorizations without square root 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 267 of file SimplicialCholesky.h.
| typedef SimplicialCholeskyBase<SimplicialLDLT> Eigen::SimplicialLDLT< _MatrixType, _UpLo, _Ordering >::Base | 
Definition at line 426 of file SimplicialCholesky.h.
| typedef SparseMatrix<Scalar,ColMajor,StorageIndex> Eigen::SimplicialLDLT< _MatrixType, _UpLo, _Ordering >::CholMatrixType | 
Definition at line 430 of file SimplicialCholesky.h.
| typedef Traits::MatrixL Eigen::SimplicialLDLT< _MatrixType, _UpLo, _Ordering >::MatrixL | 
Definition at line 433 of file SimplicialCholesky.h.
| typedef _MatrixType Eigen::SimplicialLDLT< _MatrixType, _UpLo, _Ordering >::MatrixType | 
Definition at line 424 of file SimplicialCholesky.h.
| typedef Traits::MatrixU Eigen::SimplicialLDLT< _MatrixType, _UpLo, _Ordering >::MatrixU | 
Definition at line 434 of file SimplicialCholesky.h.
| typedef MatrixType::RealScalar Eigen::SimplicialLDLT< _MatrixType, _UpLo, _Ordering >::RealScalar | 
Definition at line 428 of file SimplicialCholesky.h.
| typedef MatrixType::Scalar Eigen::SimplicialLDLT< _MatrixType, _UpLo, _Ordering >::Scalar | 
Definition at line 427 of file SimplicialCholesky.h.
| typedef MatrixType::StorageIndex Eigen::SimplicialLDLT< _MatrixType, _UpLo, _Ordering >::StorageIndex | 
Definition at line 429 of file SimplicialCholesky.h.
| typedef internal::traits<SimplicialLDLT> Eigen::SimplicialLDLT< _MatrixType, _UpLo, _Ordering >::Traits | 
Definition at line 432 of file SimplicialCholesky.h.
| typedef Matrix<Scalar,Dynamic,1> Eigen::SimplicialLDLT< _MatrixType, _UpLo, _Ordering >::VectorType | 
Definition at line 431 of file SimplicialCholesky.h.
| anonymous enum | 
| Enumerator | |
|---|---|
| UpLo | |
Definition at line 425 of file SimplicialCholesky.h.
| 
 | inline | 
Default constructor
Definition at line 437 of file SimplicialCholesky.h.
| 
 | inlineexplicit | 
Constructs and performs the LLT factorization of matrix
Definition at line 440 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 473 of file SimplicialCholesky.h.
| 
 | inline | 
Computes the sparse Cholesky decomposition of matrix
Definition at line 461 of file SimplicialCholesky.h.
| 
 | inline | 
Definition at line 490 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 484 of file SimplicialCholesky.h.
| 
 | inline | 
Definition at line 449 of file SimplicialCholesky.h.
| 
 | inline | 
Definition at line 455 of file SimplicialCholesky.h.
| 
 | inline | 
Definition at line 444 of file SimplicialCholesky.h.