 |
My Project
debian-1:4.1.1-p2+ds-4
|
Go to the source code of this file.
◆ fglmASSERT
#define fglmASSERT |
( |
|
ignore1, |
|
|
|
ignore2 |
|
) |
| |
◆ PROT
◆ PROT2
#define PROT2 |
( |
|
msg, |
|
|
|
arg |
|
) |
| |
◆ STICKYPROT
◆ STICKYPROT2
◆ fglmLinearCombination()
poly fglmLinearCombination |
( |
ideal |
source, |
|
|
poly |
monset |
|
) |
| |
Definition at line 416 of file fglmcomb.cc.
432 while ( temp !=
NULL ) {
446 for (
k= 0;
k < numMonoms;
k++ ) {
447 poly mon=
pHead( temp );
459 while ( sm !=
NULL ) {
466 if ( basisSize == basisMax ) {
467 basis= (
polyset)
omReallocSize( basis, basisMax *
sizeof( poly ), (basisMax + basisBS ) *
sizeof( poly ) );
470 basis[basisSize]=
pHead( sm );
483 for (
k= 0;
k < numMonoms;
k++ ) {
484 #ifndef HAVE_EXPLICIT_CONSTR
485 v[
k].mac_constr_i( basisSize );
487 v[
k].fglmVector( basisSize );
491 while ( mon !=
NULL ) {
501 v[
k].setelem(
b+1, coeff );
513 p= gauss.getDependence();
520 number
gcd =
p.gcd();
524 for (
k= 1;
k <=
p.size();
k++ ) {
525 if ( !
p.elemIsZero(
k ) ) {
528 comb=
pAdd( comb, temp );
535 for (
k= 0;
k < numMonoms;
k++ ) {
544 for (
k= 0;
k < basisSize;
k++ )
◆ fglmNewLinearCombination()
poly fglmNewLinearCombination |
( |
ideal |
source, |
|
|
poly |
monset |
|
) |
| |
Definition at line 154 of file fglmcomb.cc.
164 int basisMax = basisBS;
166 int * weights =
NULL;
167 int * lengthes =
NULL;
180 for (
k= 0;
k < numMonoms;
k++ ) {
191 #ifndef HAVE_EXPLICIT_CONSTR
197 #ifndef HAVE_EXPLICIT_CONSTR
209 poly temp= (source->m)[
k];
211 while ( temp !=
NULL ) {
219 lengthes= (
int *)
omAlloc( numMonoms *
sizeof(
int ) );
220 order= (
int *)
omAlloc( numMonoms *
sizeof(
int ) );
223 for (
k= 0;
k < numMonoms;
k++ )
229 fglmReduce( & current, currV,
m, numMonoms, source, weights );
232 while ( temp !=
NULL )
244 if ( basisSize == basisMax )
247 basis= (
polyset)
omReallocSize( basis, basisMax *
sizeof( poly ), (basisMax + basisBS ) *
sizeof( poly ) );
253 basis[basisSize]=
pLmInit(temp);
260 #ifndef HAVE_EXPLICIT_CONSTR
261 mv[
k].mac_constr( currV );
268 for (
k= 0;
k < numMonoms;
k++ ) {
271 #ifndef HAVE_EXPLICIT_CONSTR
272 v[
k].mac_constr_i( basisSize );
274 v[
k].fglmVector( basisSize );
277 while ( mon !=
NULL ) {
289 v[
k].setelem(
b+1, coeff );
300 for (
k= 0;
k < basisSize;
k++ )
309 for (
k= 0;
k < numMonoms;
k++ ) {
310 lengthes[
k]=
v[
k].numNonZeroElems();
318 for (
k= numMonoms - 1;
k >= 0;
k-- ) {
319 if ( lengthes[
k] > 0 ) {
324 if ( lengthes[
k] < lengthes[best-1] ) {
333 if ( (
isZero= gauss.reduce(
v[best-1] )) ==
TRUE ) {
334 p= gauss.getDependence();
341 #ifndef HAVE_EXPLICIT_CONSTR
342 v[best-1].clearelems();
344 v[best-1].~fglmVector();
349 number
gcd =
p.gcd();
355 for (
k= 0;
k <
p.size();
k++ ) {
356 if ( !
p.elemIsZero(
k+1 ) ) {
357 temp+=
p.getconstelem(
k+1 ) * mv[order[
k]];
369 for (
k= 1;
k <= numMonoms;
k++ ) {
370 if ( ! temp.elemIsZero(
k ) ) {
389 #ifndef HAVE_EXPLICIT_CONSTR
395 for (
k= 0;
k < basisSize;
k++ )
399 #ifndef HAVE_EXPLICIT_CONSTR
402 for (
k= 0;
k < numMonoms;
k++ )
407 for (
k= 0;
k < numMonoms;
k++ )
◆ fglmquot()
BOOLEAN fglmquot |
( |
ideal |
sourceIdeal, |
|
|
poly |
quot, |
|
|
ideal & |
destIdeal |
|
) |
| |
◆ fglmzero()
Definition at line 1195 of file fglmzero.cc.
1206 if ( deleteIdeal ==
TRUE )
1209 if ( fglmok ==
TRUE )
1211 L.map( sourceRing );
1214 if ( (switchBack) && (
currRing != initialRing) )
bool isZero(const CFArray &A)
checks if entries of A are zero
#define idDelete(H)
delete an ideal
void rChangeCurrRing(ring r)
fglmVector(fglmVectorRep *rep)
static unsigned pLength(poly a)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
static short rVar(const ring r)
#define rVar(r) (r->N)
#define omFreeSize(addr, size)
poly p_Cleardenom(poly p, const ring r)
static void fglmReduce(poly *pptr, fglmVector &v, polyset m, int numMonoms, ideal source, int *w)
poly kNF(ideal F, ideal Q, poly p, int syzComp, int lazyReduce)
#define pLmInit(p)
like pInit, except that expvector is initialized to that of p, p must be != NULL
#define pSetCoeff(p, n)
deletes old coeff before setting the new one
#define STICKYPROT2(msg, arg)
static ideal GroebnerViaFunctionals(const idealFunctionals &l, fglmVector iv=fglmVector())
const Variable & v
< [in] a sqrfree bivariate poly
static BOOLEAN CalculateFunctionals(const ideal &theIdeal, idealFunctionals &l)
#define pCopy(p)
return a copy of the poly
#define pHead(p)
returns newly allocated copy of Lm(p), coef is copied, next=NULL, p might be NULL
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
#define omReallocSize(addr, o_size, size)