W3cubDocs

/Eigen3

Eigen::AMDOrdering

template<typename StorageIndex>
class Eigen::AMDOrdering< StorageIndex >

Functor computing the approximate minimum degree ordering If the matrix is not structurally symmetric, an ordering of A^T+A is computed

Template Parameters
StorageIndex The type of indices of the matrix
See also
COLAMDOrdering
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)

operator()() [1/2]

template<typename StorageIndex >
template<typename MatrixType >
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

operator()() [2/2]

template<typename StorageIndex >
template<typename SrcType , unsigned int SrcUpLo>
void Eigen::AMDOrdering< StorageIndex >::operator() ( const SparseSelfAdjointView< SrcType, SrcUpLo > & mat,
PermutationType & perm
)
inline

Compute the permutation with a selfadjoint matrix

The documentation for this class was generated from the following file:

© Eigen.
Licensed under the MPL2 License.
https://eigen.tuxfamily.org/dox/classEigen_1_1AMDOrdering.html