Annotation of OpenXM/src/kan96xx/Kan/gradedset.h, Revision 1.6
1.6 ! takayama 1: /* $OpenXM: OpenXM/src/kan96xx/Kan/gradedset.h,v 1.5 2003/07/30 09:00:52 takayama Exp $ */
1.1 maekawa 2: /* gradedset.h */
3: #define max(a,b) (a>b?a:b)
4:
5: /* You may use only ppAdd() and cpMult() for the elements of SyzRingp. */
6: #define srGrade(s) ((s)->m->e[0].x) /* s is in the SyzRingp */
7: #define srIndex(s) ((s)->m->e[0].D)
8: #define srSyzCoeffToPOLY(s) ((s)->val.f)
9:
10:
11: /* gradedset.c */
12: void errorGradedSet(char *s);
13: void warningGradedSet(char *s);
14: struct polySet *newPolySet(int n);
15: struct pair *newPair(struct pair *prev);
16: struct pair *pairCopy(struct pair *node);
17: struct gradedPolySet *newGradedPolySet(int n);
18: struct gradedPairs *newGradedPairs(int n);
19: struct gradedPairs *enlargeGradedPairs(int size,struct gradedPairs *grD);
20: void insertPair(struct pair *inode,struct pair *before);
21: /* insert inode after before */
22: struct pair *deletePair(struct pair *p); /* delete p->next and returns
23: p->next */
24: struct pair *getPair(struct gradedPairs *grD);
25: void whereInG(struct gradedPolySet *g, POLY fi, int *gradep, int *indexp,int sugar);
26: struct gradedPolySet *putPolyInG(struct gradedPolySet *g, POLY fi, int grade,
27: int index,struct syz0 *syz,int mark,int serial);
28: void markRedundant(struct gradedPolySet *g,POLY gt,int grade,int index,int sugar);
29: void markRedundant0(struct gradedPolySet *g,int grade,int index);
30: struct syz0 *newSyz0(void);
31: struct gradedPairs *putPairInGradedPairs(struct gradedPairs *grP,
32: struct pair *top);
33: void outputGradedPolySet(struct gradedPolySet *grG,int needSyz);
34: void outputGradedPairs(struct gradedPairs *grP);
35: void outputNode(struct pair *p);
36: int countPairs(struct gradedPairs *grD);
37: int countGradedPolySet(struct gradedPolySet *grD);
38: struct gradedPolySet *gradedPolySetCopy(struct gradedPolySet *grG);
39: int deletePairByCriterion2B(struct gradedPairs *grD,POLY gt,struct gradedPolySet *grG);
1.5 takayama 40: int markGeneratorInG(struct gradedPolySet *g,int grade,int index);
1.6 ! takayama 41: int clearGmod(struct gradedPolySet *g);
1.1 maekawa 42:
43: /* red.c */
44: struct spValue (*sp)(POLY f,POLY g);
45: int (*isReducible)(POLY f,POLY g);
46: POLY (*reduction1)(POLY f,POLY g,int needSyz,POLY *cc,POLY *cg);
47: /* if needSyz, then result = *cc f + *cg g. */
48: /* syzp->cf is in the CurrentRignp and syzp->syz is in the SyzRingp. */
49: POLY (*reduction)(POLY f,struct gradedPolySet *gset,int needSyz,
50: struct syz0 *syzp);
51: POLY (*isCdrReducible)(POLY f,POLY g);
52: POLY (*reduction1Cdr)(POLY f,POLY fs,POLY g,int needSyz,POLY *cc,POLY *cg);
53: /* if needSyz, then result = *cc f + *cg g. */
54: POLY (*reductionCdr)(POLY f,struct gradedPolySet *gset,int needSyz,
55: struct syz0 *syzp);
56: POLY (*lcm)(POLY f,POLY g);
57: POLY reduction1_gen(POLY f,POLY g,int needSyz,POLY *cc,POLY *cg);
58: POLY reduction1_gen_debug(POLY f,POLY g,int needSyz,POLY *cc,POLY *cg);
59: POLY reduction1_sugar(POLY f,POLY g,int needSyz,POLY *c,POLY *h,int sugarGrade);
60: int isReducible_gen(POLY f,POLY g);
61: POLY reduction_gen(POLY f,struct gradedPolySet *gset,int needSyz,
62: struct syz0 *syzp);
63: POLY reduction_gen_rev(POLY f,struct gradedPolySet *gset,int needSyz,
64: struct syz0 *syzp);
65: POLY reduction_sugar(POLY f,struct gradedPolySet *gset,int needSyz,
66: struct syz0 *syzp,int sugarGrade);
67: POLY reduction1Cdr_gen(POLY f,POLY fs,POLY g,int needSyz,POLY *cc,POLY *cg);
68: POLY isCdrReducible_gen(POLY f,POLY g);
69: POLY reductionCdr_gen(POLY f,struct gradedPolySet *gset,int needSyz,
70: struct syz0 *syzp);
71: POLY lcm_gen(POLY f,POLY g);
72: struct spValue sp_gen(POLY f,POLY g);
73: struct spValue sp_q(POLY f,POLY g);
74: int grade_gen(POLY f);
1.3 takayama 75: POLY reductionCdr_except_grd_i(POLY f,struct gradedPolySet *gset,
76: int needSyz,struct syz0 *syzp,
77: int grd,int i, int *reduced);
78: /* Polynomial at (grd,i) is not used for reduction.
79: if del[j] == 1, then the attached polynomial is not used for reduction.*/
1.4 takayama 80:
81: /* ecart.c */
82: POLY reduction_ecart(POLY f,struct gradedPolySet *gset,
83: int needSyz,struct syz0 *syzp);
1.1 maekawa 84:
85: /* constructor */
86: POLY toSyzPoly(POLY cg,int grade,int index);
87: struct coeff *toSyzCoeff(POLY f);
88: void initSyzRingp(void);
89:
90: /* gb.c */
91: struct gradedPolySet *(*groebner)(struct arrayOfPOLY *f,
92: int needBack,
93: int needSyz, struct pair **grP,
94: int countDown,int forceReduction);
95: struct gradedPolySet *groebner_gen(struct arrayOfPOLY *f,
96: int needBack,
97: int needSyz, struct pair **grP,
98: int countDown,int forceReduction);
99: struct gradedPairs *updatePairs(struct gradedPairs *grD, POLY gt,
100: int gtGrade, int t,
101: struct gradedPolySet *grG);
102: /* add gt to grD. gt is indexed by (gtGrade,t) */
1.3 takayama 103: void toReducedBasis(struct gradedPolySet *grP,int needBack, int needSyz);
104:
1.1 maekawa 105:
106: /* gbGM.c */
107: struct gradedPolySet *groebner_gm(struct arrayOfPOLY *f,
108: int needBack,
109: int needSyz, struct pair **grP,
110: int countDown,int forceReduction);
111:
112: /* syz0 */
113: void simplifyBT(int grd,int index, struct gradedPolySet *grG);
114: /* grG->polys[i]->syz[j],mark[j] is modified. */
115:
116: void getBackwardTransformation(struct gradedPolySet *grG);
117: /* grG->polys[i]->syz[j],mark[j] is modified. */
118:
119: struct arrayOfPOLY *getSyzygy0(struct gradedPolySet *grG,
120: struct pair *zeroPairs);
121: /* grG->polys[i]->mark[j] are modified.
122: grG->polys[i]->del[j] and syz[j] must be set.
123: syz[j] is the result of the reduction by grBases. cf. getSyzygy(). */
124:
125: struct matrixOfPOLY *getSyzygy(struct gradedPolySet *grG,struct pair *zp,
126: struct gradedPolySet **grBasesp,
127: struct matrixOfPOLY **backwardMatp);
128: /* grBasesp is also returned. */
129:
130: POLY getSyzPolyFromSp(struct pair *spij,struct gradedPolySet *grG);
131: /* del and syz of grG and grBases must be properly set. mark of grG
132: will be modified. */
133:
134: struct matrixOfPOLY *getBackwardMatrixOfPOLY(struct gradedPolySet *grG);
135: /* get B */
136:
137: struct matrixOfPOLY *getSyzygy1(struct matrixOfPOLY *b,struct matrixOfPOLY *nc,
138: struct arrayOfPOLY *dc);
139:
140: struct matrixOfPOLY *getNC(struct gradedPolySet *newG,int n,
141: struct gradedPolySet *grBases);
142: /* get the numerator of C */
143:
144: struct arrayOfPOLY *getDC(struct gradedPolySet *newG);
145: /* diag(DC) f + C G = 0. */
146:
147: void errorSyz0(char *s);
148:
149: /* conversion */
150: struct arrayOfPOLY *syzPolyToArrayOfPOLY(int size,POLY f,
151: struct gradedPolySet *grG);
152: /* f is in SyzRingp. */
153:
154:
155: #define checkRingSp(f,g,r) {\
156: if ((f)->m->ringp != (g)->m->ringp) {\
157: warningPoly("f and g must be in a same ring. Returns 0.\n");\
158: fprintf(stderr,"f=%s\n",POLYToString(f,'*',0));\
159: fprintf(stderr,"g=%s\n",POLYToString(g,'*',0));\
160: r.a = ZERO; r.b = ZERO;\
161: return(r);\
162: }\
163: }
164:
165: #define checkRingIsR(f,g) {\
166: if ((f)->m->ringp != (g)->m->ringp) {\
167: warningPoly("f and g must be in a same ring. Returns 0.\n");\
168: fprintf(stderr,"f=%s\n",POLYToString(f,'*',0));\
169: fprintf(stderr,"g=%s\n",POLYToString(g,'*',0));\
170: return(0);\
171: }\
172: }
173:
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to gradedset.h CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM / src / kan96xx / Kan