version 1.121, 2004/12/09 08:56:43 |
version 1.125, 2005/02/09 08:32:32 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.120 2004/12/07 15:15:52 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.124 2005/02/09 07:58:43 noro Exp $ */ |
|
|
#include "nd.h" |
#include "nd.h" |
|
|
Line 1537 ND normalize_pbucket(int mod,PGeoBucket g) |
|
Line 1537 ND normalize_pbucket(int mod,PGeoBucket g) |
|
return r; |
return r; |
} |
} |
|
|
void do_diagonalize(int sugar,int m) |
int do_diagonalize(int sugar,int m) |
{ |
{ |
int i,nh,stat; |
int i,nh,stat; |
NODE r,g,t; |
NODE r,g,t; |
Line 1553 void do_diagonalize(int sugar,int m) |
|
Line 1553 void do_diagonalize(int sugar,int m) |
|
nfv = nd_ps[i]; |
nfv = nd_ps[i]; |
s = ndvtond(m,nfv); |
s = ndvtond(m,nfv); |
s = nd_separate_head(s,&head); |
s = nd_separate_head(s,&head); |
nd_nf(m,s,nd_ps,1,&dn,&nf); |
stat = nd_nf(m,s,nd_ps,1,&dn,&nf); |
|
if ( !stat ) return 0; |
if ( !m ) { |
if ( !m ) { |
NTOQ(NM(dn.z),SGN(dn.z),num); |
NTOQ(NM(dn.z),SGN(dn.z),num); |
mulq(HCQ(head),num,&q); HCQ(head) = q; |
mulq(HCQ(head),num,&q); HCQ(head) = q; |
Line 1574 void do_diagonalize(int sugar,int m) |
|
Line 1575 void do_diagonalize(int sugar,int m) |
|
} else |
} else |
nd_ps[i] = nfv; |
nd_ps[i] = nfv; |
} |
} |
|
return 1; |
} |
} |
|
|
/* return value = 0 => input is not a GB */ |
/* return value = 0 => input is not a GB */ |
Line 1599 NODE nd_gb(int m,int ishomo,int checkonly) |
|
Line 1601 NODE nd_gb(int m,int ishomo,int checkonly) |
|
again: |
again: |
l = nd_minp(d,&d); |
l = nd_minp(d,&d); |
if ( SG(l) != sugar ) { |
if ( SG(l) != sugar ) { |
if ( ishomo ) do_diagonalize(sugar,m); |
if ( ishomo ) { |
|
stat = do_diagonalize(sugar,m); |
|
if ( !stat ) { |
|
NEXT(l) = d; d = l; |
|
d = nd_reconstruct(0,d); |
|
goto again; |
|
} |
|
} |
sugar = SG(l); |
sugar = SG(l); |
if ( DP_Print ) fprintf(asir_out,"%d",sugar); |
if ( DP_Print ) fprintf(asir_out,"%d",sugar); |
} |
} |
|
|
return g; |
return g; |
} |
} |
|
|
void do_diagonalize_trace(int sugar,int m) |
int do_diagonalize_trace(int sugar,int m) |
{ |
{ |
int i,nh,stat; |
int i,nh,stat; |
NODE r,g,t; |
NODE r,g,t; |
Line 1659 void do_diagonalize_trace(int sugar,int m) |
|
Line 1667 void do_diagonalize_trace(int sugar,int m) |
|
/* for nd_ps */ |
/* for nd_ps */ |
s = ndvtond(m,nd_ps[i]); |
s = ndvtond(m,nd_ps[i]); |
s = nd_separate_head(s,&head); |
s = nd_separate_head(s,&head); |
nd_nf_pbucket(m,s,nd_ps,1,&nf); |
stat = nd_nf_pbucket(m,s,nd_ps,1,&nf); |
|
if ( !stat ) return 0; |
nf = nd_add(m,head,nf); |
nf = nd_add(m,head,nf); |
ndv_free(nd_ps[i]); |
ndv_free(nd_ps[i]); |
nd_ps[i] = ndtondv(m,nf); |
nd_ps[i] = ndtondv(m,nf); |
Line 1672 void do_diagonalize_trace(int sugar,int m) |
|
Line 1681 void do_diagonalize_trace(int sugar,int m) |
|
nfv = nd_ps_trace[i]; |
nfv = nd_ps_trace[i]; |
s = ndvtond(0,nfv); |
s = ndvtond(0,nfv); |
s = nd_separate_head(s,&head); |
s = nd_separate_head(s,&head); |
nd_nf(0,s,nd_ps_trace,1,&dn,&nf); |
stat = nd_nf(0,s,nd_ps_trace,1,&dn,&nf); |
|
if ( !stat ) return 0; |
NTOQ(NM(dn.z),SGN(dn.z),num); |
NTOQ(NM(dn.z),SGN(dn.z),num); |
mulq(HCQ(head),num,&q); HCQ(head) = q; |
mulq(HCQ(head),num,&q); HCQ(head) = q; |
if ( DN(dn.z) ) { |
if ( DN(dn.z) ) { |
Line 1691 void do_diagonalize_trace(int sugar,int m) |
|
Line 1701 void do_diagonalize_trace(int sugar,int m) |
|
} else |
} else |
nd_ps_trace[i] = nfv; |
nd_ps_trace[i] = nfv; |
} |
} |
|
return 1; |
} |
} |
|
|
static struct oEGT eg_invdalg; |
static struct oEGT eg_invdalg; |
Line 1721 NODE nd_gb_trace(int m,int ishomo) |
|
Line 1732 NODE nd_gb_trace(int m,int ishomo) |
|
again: |
again: |
l = nd_minp(d,&d); |
l = nd_minp(d,&d); |
if ( SG(l) != sugar ) { |
if ( SG(l) != sugar ) { |
if ( ishomo ) do_diagonalize_trace(sugar,m); |
if ( ishomo ) { |
|
stat = do_diagonalize_trace(sugar,m); |
|
if ( !stat ) { |
|
NEXT(l) = d; d = l; |
|
d = nd_reconstruct(1,d); |
|
goto again; |
|
} |
|
} |
sugar = SG(l); |
sugar = SG(l); |
if ( DP_Print ) fprintf(asir_out,"%d",sugar); |
if ( DP_Print ) fprintf(asir_out,"%d",sugar); |
} |
} |
Line 2348 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
Line 2366 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
break; |
break; |
} |
} |
nd_nalg = 0; |
nd_nalg = 0; |
|
av = 0; |
if ( !m ) { |
if ( !m ) { |
get_algtree((Obj)f,&av); |
get_algtree((Obj)f,&av); |
for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++ ); |
for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++ ); |
Line 2468 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
Line 2487 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru |
|
if ( in0 ) NEXT(in) = 0; |
if ( in0 ) NEXT(in) = 0; |
if ( fd0 ) NEXT(fd) = 0; |
if ( fd0 ) NEXT(fd) = 0; |
if ( !ishomo && homo ) { |
if ( !ishomo && homo ) { |
for ( t = in0, wmax = 0; t; t = NEXT(t) ) { |
for ( t = in0, wmax = max; t; t = NEXT(t) ) { |
c = (NDV)BDY(t); len = LEN(c); |
c = (NDV)BDY(t); len = LEN(c); |
for ( a = BDY(c), i = 0; i < len; i++, NMV_ADV(a) ) |
for ( a = BDY(c), i = 0; i < len; i++, NMV_ADV(a) ) |
wmax = MAX(TD(DL(a)),wmax); |
wmax = MAX(TD(DL(a)),wmax); |
Line 3396 ND nd_quo(int mod,PGeoBucket bucket,NDV d) |
|
Line 3415 ND nd_quo(int mod,PGeoBucket bucket,NDV d) |
|
ND p,t,r; |
ND p,t,r; |
N tnm; |
N tnm; |
|
|
if ( !p ) return 0; |
if ( bucket->m < 0 ) return 0; |
else { |
else { |
nv = NV(d); |
nv = NV(d); |
mq0 = 0; |
mq0 = 0; |
Line 3517 ND nd_dup(ND p) |
|
Line 3536 ND nd_dup(ND p) |
|
void ndv_mod(int mod,NDV p) |
void ndv_mod(int mod,NDV p) |
{ |
{ |
NMV t,d; |
NMV t,d; |
int r; |
int r,s,u; |
int i,len,dlen; |
int i,len,dlen; |
Obj gfs; |
Obj gfs; |
|
|
Line 3539 void ndv_mod(int mod,NDV p) |
|
Line 3558 void ndv_mod(int mod,NDV p) |
|
if ( r ) { |
if ( r ) { |
if ( SGN(CQ(t)) < 0 ) |
if ( SGN(CQ(t)) < 0 ) |
r = mod-r; |
r = mod-r; |
|
if ( DN(CQ(t)) ) { |
|
s = rem(DN(CQ(t)),mod); |
|
if ( !s ) |
|
error("ndv_mod : division by 0"); |
|
s = invm(s,mod); |
|
DMAR(r,s,0,mod,u); r = u; |
|
} |
CM(d) = r; |
CM(d) = r; |
ndl_copy(DL(t),DL(d)); |
ndl_copy(DL(t),DL(d)); |
NMV_ADV(d); |
NMV_ADV(d); |
Line 5071 void nd_det(int mod,MAT f,P *rp) |
|
Line 5097 void nd_det(int mod,MAT f,P *rp) |
|
int n,i,j,max,e,nvar,sgn,k0,l0,len0,len,k,l,a; |
int n,i,j,max,e,nvar,sgn,k0,l0,len0,len,k,l,a; |
pointer **m; |
pointer **m; |
Q mone; |
Q mone; |
|
P **w; |
|
P mp; |
NDV **dm; |
NDV **dm; |
NDV *t,*mi,*mj; |
NDV *t,*mi,*mj; |
NDV d,s,mij,mjj; |
NDV d,s,mij,mjj; |
Line 5086 void nd_det(int mod,MAT f,P *rp) |
|
Line 5114 void nd_det(int mod,MAT f,P *rp) |
|
if ( f->row != f->col ) |
if ( f->row != f->col ) |
error("nd_det : non-square matrix"); |
error("nd_det : non-square matrix"); |
n = f->row; |
n = f->row; |
for ( nvar = 0, tv = fv; tv; tv = NEXT(tv), nvar++ ); |
|
m = f->body; |
m = f->body; |
|
for ( nvar = 0, tv = fv; tv; tv = NEXT(tv), nvar++ ); |
|
|
|
if ( !nvar ) { |
|
if ( !mod ) |
|
detp(CO,(P **)m,n,rp); |
|
else { |
|
w = (P **)almat_pointer(n,n); |
|
for ( i = 0; i < n; i++ ) |
|
for ( j = 0; j < n; j++ ) |
|
ptomp(mod,(P)m[i][j],&w[i][j]); |
|
detmp(CO,mod,w,n,&mp); |
|
mptop(mp,rp); |
|
} |
|
return; |
|
} |
|
|
for ( i = 0, max = 0; i < n; i++ ) |
for ( i = 0, max = 0; i < n; i++ ) |
for ( j = 0; j < n; j++ ) |
for ( j = 0; j < n; j++ ) |
for ( tv = fv; tv; tv = NEXT(tv) ) { |
for ( tv = fv; tv; tv = NEXT(tv) ) { |
Line 5106 void nd_det(int mod,MAT f,P *rp) |
|
Line 5149 void nd_det(int mod,MAT f,P *rp) |
|
if ( mod ) ndv_mod(mod,d); |
if ( mod ) ndv_mod(mod,d); |
chsgnq(ONE,&mone); |
chsgnq(ONE,&mone); |
for ( j = 0, sgn = 1; j < n; j++ ) { |
for ( j = 0, sgn = 1; j < n; j++ ) { |
if ( DP_Print ) fprintf(stderr,"j=%d\n",j); |
if ( DP_Print ) fprintf(stderr,".",j); |
for ( i = j; i < n && !dm[i][j]; i++ ); |
for ( i = j; i < n && !dm[i][j]; i++ ); |
if ( i == n ) { |
if ( i == n ) { |
*rp = 0; |
*rp = 0; |
Line 5163 void nd_det(int mod,MAT f,P *rp) |
|
Line 5206 void nd_det(int mod,MAT f,P *rp) |
|
} |
} |
d = mjj; |
d = mjj; |
} |
} |
|
if ( DP_Print ) fprintf(stderr,"\n",k); |
if ( sgn < 0 ) |
if ( sgn < 0 ) |
if ( mod ) |
if ( mod ) |
ndv_mul_c(mod,d,mod-1); |
ndv_mul_c(mod,d,mod-1); |