template<typename _MatrixType, int _UpLo>
PastixLLT class
A sparse direct supernodal Cholesky (LLT) factorization and solver based on the PaStiX library.
Contents
- Reference
This class is used to solve the linear systems A.X = B via a LL^T supernodal Cholesky factorization available in the PaStiX library. The matrix A should be symmetric and positive definite WARNING Selfadjoint complex matrices are not supported in the current version of PaStiX The vectors or matrices X and B can be either dense or sparse
This class follows the sparse solver concept.
Public functions
- void analyzePattern(const MatrixType& matrix)
- void compute(const MatrixType& matrix)
- void factorize(const MatrixType& matrix)
Function documentation
template<typename _MatrixType, int _UpLo>
void Eigen:: PastixLLT<_MatrixType, _UpLo>:: analyzePattern(const MatrixType& matrix)
Compute the LL^T symbolic factorization of matrix
using its sparsity pattern The result of this operation can be used with successive matrices having the same pattern as matrix
template<typename _MatrixType, int _UpLo>
void Eigen:: PastixLLT<_MatrixType, _UpLo>:: compute(const MatrixType& matrix)
Compute the L factor of the LL^T supernodal factorization of matrix
template<typename _MatrixType, int _UpLo>
void Eigen:: PastixLLT<_MatrixType, _UpLo>:: factorize(const MatrixType& matrix)
Compute the LL^T supernodal numerical factorization of matrix