Shapeworks Studio
2.1
Shape analysis software suite
|
A sparse direct Cholesky (LDLT) factorization and solver based on the PARDISO library. More...
#include <PardisoSupport.h>
Public Types | |
enum | { UpLo = Options&(Upper|Lower) } |
Public Types inherited from Eigen::PardisoImpl< Derived > | |
enum | { ScalarIsComplex = NumTraits<Scalar>::IsComplex } |
typedef Traits::MatrixType | MatrixType |
typedef Traits::Scalar | Scalar |
typedef Traits::RealScalar | RealScalar |
typedef Traits::Index | Index |
typedef SparseMatrix< Scalar, RowMajor, Index > | SparseMatrixType |
typedef Matrix< Scalar, Dynamic, 1 > | VectorType |
typedef Matrix< Index, 1, MatrixType::ColsAtCompileTime > | IntRowVectorType |
typedef Matrix< Index, MatrixType::RowsAtCompileTime, 1 > | IntColVectorType |
typedef Array< Index, 64, 1, DontAlign > | ParameterType |
Public Member Functions | |
PardisoLDLT (const MatrixType &matrix) | |
void | getMatrix (const MatrixType &matrix) |
Public Member Functions inherited from Eigen::PardisoImpl< Derived > | |
Index | cols () const |
Index | rows () const |
ComputationInfo | info () const |
Reports whether previous computation was successful. More... | |
ParameterType & | pardisoParameterArray () |
Derived & | analyzePattern (const MatrixType &matrix) |
Derived & | factorize (const MatrixType &matrix) |
Derived & | compute (const MatrixType &matrix) |
template<typename Rhs > | |
const internal::solve_retval< PardisoImpl, Rhs > | solve (const MatrixBase< Rhs > &b) const |
template<typename Rhs > | |
const internal::sparse_solve_retval< PardisoImpl, Rhs > | solve (const SparseMatrixBase< Rhs > &b) const |
Derived & | derived () |
const Derived & | derived () const |
template<typename BDerived , typename XDerived > | |
bool | _solve (const MatrixBase< BDerived > &b, MatrixBase< XDerived > &x) const |
Protected Types | |
typedef PardisoImpl< PardisoLDLT< MatrixType, Options > > | Base |
typedef Base::Scalar | Scalar |
typedef Base::Index | Index |
typedef Base::RealScalar | RealScalar |
Friends | |
class | PardisoImpl< PardisoLDLT< MatrixType, Options > > |
Additional Inherited Members | |
Protected Member Functions inherited from Eigen::PardisoImpl< Derived > | |
void | pardisoRelease () |
void | pardisoInit (int type) |
void | manageErrorCode (Index error) |
Protected Attributes inherited from Eigen::PardisoImpl< Derived > | |
SparseMatrixType | m_matrix |
ComputationInfo | m_info |
bool | m_initialized |
bool | m_analysisIsOk |
bool | m_factorizationIsOk |
Index | m_type |
Index | m_msglvl |
void * | m_pt [64] |
ParameterType | m_iparm |
IntColVectorType | m_perm |
Index | m_size |
A sparse direct Cholesky (LDLT) factorization and solver based on the PARDISO library.
This class allows to solve for A.X = B sparse linear problems via a LDL^T Cholesky factorization using the Intel MKL PARDISO library. The sparse matrix A is assumed to be selfajoint and positive definite. For complex matrices, A can also be symmetric only, see the Options template parameter. 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<> |
Options | can be any bitwise combination of Upper, Lower, and Symmetric. The default is Upper, meaning only the upper triangular part has to be used. Symmetric can be used for symmetric, non-selfadjoint complex matrices, the default being to assume a selfadjoint matrix. Upper|Lower can be used to tell both triangular parts can be used as input. |
Definition at line 39 of file PardisoSupport.h.