Poly1FactorDom.
More...
#include <givpoly1factor.h>
|
| Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator()) |
|
Element & | random_irreducible (Element &P, Degree n) const |
| random irreducible polynomial
|
|
Element & | creux_random_irreducible (Element &P, Degree n) const |
| random irreducible polynomial tries to be sparse
|
|
Element & | ixe_irreducible (Element &R, Degree n) const |
| random irreducible polynomial with X as primitive root
|
|
Element & | ixe_irreducible2 (Element &R, Degree n) const |
| random irreducible polynomial with X as primitive root
|
|
Rep & | setdegree (Rep &P) const |
| Compute the degree of P.
|
|
size_t & | sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const |
| Sqrfree decomposition.
|
|
◆ Poly1FactorDom()
template<class Domain , class Tag = Dense, class RandomIterator = GivRandom>
- Warning
- there is a copy of the random Iterator ...
◆ setdegree()
template<class Domain >
Poly1Dom< Domain, Dense >::Rep & setdegree |
( |
Rep & | P | ) |
const |
|
inlineinherited |
Compute the degree of P.
- Warning
- this is an infamous function that may not leave
P
constant !!
- Parameters
-
◆ sqrfree()
template<class Domain >
size_t & sqrfree |
( |
size_t & | Nfact, |
|
|
Rep * | Fact, |
|
|
const Rep & | P ) const |
|
inherited |
Sqrfree decomposition.
Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.
- Parameters
-
Nfact | [in] the size of Fact |
Fact | [in] an array of dimension Nfact |
Nfact | [out] is the number of factor in the sqrfree decomposition |
Fact | [out] contains at most Nfact factors of the decomposition. |
P | rep. |
The documentation for this class was generated from the following files: