Public Types | Public Member Functions | List of all members
Eigen::AMDOrdering< StorageIndex > Class Template Reference

#include <Ordering.h>

Public Types

typedef PermutationMatrix< Dynamic, Dynamic, StorageIndex > PermutationType
 

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)
 

Detailed Description

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
StorageIndexThe type of indices of the matrix
See also
COLAMDOrdering

Definition at line 50 of file 3rdparty/Eigen/Eigen/src/OrderingMethods/Ordering.h.

Member Typedef Documentation

◆ PermutationType

template<typename StorageIndex>
typedef PermutationMatrix<Dynamic, Dynamic, StorageIndex> Eigen::AMDOrdering< StorageIndex >::PermutationType

Member Function Documentation

◆ 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

Definition at line 59 of file 3rdparty/Eigen/Eigen/src/OrderingMethods/Ordering.h.

◆ 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

Definition at line 72 of file 3rdparty/Eigen/Eigen/src/OrderingMethods/Ordering.h.


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


gtsam
Author(s):
autogenerated on Tue Jul 4 2023 02:41:11