| version 1.4, 2005/06/09 04:09:22 |
version 1.5, 2005/06/16 06:54:55 |
|
|
| /* $OpenXM: OpenXM/src/kan96xx/Kan/gbGM.c,v 1.3 2001/05/04 01:06:23 takayama Exp $ */ |
/* $OpenXM: OpenXM/src/kan96xx/Kan/gbGM.c,v 1.4 2005/06/09 04:09:22 takayama Exp $ */ |
| /* gbGM.c GM=Gebauer and Moller |
/* gbGM.c GM=Gebauer and Moller |
| */ |
*/ |
| |
|
| Line 340 struct polySet_gm markRedundant_gm(g,j) |
|
| Line 340 struct polySet_gm markRedundant_gm(g,j) |
|
| |
|
| |
|
| |
|
| struct gradedPolySet *groebner_gm(f,needBack,needSyz,grP,countDown,forceReduction,reduceOnly) |
struct gradedPolySet *groebner_gm(f,needBack,needSyz,grP,countDown,forceReduction,reduceOnly,gbCheck) |
| struct arrayOfPOLY *f; |
struct arrayOfPOLY *f; |
| int needBack; |
int needBack; |
| int needSyz; |
int needSyz; |
| Line 348 struct gradedPolySet *groebner_gm(f,needBack,needSyz,g |
|
| Line 348 struct gradedPolySet *groebner_gm(f,needBack,needSyz,g |
|
| int countDown; |
int countDown; |
| int forceReduction; |
int forceReduction; |
| int reduceOnly; |
int reduceOnly; |
| |
int gbCheck; |
| { |
{ |
| int r; |
int r; |
| struct pair_gm top; |
struct pair_gm top; |
| Line 366 struct gradedPolySet *groebner_gm(f,needBack,needSyz,g |
|
| Line 367 struct gradedPolySet *groebner_gm(f,needBack,needSyz,g |
|
| if (needBack || needSyz) { |
if (needBack || needSyz) { |
| fprintf(stderr,"Warning: groebner_gm() does not compute the backward transformation and syzygies.\n"); |
fprintf(stderr,"Warning: groebner_gm() does not compute the backward transformation and syzygies.\n"); |
| } |
} |
| if (reduceOnly) { |
if (reduceOnly || gbCheck) { |
| fprintf(stderr,"Warning: groebner_gm() does not implement reduceOnly.\n"); |
fprintf(stderr,"Warning: groebner_gm() does not implement reduceOnly/gbCheck.\n"); |
| } |
} |
| |
|
| #ifdef STATISTICS |
#ifdef STATISTICS |
| Line 447 struct gradedPolySet *groebner_gm(f,needBack,needSyz,g |
|
| Line 448 struct gradedPolySet *groebner_gm(f,needBack,needSyz,g |
|
| #endif |
#endif |
| |
|
| ans = newGradedPolySet(1); |
ans = newGradedPolySet(1); |
| |
ans->gb = 1; |
| for (i=0; i<ans->lim; i++) { |
for (i=0; i<ans->lim; i++) { |
| ans->polys[i] = newPolySet(1); |
ans->polys[i] = newPolySet(1); |
| } |
} |
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to gbGM.c CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM / src / kan96xx / Kan