NDDEM
|
The base class for the direct and incomplete LU factorization of SuperLU. More...
#include <SuperLUSupport.h>
Public Types | |
enum | { ColsAtCompileTime = MatrixType::ColsAtCompileTime , MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime } |
typedef _MatrixType | MatrixType |
typedef MatrixType::Scalar | Scalar |
typedef MatrixType::RealScalar | RealScalar |
typedef MatrixType::StorageIndex | StorageIndex |
typedef Matrix< Scalar, Dynamic, 1 > | Vector |
typedef Matrix< int, 1, MatrixType::ColsAtCompileTime > | IntRowVectorType |
typedef Matrix< int, MatrixType::RowsAtCompileTime, 1 > | IntColVectorType |
typedef Map< PermutationMatrix< Dynamic, Dynamic, int > > | PermutationMap |
typedef SparseMatrix< Scalar > | LUMatrixType |
Public Member Functions | |
SuperLUBase () | |
~SuperLUBase () | |
Index | rows () const |
Index | cols () const |
superlu_options_t & | options () |
ComputationInfo | info () const |
Reports whether previous computation was successful. More... | |
void | compute (const MatrixType &matrix) |
void | analyzePattern (const MatrixType &) |
template<typename Stream > | |
void | dumpMemory (Stream &) |
![]() | |
SparseSolverBase () | |
~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 |
Protected Types | |
typedef SparseSolverBase< Derived > | Base |
Protected Member Functions | |
void | initFactorization (const MatrixType &a) |
void | init () |
void | extractData () const |
void | clearFactors () |
Derived & | derived () |
const Derived & | derived () const |
Protected Attributes | |
LUMatrixType | m_l |
LUMatrixType | m_u |
IntColVectorType | m_p |
IntRowVectorType | m_q |
LUMatrixType | m_matrix |
SluMatrix | m_sluA |
SuperMatrix | m_sluL |
SuperMatrix | m_sluU |
SluMatrix | m_sluB |
SluMatrix | m_sluX |
SuperLUStat_t | m_sluStat |
superlu_options_t | m_sluOptions |
std::vector< int > | m_sluEtree |
Matrix< RealScalar, Dynamic, 1 > | m_sluRscale |
Matrix< RealScalar, Dynamic, 1 > | m_sluCscale |
Matrix< RealScalar, Dynamic, 1 > | m_sluFerr |
Matrix< RealScalar, Dynamic, 1 > | m_sluBerr |
char | m_sluEqued |
ComputationInfo | m_info |
int | m_factorizationIsOk |
int | m_analysisIsOk |
bool | m_extractedDataAreDirty |
bool | m_isInitialized |
![]() | |
bool | m_isInitialized |
Private Member Functions | |
SuperLUBase (SuperLUBase &) | |
The base class for the direct and incomplete LU factorization of SuperLU.
|
protected |
typedef Matrix<int, MatrixType::RowsAtCompileTime, 1> Eigen::SuperLUBase< _MatrixType, Derived >::IntColVectorType |
typedef Matrix<int, 1, MatrixType::ColsAtCompileTime> Eigen::SuperLUBase< _MatrixType, Derived >::IntRowVectorType |
typedef SparseMatrix<Scalar> Eigen::SuperLUBase< _MatrixType, Derived >::LUMatrixType |
typedef _MatrixType Eigen::SuperLUBase< _MatrixType, Derived >::MatrixType |
typedef Map<PermutationMatrix<Dynamic,Dynamic,int> > Eigen::SuperLUBase< _MatrixType, Derived >::PermutationMap |
typedef MatrixType::RealScalar Eigen::SuperLUBase< _MatrixType, Derived >::RealScalar |
typedef MatrixType::Scalar Eigen::SuperLUBase< _MatrixType, Derived >::Scalar |
typedef MatrixType::StorageIndex Eigen::SuperLUBase< _MatrixType, Derived >::StorageIndex |
typedef Matrix<Scalar,Dynamic,1> Eigen::SuperLUBase< _MatrixType, Derived >::Vector |
anonymous enum |
|
inline |
|
inline |
|
inlineprivate |
|
inline |
Performs a symbolic decomposition on the sparcity of matrix.
This function is particularly useful when solving for several problems having the same structure.
|
inlineprotected |
|
inline |
|
inline |
Computes the sparse Cholesky decomposition of matrix
|
inlineprotected |
|
inlineprotected |
|
inline |
|
protected |
|
inline |
Reports whether previous computation was successful.
Success
if computation was successful, NumericalIssue
if the matrix.appears to be negative.
|
inlineprotected |
|
inlineprotected |
|
inline |
|
inline |
|
protected |
|
mutableprotected |
|
protected |
|
mutableprotected |
|
mutableprotected |
|
mutableprotected |
|
mutableprotected |
|
mutableprotected |
|
mutableprotected |
|
mutableprotected |
|
mutableprotected |
|
protected |
|
protected |
|
mutableprotected |
|
mutableprotected |
|
mutableprotected |
|
mutableprotected |
|
mutableprotected |
|
mutableprotected |
|
mutableprotected |
|
protected |
|
protected |
|
mutableprotected |