My Project
Loading...
Searching...
No Matches
cfGcdAlgExt.h
Go to the documentation of this file.
1/**
2 * @file cfGcdAlgExt.h
3 *
4 * GCD over Q(a)
5 *
6 * ABSTRACT: Implementation of Encarnacion's GCD algorithm over number fields,
7 * see M.J. Encarnacion "Computing GCDs of polynomials over number fields",
8 * extended to the multivariate case.
9 *
10 * @sa cfNTLzzpEXGCD.h
11**/
12
13#ifndef CF_GCD_ALGEXT_H
14#define CF_GCD_ALGEXT_H
15
16// #include "config.h"
17
18#include "canonicalform.h"
19#include "variable.h"
20
21/// gcd over Q(a)
23
24#ifndef HAVE_NTL
25void tryDivrem (const CanonicalForm&, const CanonicalForm&, CanonicalForm&,
27 bool&);
28void tryEuclid( const CanonicalForm &, const CanonicalForm &, const CanonicalForm &, CanonicalForm &, bool & );
29void tryExtgcd( const CanonicalForm & F, const CanonicalForm & G, const CanonicalForm& M, CanonicalForm & result, CanonicalForm & s, CanonicalForm & t, bool & fail );
30#endif
31void tryInvert( const CanonicalForm &, const CanonicalForm &, CanonicalForm &, bool & );
32
33/// modular gcd over F_p[x]/(M) for not necessarily irreducible M.
34/// If a zero divisor is encountered fail is set to true.
35void tryBrownGCD( const CanonicalForm & F, const CanonicalForm & G, const CanonicalForm & M, CanonicalForm & result, bool & fail, bool topLevel= true );
36
37bool isLess(int *a, int *b, int lower, int upper);
38bool isEqual(int *a, int *b, int lower, int upper);
40
41#endif
42
Header for factory's main class CanonicalForm.
const CanonicalForm CFMap CFMap bool topLevel
Definition: cfGcdAlgExt.cc:57
bool isLess(int *a, int *b, int lower, int upper)
Definition: cfGcdAlgExt.cc:935
bool isEqual(int *a, int *b, int lower, int upper)
Definition: cfGcdAlgExt.cc:946
void tryBrownGCD(const CanonicalForm &F, const CanonicalForm &G, const CanonicalForm &M, CanonicalForm &result, bool &fail, bool topLevel=true)
modular gcd over F_p[x]/(M) for not necessarily irreducible M. If a zero divisor is encountered fail ...
Definition: cfGcdAlgExt.cc:386
CanonicalForm QGCD(const CanonicalForm &, const CanonicalForm &)
gcd over Q(a)
Definition: cfGcdAlgExt.cc:730
void tryInvert(const CanonicalForm &, const CanonicalForm &, CanonicalForm &, bool &)
Definition: cfGcdAlgExt.cc:221
CanonicalForm firstLC(const CanonicalForm &f)
Definition: cfGcdAlgExt.cc:955
CanonicalForm b
Definition: cfModGcd.cc:4103
FILE * f
Definition: checklibs.c:9
factory's main class
Definition: canonicalform.h:86
return result
Definition: facAbsBiFact.cc:75
const CanonicalForm int s
Definition: facAbsFact.cc:51
STATIC_VAR TreeM * G
Definition: janet.cc:31
#define M
Definition: sirandom.c:25
operations on variables