![]() |
Eigen
3.3.9
|
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 .
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) | |
|
inline |
Default constructor
|
inlineexplicit |
Constructs and performs the LLT factorization of matrix
|
inline |
Performs a symbolic decomposition on the sparcity 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 has the same sparcity than the matrix on which the symbolic decomposition has been performed.
|
inline |
|
inline |