|
|
| PastixLU (const MatrixType &matrix) |
| |
| void | compute (const MatrixType &matrix) |
| |
| void | analyzePattern (const MatrixType &matrix) |
| |
| void | factorize (const MatrixType &matrix) |
| |
|
bool | _solve_impl (const MatrixBase< Rhs > &b, MatrixBase< Dest > &x) const |
| |
|
void | _solve_impl (const SparseMatrixBase< Rhs > &b, SparseMatrixBase< Dest > &dest) const |
| |
| Array< StorageIndex, IPARM_SIZE, 1 > & | iparm () |
| |
| int & | iparm (int idxparam) |
| |
| Array< double, DPARM_SIZE, 1 > & | dparm () |
| |
| double & | dparm (int idxparam) |
| |
|
Index | cols () const |
| |
|
Index | rows () const |
| |
| ComputationInfo | info () const |
| | Reports whether previous computation was successful.
|
| |
| | SparseSolverBase () |
| |
|
Derived & | derived () |
| |
|
const Derived & | derived () const |
| |
| template<typename Rhs > |
| const Solve< Derived, Rhs > | solve (const MatrixBase< Rhs > &b) const |
| |
| template<typename Rhs > |
| const Solve< Derived, Rhs > | solve (const SparseMatrixBase< Rhs > &b) const |
| |
|
template<typename Rhs , typename Dest > |
| void | _solve_impl (const SparseMatrixBase< Rhs > &b, SparseMatrixBase< Dest > &dest) const |
| |
|
|
ColSpMatrix | m_transposedStructure |
| |
|
bool | m_structureIsUptodate |
| |
|
Array< int, IPARM_SIZE, 1 > | m_iparm |
| |
|
Array< double, DPARM_SIZE, 1 > | m_dparm |
| |
|
int | m_initisOk |
| |
|
int | m_analysisIsOk |
| |
|
int | m_factorizationIsOk |
| |
|
ComputationInfo | m_info |
| |
|
pastix_data_t * | m_pastixdata |
| |
|
int | m_comm |
| |
|
Array< int, IPARM_SIZE, 1 > | m_iparm |
| |
|
Array< double, DPARM_SIZE, 1 > | m_dparm |
| |
|
Matrix< StorageIndex, Dynamic, 1 > | m_perm |
| |
|
Matrix< StorageIndex, Dynamic, 1 > | m_invp |
| |
|
int | m_size |
| |
|
bool | m_isInitialized |
| |
|
bool | m_isInitialized |
| |
template<typename _MatrixType, bool IsStrSym>
class Eigen::PastixLU< _MatrixType, IsStrSym >
Interface to the PaStix solver.
Sparse direct LU solver based on PaStiX library.
This class is used to solve the linear systems A.X = B via the PaStix library. The matrix can be either real or complex, symmetric or not.
- See also
- TutorialSparseDirectSolvers
This class is used to solve the linear systems A.X = B with a supernodal LU factorization in the PaStiX library. The matrix A should be squared and nonsingular PaStiX requires that the matrix A has a symmetric structural pattern. This interface can symmetrize the input matrix otherwise. 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<> |
| IsStrSym | Indicates if the input matrix has a symmetric pattern, default is false NOTE : Note that if the analysis and factorization phase are called separately, the input matrix will be symmetrized at each call, hence it is advised to symmetrize the matrix in a end-user program and set IsStrSym to true |
\implsparsesolverconcept
- See also
- TutorialSparseSolverConcept, class SparseLU