My Project
|
univariate Gcd over finite fields and Z, extended GCD over finite fields and Q More...
Go to the source code of this file.
Functions | |
bool | isPurePoly (const CanonicalForm &) |
CanonicalForm | gcd_univar_flint0 (const CanonicalForm &, const CanonicalForm &) |
CanonicalForm | gcd_univar_flintp (const CanonicalForm &, const CanonicalForm &) |
CanonicalForm FACTORY_PUBLIC | extgcd (const CanonicalForm &f, const CanonicalForm &g, CanonicalForm &a, CanonicalForm &b) |
CanonicalForm extgcd ( const CanonicalForm & f, const CanonicalForm & g, CanonicalForm & a, CanonicalForm & b ) More... | |
univariate Gcd over finite fields and Z, extended GCD over finite fields and Q
Definition in file cfUnivarGcd.h.
CanonicalForm FACTORY_PUBLIC extgcd | ( | const CanonicalForm & | f, |
const CanonicalForm & | g, | ||
CanonicalForm & | a, | ||
CanonicalForm & | b | ||
) |
CanonicalForm extgcd ( const CanonicalForm & f, const CanonicalForm & g, CanonicalForm & a, CanonicalForm & b )
extgcd() - returns polynomial extended gcd of f and g.
Returns gcd(f, g) and a and b sucht that f*a+g*b=gcd(f, g). The gcd is calculated using an extended euclidean polynomial remainder sequence, so f and g should be polynomials over an euclidean domain. Normalizes result.
Note: be sure that f and g have the same level!
Definition at line 174 of file cfUnivarGcd.cc.
CanonicalForm gcd_univar_flint0 | ( | const CanonicalForm & | F, |
const CanonicalForm & | G | ||
) |
Definition at line 61 of file cfUnivarGcd.cc.
CanonicalForm gcd_univar_flintp | ( | const CanonicalForm & | F, |
const CanonicalForm & | G | ||
) |
Definition at line 48 of file cfUnivarGcd.cc.
bool isPurePoly | ( | const CanonicalForm & | f | ) |
Definition at line 244 of file cf_factor.cc.