#include <frobenius-large.h>
|
| | FrobeniusLarge (const PolynomialRing &R) |
| |
| void | randomPolynomial (Polynomial &f, size_t d) const |
| |
| template<class Blackbox> |
| void | minpoly (Polynomial &g, const Blackbox &A) |
| |
| template<class Blackbox> |
| void | kthInvariantFactor (Polynomial &fk, const Blackbox &A, const Polynomial &m, size_t k) |
| |
| template<class Blackbox> |
| void | thresholdSearch (std::vector< Polynomial > &fs, std::vector< size_t > &ms, const Blackbox &A, size_t l, const Polynomial &fl, size_t m, const Polynomial &fm) |
| |
| template<class Blackbox> |
| void | solve (std::vector< Polynomial > &fs, std::vector< size_t > &ms, const Blackbox &A, size_t limit=0) |
| | fs is the distinct invariant factors of A in nonincreasing order by degree.
|
| |
| template<class Blackbox> |
| void | frobeniusInvariants (std::vector< Polynomial > &fs, const Blackbox &A, size_t limit=0) |
| | fs is the invariant factor list of A in nonincreasing order by degree.
|
| |
| template<class Blackbox> |
| void | solve (std::vector< Polynomial > &fs, const Blackbox &A, size_t limit=0) |
| |
◆ PolynomialRing
template<class _PolynomialRing>
◆ Polynomial
template<class _PolynomialRing>
◆ Coeff
template<class _PolynomialRing>
◆ Field
template<class _PolynomialRing>
◆ Element
template<class _PolynomialRing>
◆ RandIter
template<class _PolynomialRing>
◆ MatrixDom
template<class _PolynomialRing>
◆ Matrix
template<class _PolynomialRing>
◆ Toep
template<class _PolynomialRing>
◆ FrobeniusLarge()
template<class _PolynomialRing>
◆ randomPolynomial()
template<class _PolynomialRing>
| void randomPolynomial |
( |
Polynomial & | f, |
|
|
size_t | d ) const |
|
inline |
◆ minpoly()
template<class _PolynomialRing>
◆ kthInvariantFactor()
template<class _PolynomialRing>
◆ thresholdSearch()
template<class _PolynomialRing>
◆ solve() [1/2]
template<class _PolynomialRing>
| void solve |
( |
std::vector< Polynomial > & | fs, |
|
|
std::vector< size_t > & | ms, |
|
|
const Blackbox & | A, |
|
|
size_t | limit = 0 ) |
|
inline |
fs is the distinct invariant factors of A in nonincreasing order by degree.
ms[i] is the index where the first occurrence of Fs[i] would be in a list of all invariants, including repeats. If limit is positive, only the first limit invariants are found.
◆ frobeniusInvariants()
template<class _PolynomialRing>
| void frobeniusInvariants |
( |
std::vector< Polynomial > & | fs, |
|
|
const Blackbox & | A, |
|
|
size_t | limit = 0 ) |
|
inline |
fs is the invariant factor list of A in nonincreasing order by degree.
If limit is positive, only the first limit invariants are found.
◆ solve() [2/2]
template<class _PolynomialRing>
◆ _F
template<class _PolynomialRing>
◆ _RI
template<class _PolynomialRing>
◆ _R
template<class _PolynomialRing>
◆ _MD
template<class _PolynomialRing>
The documentation for this class was generated from the following file: