version 1.10, 2001/09/03 01:04:26 |
version 1.12, 2002/01/13 07:11:46 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2000/engine/Mgfs.c,v 1.9 2001/07/23 05:05:41 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2000/engine/Mgfs.c,v 1.11 2001/10/09 01:36:10 noro Exp $ */ |
|
|
#include "ca.h" |
#include "ca.h" |
|
|
extern int up_kara_mag, current_gfs_q1; |
extern int up_kara_mag, current_gfs_q1; |
extern int *current_gfs_plus1; |
extern int *current_gfs_plus1; |
|
|
void mulssfum(UM,int,UM); |
|
void kmulsfummain(UM,UM,UM); |
|
|
|
|
|
#if defined(__GNUC__) |
#if defined(__GNUC__) |
#define INLINE inline |
#define INLINE inline |
#elif defined(VISUAL) |
#elif defined(VISUAL) |
Line 17 void kmulsfummain(UM,UM,UM); |
|
Line 13 void kmulsfummain(UM,UM,UM); |
|
#define INLINE |
#define INLINE |
#endif |
#endif |
|
|
INLINE int _ADDSF(a,b) |
INLINE int _ADDSF(int a,int b) |
int a,b; |
|
{ |
{ |
if ( !a ) |
if ( !a ) |
return b; |
return b; |
|
|
} |
} |
} |
} |
|
|
INLINE int _MULSF(a,b) |
INLINE int _MULSF(int a,int b) |
int a,b; |
|
{ |
{ |
if ( !a || !b ) |
if ( !a || !b ) |
return 0; |
return 0; |
|
|
} |
} |
} |
} |
|
|
void addsfum(p1,p2,pr) |
void addsfum(UM p1,UM p2,UM pr) |
UM p1,p2,pr; |
|
{ |
{ |
int *c1,*c2,*cr,i,dmax,dmin; |
int *c1,*c2,*cr,i,dmax,dmin; |
|
|
|
|
DEG(pr) = dmax; |
DEG(pr) = dmax; |
} |
} |
|
|
void subsfum(p1,p2,pr) |
void subsfum(UM p1,UM p2,UM pr) |
UM p1,p2,pr; |
|
{ |
{ |
int *c1,*c2,*cr,i; |
int *c1,*c2,*cr,i; |
int dmax,dmin; |
int dmax,dmin; |
|
|
DEG(pr) = dmax; |
DEG(pr) = dmax; |
} |
} |
|
|
void gcdsfum(p1,p2,pr) |
void gcdsfum(UM p1,UM p2,UM pr) |
UM p1,p2,pr; |
|
{ |
{ |
int inv; |
int inv; |
UM t1,t2,q,tum; |
UM t1,t2,q,tum; |
|
|
mulssfum(t2,inv,pr); |
mulssfum(t2,inv,pr); |
} |
} |
} |
} |
void mulsfum(p1,p2,pr) |
|
UM p1,p2,pr; |
void mulsfum(UM p1,UM p2,UM pr) |
{ |
{ |
int *pc1,*pcr; |
int *pc1,*pcr; |
int *c1,*c2,*cr; |
int *c1,*c2,*cr; |
|
|
DEG(pr) = d1 + d2; |
DEG(pr) = d1 + d2; |
} |
} |
|
|
void mulssfum(p,n,pr) |
void mulssfum(UM p,int n,UM pr) |
int n; |
|
UM p,pr; |
|
{ |
{ |
int *sp,*dp; |
int *sp,*dp; |
int i; |
int i; |
|
|
*dp = _MULSF(*sp,n); |
*dp = _MULSF(*sp,n); |
} |
} |
|
|
void kmulsfum(n1,n2,nr) |
void kmulsfum(UM n1,UM n2,UM nr) |
UM n1,n2,nr; |
|
{ |
{ |
UM n,t,s,m,carry; |
UM n,t,s,m,carry; |
int d,d1,d2,len,i,l; |
int d,d1,d2,len,i,l; |
|
|
bcopy((char *)r0,(char *)COEF(nr),l*sizeof(int)); |
bcopy((char *)r0,(char *)COEF(nr),l*sizeof(int)); |
} |
} |
|
|
void kmulsfummain(n1,n2,nr) |
void kmulsfummain(UM n1,UM n2,UM nr) |
UM n1,n2,nr; |
|
{ |
{ |
int d1,d2,h,len; |
int d1,d2,h,len; |
UM n1lo,n1hi,n2lo,n2hi,hi,lo,mid1,mid2,mid,s1,s2,t1,t2; |
UM n1lo,n1hi,n2lo,n2hi,hi,lo,mid1,mid2,mid,s1,s2,t1,t2; |
|
|
copyum(t1,nr); |
copyum(t1,nr); |
} |
} |
|
|
int divsfum(p1,p2,pq) |
int divsfum(UM p1,UM p2,UM pq) |
UM p1,p2,pq; |
|
{ |
{ |
int *pc1,*pct; |
int *pc1,*pct; |
int *c1,*c2,*ct; |
int *c1,*c2,*ct; |
|
|
return i; |
return i; |
} |
} |
|
|
void diffsfum(f,fd) |
void diffsfum(UM f,UM fd) |
UM f,fd; |
|
{ |
{ |
int *dp,*sp; |
int *dp,*sp; |
int i; |
int i; |
|
|
degum(fd,DEG(f) - 1); |
degum(fd,DEG(f) - 1); |
} |
} |
|
|
void monicsfum(f) |
void monicsfum(UM f) |
UM f; |
|
{ |
{ |
int *sp; |
int *sp; |
int i,inv; |
int i,inv; |
|
|
*sp = _MULSF(*sp,inv); |
*sp = _MULSF(*sp,inv); |
} |
} |
|
|
int compsfum(a,b) |
int compsfum(UM a,UM b) |
UM a,b; |
|
{ |
{ |
int i,da,db; |
int i,da,db; |
|
|
Line 361 void mulsfarray_trunc(int,int *,int *,int *); |
|
Line 344 void mulsfarray_trunc(int,int *,int *,int *); |
|
|
|
/* f1 = f1->c[0]+f1->c[1]*y+..., f2 = f2->c[0]+f2->c[1]*y+... mod y^n */ |
/* f1 = f1->c[0]+f1->c[1]*y+..., f2 = f2->c[0]+f2->c[1]*y+... mod y^n */ |
|
|
void mulsfbm(f1,f2,fr) |
void mulsfbm(BM f1,BM f2,BM fr) |
BM f1,f2,fr; |
|
{ |
{ |
UM mul,t,s; |
UM mul,t,s; |
int i,j,h,d1,d2,dy; |
int i,j,d1,d2,dy; |
|
|
dy = MIN(DEG(f1),DEG(f2)); |
dy = MIN(DEG(f1),DEG(f2)); |
|
|
|
|
DEG(fr) = dy; |
DEG(fr) = dy; |
} |
} |
|
|
int degbm(f) |
int degbm(BM f) |
BM f; |
|
{ |
{ |
int d,i,dy; |
int d,i,dy; |
|
|
|
|
|
|
/* g += f */ |
/* g += f */ |
|
|
void addtosfbm(f,g) |
void addtosfbm(BM f,BM g) |
BM f,g; |
|
{ |
{ |
int i,d1,d2,dy; |
int i,d1,d2,dy; |
UM t; |
UM t; |
|
|
} |
} |
} |
} |
|
|
void eucsfum(f1,f2,a,b) |
void eucsfum(UM f1,UM f2,UM a,UM b) |
UM f1,f2,a,b; |
|
{ |
{ |
UM g1,g2,a1,a2,a3,wm,q,tum; |
UM g1,g2,a1,a2,a3,wm,q,tum; |
int d,dr; |
int d,dr; |
|
|
|
|
void shiftsfum(UM,int,UM); |
void shiftsfum(UM,int,UM); |
|
|
void shiftsflum(n,f,ev) |
void shiftsflum(int n,LUM f,int ev) |
int n; |
|
LUM f; |
|
int ev; |
|
{ |
{ |
int d,i,j; |
int d,i,j; |
UM w,w1; |
UM w,w1; |
|
|
|
|
/* f(x) -> g(x) = f(x+a) */ |
/* f(x) -> g(x) = f(x+a) */ |
|
|
void shiftsfum(f,a,g) |
void shiftsfum(UM f,int a,UM g) |
UM f; |
|
int a; |
|
UM g; |
|
{ |
{ |
int n,i; |
int n,i; |
UM pwr,xa,w,t; |
UM pwr,xa,w,t; |
|
|
|
|
/* f(y) -> f(y+a) */ |
/* f(y) -> f(y+a) */ |
|
|
void shiftsfbm(f,a) |
void shiftsfbm(BM f,int a) |
BM f; |
|
int a; |
|
{ |
{ |
int i,j,d,dy; |
int i,j,d,dy; |
UM pwr,ya,w,t,s; |
UM pwr,ya,w,t,s; |
|
|
} |
} |
} |
} |
|
|
void clearbm(n,f) |
void clearbm(int n,BM f) |
int n; |
|
BM f; |
|
{ |
{ |
int i,dy; |
int i,dy; |
UM *c; |
UM *c; |
|
|
dy = DEG(f); |
dy = DEG(f); |
for ( c = COEF(f), i = 0; i <= dy; i++ ) |
for ( c = COEF(f), i = 0; i <= dy; i++ ) |
clearum(c[i],n); |
clearum(c[i],n); |
|
} |
|
|
|
static void create_bmono(P c,V x,int i,V y,int j,P *mono); |
|
|
|
struct lb { |
|
int pos,len; |
|
int *r; |
|
int *hist; |
|
}; |
|
|
|
static NODE insert_lb(NODE g,struct lb *a) |
|
{ |
|
NODE prev,cur,n; |
|
|
|
prev = 0; cur = g; |
|
while ( cur ) { |
|
if ( a->pos < ((struct lb *)BDY(cur))->pos ) { |
|
MKNODE(n,a,cur); |
|
if ( !prev ) |
|
return n; |
|
else { |
|
NEXT(prev) = n; |
|
return g; |
|
} |
|
} else { |
|
prev = cur; |
|
cur = NEXT(cur); |
|
} |
|
} |
|
MKNODE(n,a,0); |
|
NEXT(prev) = n; |
|
return g; |
|
} |
|
|
|
static void lnf(int *r,int *h,int n,int len,NODE g) |
|
{ |
|
struct lb *t; |
|
int pos,i,j,len1,c; |
|
int *r1,*h1; |
|
|
|
for ( ; g; g = NEXT(g) ) { |
|
t = (struct lb *)BDY(g); |
|
pos = t->pos; |
|
if ( c = r[pos] ) { |
|
c = _chsgnsf(c); |
|
r1 = t->r; |
|
h1 = t->hist; |
|
len1 = t->len; |
|
for ( i = pos; i < n; i++ ) |
|
if ( r1[i] ) |
|
r[i] = _ADDSF(r[i],_MULSF(r1[i],c)); |
|
for ( i = 0; i < len1; i++ ) |
|
if ( h1[i] ) |
|
h[i] = _ADDSF(h[i],_MULSF(h1[i],c)); |
|
} |
|
} |
|
for ( i = 0; i < n && !r[i]; i++ ); |
|
if ( i < n ) { |
|
c = _invsf(r[i]); |
|
for ( j = i; j < n; j++ ) |
|
if ( r[j] ) |
|
r[j] = _MULSF(r[j],c); |
|
for ( j = 0; j < len; j++ ) |
|
if ( h[j] ) |
|
h[j] = _MULSF(h[j],c); |
|
} |
|
} |
|
|
|
void sfmintdeg(VL vl,P fx,int dy,int c,P *fr) |
|
{ |
|
V x,y; |
|
int dx,dxdy,i,j,k,l,d,len,len0,u,dyk; |
|
UP *rx; |
|
DCP dc; |
|
P t,f,mono,f1; |
|
UP ut,h; |
|
int ***nf; |
|
int *r,*hist,*prev,*r1; |
|
struct lb *lb; |
|
GFS s; |
|
NODE g; |
|
|
|
x = vl->v; |
|
y = NEXT(vl)->v; |
|
dx = getdeg(x,fx); |
|
dxdy = dx*dy; |
|
/* rx = -(fx-x^dx) */ |
|
rx = (UP *)CALLOC(dx,sizeof(UP)); |
|
for ( dc = DC(fx); dc; dc = NEXT(dc)) { |
|
chsgnp(COEF(dc),&t); |
|
ptoup(t,&ut); |
|
rx[QTOS(DEG(dc))] = ut; |
|
} |
|
/* nf[d] = normal form table of monomials with total degree d */ |
|
nf = (int ***)CALLOC(dx+dy+1,sizeof(int **)); /* xxx */ |
|
nf[0] = (int **)CALLOC(1,sizeof(int *)); |
|
|
|
/* nf[0][0] = 1 */ |
|
r = (int *)CALLOC(dxdy,sizeof(int)); |
|
r[0] = _onesf(); |
|
nf[0][0] = r; |
|
|
|
hist = (int *)CALLOC(1,sizeof(int)); |
|
hist[0] = _onesf(); |
|
|
|
lb = (struct lb *)CALLOC(1,sizeof(struct lb)); |
|
lb->pos = 0; |
|
lb->r = r; |
|
lb->hist = hist; |
|
lb->len = 1; |
|
|
|
/* g : table of normal form as linear form */ |
|
MKNODE(g,lb,0); |
|
|
|
len = 1; |
|
h = UPALLOC(dy); |
|
for ( d = 1; ; d++ ) { |
|
if ( d > c ){ |
|
return; |
|
} |
|
nf[d] = (int **)CALLOC(d+1,sizeof(int *)); |
|
len0 = len; |
|
len += d+1; |
|
|
|
for ( i = d; i >= 0; i-- ) { |
|
/* nf(x^(d-i)*y^i) = nf(y*nf(x^(d-i)*y^(i-1))) */ |
|
/* nf(x^d) = nf(nf(x^(d-1))*x) */ |
|
r = (int *)CALLOC(dxdy,sizeof(int)); |
|
if ( i == 0 ) { |
|
prev = nf[d-1][0]; |
|
bcopy(prev,r+dy,(dxdy-dy)*sizeof(int)); |
|
|
|
/* create the head coeff */ |
|
for ( l = 0, k = dxdy-dy; l < dy; l++, k++ ) { |
|
if ( prev[k] ) { |
|
u = IFTOF(prev[k]); |
|
MKGFS(u,s); |
|
} else |
|
s = 0; |
|
COEF(h)[l] = (Num)s; |
|
} |
|
for ( l = dy-1; l >= 0 && !COEF(h)[l]; l--); |
|
DEG(h) = l; |
|
|
|
for ( k = 0, dyk = 0; k < dx; k++, dyk += dy ) { |
|
tmulup(rx[k],h,dy,&ut); |
|
if ( ut ) |
|
for ( l = 0; l < dy; l++ ) { |
|
s = (GFS)COEF(ut)[l]; |
|
if ( s ) { |
|
u = CONT(s); |
|
r[dyk+l] = _ADDSF(r[dyk+l],FTOIF(u)); |
|
} |
|
} |
|
} |
|
} else { |
|
prev = nf[d-1][i-1]; |
|
for ( k = 0, dyk = 0; k < dx; k++, dyk += dy ) { |
|
for ( l = 1; l < dy; l++ ) |
|
r[dyk+l] = prev[dyk+l-1]; |
|
} |
|
} |
|
nf[d][i] = r; |
|
hist = (int *)CALLOC(len,sizeof(int)); |
|
hist[len0+i] = _onesf(); |
|
r1 = (int *)CALLOC(dxdy,sizeof(int)); |
|
bcopy(r,r1,dxdy*sizeof(int)); |
|
lnf(r1,hist,dxdy,len,g); |
|
for ( k = 0; k < dxdy && !r1[k]; k++ ); |
|
if ( k == dxdy ) { |
|
f = 0; |
|
for ( k = j = 0; k <= d; k++ ) |
|
for ( i = 0; i <= k; i++, j++ ) |
|
if ( hist[j] ) { |
|
u = IFTOF(hist[j]); |
|
MKGFS(u,s); |
|
/* mono = s*x^(k-i)*y^i */ |
|
create_bmono((P)s,x,k-i,y,i,&mono); |
|
addp(vl,f,mono,&f1); |
|
f = f1; |
|
} |
|
*fr = f; |
|
return; |
|
} else { |
|
lb = (struct lb *)CALLOC(1,sizeof(struct lb)); |
|
lb->pos = k; |
|
lb->r = r1; |
|
lb->hist = hist; |
|
lb->len = len; |
|
g = insert_lb(g,lb); |
|
} |
|
} |
|
} |
|
} |
|
|
|
static void create_bmono(P c,V x,int i,V y,int j,P *mono) |
|
{ |
|
P t,s; |
|
|
|
if ( !i ) |
|
if ( !j ) |
|
t = c; |
|
else { |
|
/* c*y^j */ |
|
MKV(y,t); |
|
COEF(DC(t)) = c; |
|
STOQ(j,DEG(DC(t))); |
|
} |
|
else if ( !j ) { |
|
/* c*x^i */ |
|
MKV(x,t); |
|
COEF(DC(t)) = c; |
|
STOQ(i,DEG(DC(t))); |
|
} else { |
|
MKV(y,s); |
|
COEF(DC(s)) = c; |
|
STOQ(j,DEG(DC(s))); |
|
MKV(x,t); |
|
COEF(DC(t)) = s; |
|
STOQ(i,DEG(DC(t))); |
|
} |
|
*mono = t; |
} |
} |