Givaro
|
Newton. More...
#include <givinterpgeom.h>
Inherits TruncDom< Domain >.
Public Member Functions | |
bool | isDivisor (const Rep &P, const Element &Q) const |
isDivisor (a, b) Tests if Q | P (that is if P mod Q == 0). | |
size_t & | sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const |
Sqrfree decomposition. More... | |
Newton.
|
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.
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. |