template<typename _MatrixType, int _UpLo>
class Eigen::PastixLLT< _MatrixType, _UpLo >
A sparse direct supernodal Cholesky (LLT) factorization and solver based on the PaStiX library.
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
- Template Parameters
-
MatrixType | the type of the sparse matrix A, it must be a SparseMatrix<> |
UpLo | The part of the matrix to use : Lower or Upper. The default is Lower as required by PaStiX |
- See Also
- Sparse solvers
Inherits PastixBase< Derived >.
Public Member Functions |
void | analyzePattern (const MatrixType &matrix) |
void | compute (const MatrixType &matrix) |
Array< RealScalar, IPARM_SIZE, 1 > & | dparm () |
double & | dparm (int idxparam) |
void | factorize (const MatrixType &matrix) |
ComputationInfo | info () const |
| Reports whether previous computation was successful.
|
Array< Index, IPARM_SIZE, 1 > & | iparm () |
int & | iparm (int idxparam) |
template<typename Rhs > |
const internal::solve_retval
< PastixBase, Rhs > | solve (const MatrixBase< Rhs > &b) const |
template<typename Rhs > |
const
internal::sparse_solve_retval
< PastixBase, Rhs > | solve (const SparseMatrixBase< Rhs > &b) const |