 |
My Project
debian-1:4.1.2-p1+ds-2
|
Go to the source code of this file.
|
void | internalCalculateFunctionals (const ideal, idealFunctionals &l, fglmSdata &data) |
|
static BOOLEAN | CalculateFunctionals (const ideal &theIdeal, idealFunctionals &l) |
|
static BOOLEAN | CalculateFunctionals (const ideal &theIdeal, idealFunctionals &l, poly &p, fglmVector &v) |
|
static ideal | GroebnerViaFunctionals (const idealFunctionals &l, fglmVector iv=fglmVector()) |
|
static ideal | FindUnivariatePolys (const idealFunctionals &l) |
|
BOOLEAN | fglmzero (ring sourceRing, ideal &sourceIdeal, ring destRing, ideal &destIdeal, BOOLEAN switchBack, BOOLEAN deleteIdeal) |
|
BOOLEAN | fglmquot (ideal sourceIdeal, poly quot, ideal &destIdeal) |
|
BOOLEAN | FindUnivariateWrapper (ideal source, ideal &destIdeal) |
|
◆ matElem
◆ matHeader
◆ fglmASSERT
#define fglmASSERT |
( |
|
ignore1, |
|
|
|
ignore2 |
|
) |
| |
◆ PROT
◆ PROT2
#define PROT2 |
( |
|
msg, |
|
|
|
arg |
|
) |
| |
◆ STICKYPROT
◆ STICKYPROT2
◆ CalculateFunctionals() [1/2]
Definition at line 673 of file fglmzero.cc.
677 return ( data.state() );
◆ CalculateFunctionals() [2/2]
Definition at line 681 of file fglmzero.cc.
687 v = data.getVectorRep(
p );
690 return ( data.state() );
◆ fglmquot()
BOOLEAN fglmquot |
( |
ideal |
sourceIdeal, |
|
|
poly |
quot, |
|
|
ideal & |
destIdeal |
|
) |
| |
◆ fglmzero()
BOOLEAN fglmzero |
( |
ring |
sourceRing, |
|
|
ideal & |
sourceIdeal, |
|
|
ring |
destRing, |
|
|
ideal & |
destIdeal, |
|
|
BOOLEAN |
switchBack, |
|
|
BOOLEAN |
deleteIdeal |
|
) |
| |
Definition at line 1193 of file fglmzero.cc.
1204 if ( deleteIdeal ==
TRUE )
1207 if ( fglmok ==
TRUE )
1209 L.map( sourceRing );
1212 if ( (switchBack) && (
currRing != initialRing) )
◆ FindUnivariatePolys()
Definition at line 1118 of file fglmzero.cc.
1142 if ( (
isZero= gauss.reduce(
v )))
1145 p= gauss.getDependence();
1146 number
gcd=
p.gcd();
1155 for (
k=
p.size();
k > 0;
k-- )
1157 number n =
nCopy(
p.getconstelem(
k ) );
1182 v=
l.multiply(
v,
i );
◆ FindUnivariateWrapper()
BOOLEAN FindUnivariateWrapper |
( |
ideal |
source, |
|
|
ideal & |
destIdeal |
|
) |
| |
◆ GroebnerViaFunctionals()
Definition at line 1046 of file fglmzero.cc.
1069 data.updateCandidates( one, initv );
1070 number nOne =
nInit( 1 );
1071 data.newBasisElem( one, initv,
fglmVector( 1, 1 ), nOne );
1073 while ( data.candidatesLeft() ==
TRUE ) {
1074 fglmDelem candidate = data.nextCandidate();
1085 fglmVector p( data.getBasisSize()+1, data.getBasisSize()+1 );
1086 number pdenom =
NULL;
1087 data.gaussreduce(
v,
p, pdenom );
1092 data.newGroebnerPoly(
p, candidate.
monom );
1102 data.updateCandidates( candidate.
monom, originalV );
1103 data.newBasisElem( candidate.
monom,
v,
p, pdenom );
1113 return ( data.buildIdeal() );
◆ internalCalculateFunctionals()
Definition at line 609 of file fglmzero.cc.
641 l.insertCols( candidate.
divisors, basis );
648 fglmASSERT( var > 0,
"this should never happen" );
656 l.endofConstruction();
bool isZero(const CFArray &A)
checks if entries of A are zero
void pNorm(poly p, const ring R=currRing)
#define idDelete(H)
delete an ideal
void rChangeCurrRing(ring r)
void newBorderElem(poly &m, fglmVector v)
#define STICKYPROT2(msg, arg)
fglmVector getVectorRep(const poly m)
static short rVar(const ring r)
#define rVar(r) (r->N)
void internalCalculateFunctionals(const ideal, idealFunctionals &l, fglmSdata &data)
#define omFreeSize(addr, size)
poly getSpanPoly(int number) const
int newBasisElem(poly &p)
static ideal FindUnivariatePolys(const idealFunctionals &l)
BOOLEAN isBasisOrEdge() const
int getEdgeNumber(const poly m) const
fglmVector getBorderDiv(const poly m, int &var) const
#define pSetCoeff(p, n)
deletes old coeff before setting the new one
#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 ideal GroebnerViaFunctionals(const idealFunctionals &l, fglmVector iv=fglmVector())
const Variable & v
< [in] a sqrfree bivariate poly
BOOLEAN isBasisOrEdge() const
static BOOLEAN CalculateFunctionals(const ideal &theIdeal, idealFunctionals &l)
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
fglmSelem nextCandidate()
BOOLEAN candidatesLeft() const
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 idMaxIdeal(D)
initialise the maximal ideal (at 0)