$treeview $search $mathjax
Eigen  3.2.5
$projectbrief
$projectbrief
$searchbox

AMDOrdering< Index > Class Template Reference
[OrderingMethods module]

List of all members.

Public Member Functions

template<typename SrcType , unsigned int SrcUpLo>
void operator() (const SparseSelfAdjointView< SrcType, SrcUpLo > &mat, PermutationType &perm)
template<typename MatrixType >
void operator() (const MatrixType &mat, PermutationType &perm)

Detailed Description

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

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

Template Parameters:
Index The type of indices of the matrix
See also:
COLAMDOrdering

Member Function Documentation

void operator() ( const SparseSelfAdjointView< SrcType, SrcUpLo > &  mat,
PermutationType perm 
) [inline]

Compute the permutation with a selfadjoint matrix

void 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


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