version 1.3, 2001/05/04 01:06:23 |
version 1.6, 2005/07/03 11:08:53 |
|
|
/* $OpenXM: OpenXM/src/kan96xx/Kan/gbGM.c,v 1.2 2000/01/16 07:55:38 takayama Exp $ */ |
/* $OpenXM: OpenXM/src/kan96xx/Kan/gbGM.c,v 1.5 2005/06/16 06:54:55 takayama Exp $ */ |
/* gbGM.c GM=Gebauer and Moller |
/* gbGM.c GM=Gebauer and Moller |
*/ |
*/ |
|
|
#include <stdio.h> |
#include <stdio.h> |
|
#include <stdlib.h> |
#include "datatype.h" |
#include "datatype.h" |
#include "extern2.h" |
#include "extern2.h" |
#include "matrix.h" |
#include "matrix.h" |
Line 340 struct polySet_gm markRedundant_gm(g,j) |
|
Line 341 struct polySet_gm markRedundant_gm(g,j) |
|
|
|
|
|
|
|
struct gradedPolySet *groebner_gm(f,needBack,needSyz,grP,countDown,forceReduction) |
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; |
struct pair **grP; |
struct pair **grP; |
int countDown; |
int countDown; |
int forceReduction; |
int forceReduction; |
|
int reduceOnly; |
|
int gbCheck; |
{ |
{ |
int r; |
int r; |
struct pair_gm top; |
struct pair_gm top; |
Line 365 struct gradedPolySet *groebner_gm(f,needBack,needSyz,g |
|
Line 368 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 || gbCheck) { |
|
fprintf(stderr,"Warning: groebner_gm() does not implement reduceOnly/gbCheck.\n"); |
|
} |
|
|
#ifdef STATISTICS |
#ifdef STATISTICS |
CountE = 0; |
CountE = 0; |
Line 443 struct gradedPolySet *groebner_gm(f,needBack,needSyz,g |
|
Line 449 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); |
} |
} |