![]() |
Eigen
3.2.7
|
Permutation matrix.
SizeAtCompileTime | the number of rows/cols, or Dynamic |
MaxSizeAtCompileTime | the maximum number of rows/cols, or Dynamic. This optional parameter defaults to SizeAtCompileTime. Most of the time, you should not have to specify it. |
IndexType | the interger type of the indices |
This class represents a permutation matrix, internally stored as a vector of integers.
Public Member Functions | |
PermutationMatrix < SizeAtCompileTime, MaxSizeAtCompileTime, IndexType > & | applyTranspositionOnTheLeft (Index i, Index j) |
PermutationMatrix < SizeAtCompileTime, MaxSizeAtCompileTime, IndexType > & | applyTranspositionOnTheRight (Index i, Index j) |
Index | cols () const |
Derived & | derived () |
const Derived & | derived () const |
Index | determinant () const |
const IndicesType & | indices () const |
IndicesType & | indices () |
Transpose< PermutationBase > | inverse () const |
PlainPermutationType | operator* (const PermutationBase< Other > &other) const |
PlainPermutationType | operator* (const Transpose< PermutationBase< Other > > &other) const |
template<typename Other > | |
PermutationMatrix & | operator= (const PermutationBase< Other > &other) |
template<typename Other > | |
PermutationMatrix & | operator= (const TranspositionsBase< Other > &tr) |
PermutationMatrix (int size) | |
template<typename OtherDerived > | |
PermutationMatrix (const PermutationBase< OtherDerived > &other) | |
template<typename Other > | |
PermutationMatrix (const MatrixBase< Other > &a_indices) | |
template<typename Other > | |
PermutationMatrix (const TranspositionsBase< Other > &tr) | |
void | resize (Index newSize) |
Index | rows () const |
void | setIdentity () |
void | setIdentity (Index newSize) |
Index | size () const |
DenseMatrixType | toDenseMatrix () const |
Transpose< PermutationBase > | transpose () const |
|
inline |
Constructs an uninitialized permutation matrix of given size.
|
inline |
Copy constructor.
|
inlineexplicit |
Generic constructor from expression of the indices. The indices array has the meaning that the permutations sends each integer i to indices[i].
|
inlineexplicit |
Convert the Transpositions tr to a permutation matrix
|
inlineinherited |
Multiplies *this by the transposition on the left.
References EigenBase< Derived >::derived(), PermutationBase< Derived >::indices(), and PermutationBase< Derived >::size().
|
inlineinherited |
Multiplies *this by the transposition on the right.
This is a fast operation, it only consists in swapping two indices.
References EigenBase< Derived >::derived(), PermutationBase< Derived >::indices(), and PermutationBase< Derived >::size().
|
inlineinherited |
References PermutationBase< Derived >::indices(), and PermutationBase< Derived >::size().
|
inlineinherited |
Referenced by IterativeSolverBase< ConjugateGradient< _MatrixType, _UpLo, _Preconditioner > >::analyzePattern(), MatrixBase< Derived >::applyOnTheLeft(), MatrixBase< Derived >::applyOnTheRight(), PermutationBase< PermutationMatrix< SizeAtCompileTime, MaxSizeAtCompileTime, IndexType > >::applyTranspositionOnTheLeft(), PermutationBase< PermutationMatrix< SizeAtCompileTime, MaxSizeAtCompileTime, IndexType > >::applyTranspositionOnTheRight(), SparseMatrixBase< CwiseBinaryOp< BinaryOp, Lhs, Rhs > >::bottomRows(), EigenBase< SparseSymmetricPermutationProduct< MatrixType, UpLo > >::cols(), SparseMatrixBase< CwiseBinaryOp< BinaryOp, Lhs, Rhs > >::cols(), IterativeSolverBase< ConjugateGradient< _MatrixType, _UpLo, _Preconditioner > >::compute(), SparseMatrixBase< CwiseBinaryOp< BinaryOp, Lhs, Rhs > >::eval(), IterativeSolverBase< ConjugateGradient< _MatrixType, _UpLo, _Preconditioner > >::factorize(), PermutationBase< PermutationMatrix< SizeAtCompileTime, MaxSizeAtCompileTime, IndexType > >::indices(), PermutationBase< PermutationMatrix< SizeAtCompileTime, MaxSizeAtCompileTime, IndexType > >::inverse(), IterativeSolverBase< ConjugateGradient< _MatrixType, _UpLo, _Preconditioner > >::IterativeSolverBase(), RotationBase< Derived, 3 >::operator*(), SparseSelfAdjointView< MatrixType, UpLo >::operator*(), PermutationBase< PermutationMatrix< SizeAtCompileTime, MaxSizeAtCompileTime, IndexType > >::operator*(), SparseMatrixBase< Derived >::operator*(), SparseMatrixBase< CwiseBinaryOp< BinaryOp, Lhs, Rhs > >::operator*(), Transform< Scalar, Dim, Mode, _Options >::operator*(), Eigen::operator*(), MatrixBase< Derived >::operator*=(), PermutationBase< PermutationMatrix< SizeAtCompileTime, MaxSizeAtCompileTime, IndexType > >::operator=(), DenseBase< Derived >::operator=(), Transform< Scalar, Dim, Mode, _Options >::operator=(), PlainObjectBase< Matrix< _Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols > >::operator=(), PlainObjectBase< Matrix< _Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols > >::PlainObjectBase(), SparseMatrixBase< CwiseBinaryOp< BinaryOp, Lhs, Rhs > >::real(), PlainObjectBase< Matrix< _Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols > >::resizeLike(), EigenBase< SparseSymmetricPermutationProduct< MatrixType, UpLo > >::rows(), SparseMatrixBase< CwiseBinaryOp< BinaryOp, Lhs, Rhs > >::rows(), SimplicialCholeskyBase< SimplicialLDLT< _MatrixType, _UpLo, _Ordering > >::solve(), IterativeSolverBase< ConjugateGradient< _MatrixType, _UpLo, _Preconditioner > >::solve(), SparseLU< _MatrixType, _OrderingType >::solve(), UmfPackLU< _MatrixType >::solve(), CholmodBase< _MatrixType, _UpLo, CholmodSimplicialLLT< _MatrixType, _UpLo > >::solve(), SuperLUBase< _MatrixType, SuperILU< _MatrixType > >::solve(), SparseMatrix< Scalar, RowMajor >::SparseMatrix(), PermutationBase< PermutationMatrix< SizeAtCompileTime, MaxSizeAtCompileTime, IndexType > >::toDenseMatrix(), SparseMatrixBase< CwiseBinaryOp< BinaryOp, Lhs, Rhs > >::topLeftCorner(), Transform< Scalar, Dim, Mode, _Options >::Transform(), PermutationBase< PermutationMatrix< SizeAtCompileTime, MaxSizeAtCompileTime, IndexType > >::transpose(), and SparseMatrixBase< CwiseBinaryOp< BinaryOp, Lhs, Rhs > >::twistedBy().
|
inlineinherited |
|
inlineinherited |
This function is O(n
) procedure allocating a buffer of n
booleans.
References DenseBase< Derived >::fill(), PermutationBase< Derived >::indices(), and PermutationBase< Derived >::size().
|
inline |
const version of indices().
Referenced by SparseLU< _MatrixType, _OrderingType >::analyzePattern(), SPQR< MatrixType >::colsPermutation(), and COLAMDOrdering< Index >::operator()().
|
inline |
|
inlineinherited |
References EigenBase< Derived >::derived().
|
inlineinherited |
References EigenBase< Derived >::derived().
|
inlineinherited |
|
inline |
Copies the other permutation into *this
|
inline |
Assignment from the Transpositions tr
|
inlineinherited |
Resizes to given size.
References PermutationBase< Derived >::indices().
|
inlineinherited |
References PermutationBase< Derived >::indices(), and PermutationBase< Derived >::size().
|
inlineinherited |
Sets *this to be the identity permutation matrix
References PermutationBase< Derived >::indices(), and PermutationBase< Derived >::size().
|
inlineinherited |
Sets *this to be the identity permutation matrix of given size.
References PermutationBase< Derived >::resize(), and PermutationBase< Derived >::setIdentity().
|
inlineinherited |
References PermutationBase< Derived >::indices(), and PermutationBase< Derived >::size().
|
inlineinherited |
References EigenBase< Derived >::derived().
|
inlineinherited |
References EigenBase< Derived >::derived().