|
| enum | { UpLo = _UpLo
} |
| |
|
typedef _MatrixType | MatrixType |
| |
|
typedef SimplicialCholeskyBase< SimplicialLDLT > | Base |
| |
|
typedef MatrixType::Scalar | Scalar |
| |
|
typedef MatrixType::RealScalar | RealScalar |
| |
|
typedef MatrixType::StorageIndex | StorageIndex |
| |
|
typedef SparseMatrix< Scalar, ColMajor, StorageIndex > | CholMatrixType |
| |
|
typedef Matrix< Scalar, Dynamic, 1 > | VectorType |
| |
|
typedef internal::traits< SimplicialLDLT > | Traits |
| |
|
typedef Traits::MatrixL | MatrixL |
| |
|
typedef Traits::MatrixU | MatrixU |
| |
| enum | |
| |
| enum | |
| |
|
typedef internal::traits< SimplicialLDLT< _MatrixType, _UpLo, _Ordering > >::MatrixType | MatrixType |
| |
|
typedef internal::traits< SimplicialLDLT< _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 |
| |
|
|
| SimplicialLDLT () |
| | Default constructor.
|
| |
|
| SimplicialLDLT (const MatrixType &matrix) |
| | Constructs and performs the LLT factorization of matrix.
|
| |
| const VectorType | vectorD () const |
| |
| const MatrixL | matrixL () const |
| |
| const MatrixU | matrixU () const |
| |
|
SimplicialLDLT & | compute (const MatrixType &matrix) |
| | Computes the sparse Cholesky decomposition of matrix.
|
| |
| void | analyzePattern (const MatrixType &a) |
| | Performs a symbolic decomposition on the sparcity of matrix.
|
| |
| void | factorize (const MatrixType &a) |
| | Performs a numeric decomposition of matrix.
|
| |
| Scalar | determinant () const |
| |
|
| SimplicialCholeskyBase () |
| | Default constructor.
|
| |
|
| SimplicialCholeskyBase (const MatrixType &matrix) |
| |
|
SimplicialLDLT< _MatrixType, _UpLo, _Ordering > & | derived () |
| |
|
const SimplicialLDLT< _MatrixType, _UpLo, _Ordering > & | derived () const |
| |
|
SimplicialLDLT< _MatrixType, _UpLo, _Ordering > & | derived () |
| |
|
const SimplicialLDLT< _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 |
| |
| SimplicialLDLT< _MatrixType, _UpLo, _Ordering > & | setShift (const RealScalar &offset, const RealScalar &scale=1) |
| | Sets the shift parameters that will be used to adjust the diagonal coefficients during the numerical factorization.
|
| |
|
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 () |
| | Default constructor.
|
| |
|
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 |
| |
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.
- 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 SimplicialLLT, class AMDOrdering, class NaturalOrdering