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
| 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 |
This class follows the sparse solver concept .
Inherits Eigen::PastixBase< Derived >.
| void | analyzePattern (const MatrixType &matrix) |
| void | compute (const MatrixType &matrix) |
| void | factorize (const MatrixType &matrix) |
| inline |
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
| inline |
Compute the L factor of the LL^T supernodal factorization of matrix
| inline |
Compute the LL^T supernodal numerical factorization of matrix
© Eigen.
Licensed under the MPL2 License.
https://eigen.tuxfamily.org/dox/classEigen_1_1PastixLLT.html