|
| | InvariantFactors (const Field &F, const PolynomialRing &R) |
| |
| size_t | min_block_size (size_t t, double p) const |
| |
| template<class Blackbox> |
| void | computeGenerator (std::vector< Matrix > &gen, const Blackbox &M, size_t b) const |
| |
| template<class Blackbox> |
| void | computeGenerator2 (std::vector< Matrix > &gen, const Blackbox &M, size_t b) const |
| |
| void | convert (PolyMatrix &G, const std::vector< Matrix > &minpoly) const |
| |
| template<class Blackbox> |
| std::vector< Polynomial > & | largestInvariantFactors (std::vector< Polynomial > &lifs, const Blackbox &A, size_t b, int earlyTerm=10) const |
| |
| template<class Blackbox> |
| std::vector< Polynomial > & | largestInvariantFactors2 (std::vector< Polynomial > &lifs, const Blackbox &A, size_t b, int earlyTerm=10) const |
| |
| template<class Blackbox> |
| std::vector< Polynomial > & | largestInvariantFactors (std::vector< Polynomial > &lifs, const Blackbox &A, const Polynomial &mod, size_t b, int earlyTerm=10) const |
| |
| template<class Blackbox> |
| std::vector< Polynomial > & | largestInvariantFactors (std::vector< Polynomial > &lifs, const Blackbox &A, size_t t, double p, int earlyTerm=10) const |
| |
| template<class Blackbox> |
| std::vector< Polynomial > & | frobeniusInvariants (std::vector< Polynomial > &lifs, const Blackbox &A, size_t k) const |
| | lifs is the first k invariant factors of A in nonincreasing order by degree.
|
| |
| template<class Blackbox> |
| std::vector< Polynomial > & | lifsit (std::vector< Polynomial > &lifs, const Blackbox &A, size_t b0, size_t s, size_t t, size_t k) const |
| |
| void | randomNonzero (const Field &F, Element &elm) const |
| |
| template<class SparseMat> |
| void | randomTriangular (SparseMat &T, size_t s, bool upper, bool randomDiag=false) const |
| |
| template<class Blackbox> |
| std::vector< Polynomial > & | precondLifs (std::vector< Polynomial > &lifs, const Blackbox &A, size_t b, int earlyTerm=10) const |
| |
| template<class Blackbox> |
| bool | det (Element &det, const Blackbox &A, size_t b=12, int earlyTerm=10) const |
| |
| template<class Blackbox> |
| bool | rank (size_t &rank, const Blackbox &A, size_t b=12, size_t t=3, int earlyTerm=10) const |
| |