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 solves A.X = B via a supernodal LL^T (real) or LL^* (complex) Cholesky factorization. The matrix A must be symmetric (real) or Hermitian (complex) and positive definite.
- Warning
- PaStiX can terminate the process on non-positive-definite input rather than return an error. 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. This parameter has no default: either part is accepted and copied to the lower part required by PaStiX. |
This class follows the sparse solver concept .
- See also
- Sparse solver concept, class SimplicialLLT