A sparse direct incomplete LU factorization and solver based on the SuperLU library.
More...
#include <SuperLUSupport.h>
template<typename _MatrixType>
class Eigen::SuperILU< _MatrixType >
A sparse direct incomplete LU factorization and solver based on the SuperLU library.
This class allows to solve for an approximate solution of A.X = B sparse linear problems via an incomplete LU factorization using the SuperLU library. This class is aimed to be used as a preconditioner of the iterative linear solvers.
- Warning
- This class requires SuperLU 4 or later.
- Template Parameters
-
| _MatrixType | the type of the sparse matrix A, it must be a SparseMatrix<> |
- See also
- Solving linear problems, class ConjugateGradient, class BiCGSTAB
◆ analyzePattern()
| void analyzePattern |
( |
const MatrixType & |
matrix | ) |
|
|
inline |
◆ compute()
| void compute |
( |
const MatrixType & |
matrix | ) |
|
|
inlineinherited |
Computes the sparse Cholesky decomposition of matrix
◆ factorize()
| void factorize |
( |
const MatrixType & |
matrix | ) |
|
◆ info()
Reports whether previous computation was successful.
- Returns
Success if computation was succesful, NumericalIssue if the matrix.appears to be negative.
◆ options()
| superlu_options_t& options |
( |
| ) |
|
|
inlineinherited |
- Returns
- a reference to the Super LU option object to configure the Super LU algorithms.
◆ solve()
- Returns
- the solution x of
using the current decomposition of A.
- See also
- compute()
The documentation for this class was generated from the following file: