![]() |
Eigen
3.3.3
|
Functor computing the approximate minimum degree ordering If the matrix is not structurally symmetric, an ordering of A^T+A is computed
StorageIndex | The type of indices of the matrix |
Public Member Functions | |
template<typename MatrixType > | |
void | operator() (const MatrixType &mat, PermutationType &perm) |
template<typename SrcType , unsigned int SrcUpLo> | |
void | operator() (const SparseSelfAdjointView< SrcType, SrcUpLo > &mat, PermutationType &perm) |
void Eigen::AMDOrdering< StorageIndex >::operator() | ( | const MatrixType & | mat, |
PermutationType & | perm | ||
) | [inline] |
Compute the permutation vector from a sparse matrix This routine is much faster if the input matrix is column-major
void Eigen::AMDOrdering< StorageIndex >::operator() | ( | const SparseSelfAdjointView< SrcType, SrcUpLo > & | mat, |
PermutationType & | perm | ||
) | [inline] |
Compute the permutation with a selfadjoint matrix