template<typename _MatrixType>
SuperLU class
A sparse direct LU factorization and solver based on the SuperLU library.
Template parameters | |
---|---|
_MatrixType | the type of the sparse matrix A, it must be a SparseMatrix<> |
Contents
- Reference
This class allows to solve for A.X = B sparse linear problems via a direct LU factorization using the SuperLU library. The sparse matrix A must be squared and invertible. The vectors or matrices X and B can be either dense or sparse.
This class follows the sparse solver concept.
Base classes
-
template<typename _MatrixType, typename Derived>class SuperLUBase
- The base class for the direct and incomplete LU factorization of SuperLU.
Public functions
- void analyzePattern(const MatrixType& matrix)
- void factorize(const MatrixType& matrix)
Function documentation
template<typename _MatrixType>
void Eigen:: SuperLU<_MatrixType>:: analyzePattern(const MatrixType& matrix)
Performs a symbolic decomposition on the sparcity of matrix.
This function is particularly useful when solving for several problems having the same structure.
template<typename _MatrixType>
void Eigen:: SuperLU<_MatrixType>:: factorize(const MatrixType& matrix)
Performs a numeric decomposition of matrix
The given matrix must has the same sparcity than the matrix on which the symbolic decomposition has been performed.