WPILibC++ 2023.4.3
|
Functor computing the approximate minimum degree ordering If the matrix is not structurally symmetric, an ordering of A^T+A is computed. More...
Public Types | |
typedef PermutationMatrix< Dynamic, Dynamic, StorageIndex > | PermutationType |
Public Member Functions | |
template<typename MatrixType > | |
void | operator() (const MatrixType &mat, PermutationType &perm) |
Compute the permutation vector from a sparse matrix This routine is much faster if the input matrix is column-major More... | |
template<typename SrcType , unsigned int SrcUpLo> | |
void | operator() (const SparseSelfAdjointView< SrcType, SrcUpLo > &mat, PermutationType &perm) |
Compute the permutation with a selfadjoint matrix. More... | |
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 |
typedef PermutationMatrix<Dynamic, Dynamic, StorageIndex> Eigen::AMDOrdering< StorageIndex >::PermutationType |
|
inline |
Compute the permutation vector from a sparse matrix This routine is much faster if the input matrix is column-major
|
inline |
Compute the permutation with a selfadjoint matrix.