#include <Eigen/src/SparseCholesky/SimplicialCholesky.h>
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<> |
This class follows the sparse solver concept .
Inheritance diagram for Eigen::SimplicialLLT< MatrixType_, UpLo_, Ordering_ >: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_ > > | |
| 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 DiagonalScalar &offset, const DiagonalScalar &scale=1) |
| SimplicialCholeskyBase () | |
Public Member Functions inherited from Eigen::SparseSolverBase< Derived > | |
| 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 |
| SparseSolverBase () | |
Additional Inherited Members | |
Protected Member Functions inherited from Eigen::SimplicialCholeskyBase< SimplicialLLT< MatrixType_, UpLo_, Ordering_ > > | |
| void | compute (const MatrixType &matrix) |
|
inline |
Default constructor
|
inlineexplicit |
Constructs and performs the LLT factorization of matrix
|
inline |
Performs a symbolic decomposition on the sparsity of matrix.
This function is particularly useful when solving for several problems having the same structure.
|
inline |
Computes the sparse Cholesky decomposition of matrix
|
inline |
|
inline |
Performs a numeric decomposition of matrix
The given matrix must have the same sparsity than the matrix on which the symbolic decomposition has been performed.
|
inline |
|
inline |