 |
My Project
debian-1:4.1.1-p2+ds-4
|
Definition at line 760 of file fglmzero.cc.
◆ fglmDdata()
fglmDdata::fglmDdata |
( |
int |
dimension | ) |
|
Definition at line 795 of file fglmzero.cc.
801 #ifndef HAVE_EXPLICIT_CONSTR
◆ ~fglmDdata()
fglmDdata::~fglmDdata |
( |
| ) |
|
Definition at line 823 of file fglmzero.cc.
829 #ifndef HAVE_EXPLICIT_CONSTR
◆ buildIdeal()
ideal fglmDdata::buildIdeal |
( |
| ) |
|
|
inline |
◆ candidatesLeft()
BOOLEAN fglmDdata::candidatesLeft |
( |
| ) |
const |
|
inline |
◆ gaussreduce()
Definition at line 981 of file fglmzero.cc.
986 fglmASSERT( pdenom ==
NULL,
"pdenom in gaussreduce should be NULL" );
988 number vdenom =
v.clearDenom();
990 p.setelem(
p.size(), vdenom );
995 number
gcd =
v.gcd();
1006 if ( !
v.elemIsZero(
perm[
k] ) ) {
1009 v.nihilate( fac1, fac2,
gauss[
k].
v );
1011 temp=
nMult( fac2, pdenom );
1014 p.nihilate( fac1, fac2,
gauss[
k].
p );
1021 number
gcd =
v.gcd();
◆ getBasisSize()
int fglmDdata::getBasisSize |
( |
| ) |
const |
|
inline |
◆ newBasisElem()
Definition at line 856 of file fglmzero.cc.
868 number
pivot=
v.getconstelem(
k );
885 #ifndef HAVE_EXPLICIT_CONSTR
◆ newGroebnerPoly()
void fglmDdata::newGroebnerPoly |
( |
fglmVector & |
v, |
|
|
poly & |
p |
|
) |
| |
◆ nextCandidate()
◆ updateCandidates()
◆ basis
◆ basisSize
◆ destId
◆ dimen
◆ gauss
◆ groebnerBS
int fglmDdata::groebnerBS |
|
private |
◆ groebnerSize
int fglmDdata::groebnerSize |
|
private |
◆ isPivot
◆ nlist
◆ perm
◆ varpermutation
int* fglmDdata::varpermutation |
|
private |
The documentation for this class was generated from the following file:
#define idDelete(H)
delete an ideal
void pEnlargeSet(poly **p, int l, int increment)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
#define omFreeSize(addr, size)
void idSkipZeroes(ideal ide)
gives an ideal/module the minimal possible size
oldGaussElem(const fglmVector newv, const fglmVector newp, number &newpdenom, number &newfac)
bool pivot(const matrix aMat, const int r1, const int r2, const int c1, const int c2, int *bestR, int *bestC, const ring R)
This code computes a score for each non-zero matrix entry in aMat[r1..r2, c1..c2].
#define pSetCoeff(p, n)
deletes old coeff before setting the new one
BOOLEAN dimension(leftv res, leftv args)
#define fglmASSERT(ignore1, ignore2)
ideal idInit(int idsize, int rank)
initialise an ideal / module
#define pLmDelete(p)
assume p != NULL, deletes Lm(p)->coef and Lm(p)
static FORCE_INLINE number n_SubringGcd(number a, number b, const coeffs r)
const Variable & v
< [in] a sqrfree bivariate poly
#define pCopy(p)
return a copy of the poly
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
static intvec * idSort(ideal id, BOOLEAN nolex=TRUE)
#define pCmp(p1, p2)
pCmp: args may be NULL returns: (p2==NULL ? 1 : (p1 == NULL ? -1 : p_LmCmp(p1, p2)))
#define idMaxIdeal(D)
initialise the maximal ideal (at 0)