#include <permutation.h>
Public Member Functions | |
Permutation (Storage &indices, const Field &F=Field()) | |
Permutation (int n, const Field &F=Field()) | |
template<class OutVector , class InVector > | |
OutVector & | apply (OutVector &y, const InVector &x) const |
y Px#. | |
template<class OutVector , class InVector > | |
OutVector & | applyTranspose (OutVector &y, const InVector &x) const |
y^T x^T P#. | |
void | permute (size_t row1, size_t row2) |
Storage | LinBox} dense or sparse vector of field elements |
Permutation | ( | Storage & | indices, | |
const Field & | F = Field() | |||
) | [inline] |
Constructor from a vector of indices This constructor creates a permutation matrix based on a vector of indices
indices | Vector of indices representing the permutation |
Permutation | ( | int | n, | |
const Field & | F = Field() | |||
) | [inline] |
Constructor from a dimension This constructor creates an n x n permutation matrix, initialized to be the identity
n | The dimension of hte matrix to create |
void permute | ( | size_t | row1, | |
size_t | row2 | |||
) | [inline] |
Add a transposition to the matrix