version 1.188, 2010/04/26 01:10:04 |
version 1.191, 2010/09/27 05:05:58 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.187 2010/04/26 01:06:22 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.190 2010/07/14 04:36:59 noro Exp $ */ |
|
|
#include "nd.h" |
#include "nd.h" |
|
|
Line 4928 EPOS nd_create_epos(struct order_spec *ord) |
|
Line 4928 EPOS nd_create_epos(struct order_spec *ord) |
|
|
|
/* external interface */ |
/* external interface */ |
|
|
void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec *ord,P *rp) |
void nd_nf_p(Obj f,LIST g,LIST v,int m,struct order_spec *ord,Obj *rp) |
{ |
{ |
NODE t,in0,in; |
NODE t,in0,in; |
ND nd,nf; |
ND ndf,nf; |
NDV ndv; |
NDV ndvf; |
VL vv,tv; |
VL vv,tv; |
int stat,nvar,max,e; |
int stat,nvar,max,mrank; |
union oNDC dn; |
union oNDC dn; |
Q cont; |
Q cont; |
P pp; |
P pp; |
|
LIST ppl; |
|
|
if ( !f ) { |
if ( !f ) { |
*rp = 0; |
*rp = 0; |
Line 4946 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
Line 4947 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
pltovl(v,&vv); |
pltovl(v,&vv); |
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
|
|
/* get the degree bound */ |
/* max=65536 implies nd_bpe=32 */ |
for ( t = BDY(g), max = 1; t; t = NEXT(t) ) |
max = 65536; |
for ( tv = vv; tv; tv = NEXT(tv) ) { |
|
e = getdeg(tv->v,(P)BDY(t)); |
|
max = MAX(e,max); |
|
} |
|
for ( tv = vv; tv; tv = NEXT(tv) ) { |
|
e = getdeg(tv->v,f); |
|
max = MAX(e,max); |
|
} |
|
|
|
|
nd_module = 0; |
|
/* nd_module will be set if ord is a module ordering */ |
nd_init_ord(ord); |
nd_init_ord(ord); |
nd_setup_parameters(nvar,max); |
nd_setup_parameters(nvar,max); |
|
if ( nd_module && OID(f) != O_LIST ) |
|
error("nd_nf_p : the first argument must be a list"); |
|
if ( nd_module ) mrank = length(BDY((LIST)f)); |
/* conversion to ndv */ |
/* conversion to ndv */ |
for ( in0 = 0, t = BDY(g); t; t = NEXT(t) ) { |
for ( in0 = 0, t = BDY(g); t; t = NEXT(t) ) { |
NEXTNODE(in0,in); |
NEXTNODE(in0,in); |
ptozp((P)BDY(t),1,&cont,&pp); |
if ( nd_module ) { |
BDY(in) = (pointer)ptondv(CO,vv,pp); |
if ( !BDY(t) || OID(BDY(t)) != O_LIST |
|
|| length(BDY((LIST)BDY(t))) != mrank ) |
|
error("nd_nf_p : inconsistent basis element"); |
|
if ( !m ) pltozpl((LIST)BDY(t),&cont,&ppl); |
|
else ppl = (LIST)BDY(t); |
|
BDY(in) = (pointer)pltondv(CO,vv,ppl); |
|
} else { |
|
if ( !m ) ptozp((P)BDY(t),1,&cont,&pp); |
|
else pp = (P)BDY(t); |
|
BDY(in) = (pointer)ptondv(CO,vv,pp); |
|
} |
if ( m ) ndv_mod(m,(NDV)BDY(in)); |
if ( m ) ndv_mod(m,(NDV)BDY(in)); |
} |
} |
NEXTNODE(in0,in); |
if ( in0 ) NEXT(in) = 0; |
BDY(in) = (pointer)ptondv(CO,vv,f); |
|
if ( m ) ndv_mod(m,(NDV)BDY(in)); |
|
NEXT(in) = 0; |
|
|
|
|
if ( nd_module ) ndvf = pltondv(CO,vv,(LIST)f); |
|
else ndvf = ptondv(CO,vv,(P)f); |
|
if ( m ) ndv_mod(m,ndvf); |
|
ndf = (pointer)ndvtond(m,ndvf); |
|
|
/* dont sort, dont removecont */ |
/* dont sort, dont removecont */ |
ndv_setup(m,0,in0,1,1); |
ndv_setup(m,0,in0,1,1); |
nd_psn--; |
|
nd_scale=2; |
nd_scale=2; |
while ( 1 ) { |
stat = nd_nf(m,0,ndf,nd_ps,1,0,&nf); |
nd = (pointer)ndvtond(m,nd_ps[nd_psn]); |
if ( !stat ) |
stat = nd_nf(m,0,nd,nd_ps,1,0,&nf); |
error("nd_nf_p : exponent too large"); |
if ( !stat ) { |
if ( nd_module ) *rp = (Obj)ndvtopl(m,CO,vv,ndtondv(m,nf),mrank); |
nd_psn++; |
else *rp = (Obj)ndvtop(m,CO,vv,ndtondv(m,nf)); |
nd_reconstruct(0,0); |
|
nd_psn--; |
|
} else |
|
break; |
|
} |
|
*rp = ndvtop(m,CO,vv,ndtondv(m,nf)); |
|
} |
} |
|
|
int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r) |
int nd_to_vect(int mod,UINT *s0,int n,ND d,UINT *r) |
Line 6600 void nd_det(int mod,MAT f,P *rp) |
|
Line 6602 void nd_det(int mod,MAT f,P *rp) |
|
bucket = create_pbucket(); |
bucket = create_pbucket(); |
if ( mi[k] ) { |
if ( mi[k] ) { |
nmv = BDY(mjj); len = LEN(mjj); |
nmv = BDY(mjj); len = LEN(mjj); |
fprintf(stderr,"len=%d\n",len); |
|
for ( a = 0; a < len; a++, NMV_ADV(nmv) ) { |
for ( a = 0; a < len; a++, NMV_ADV(nmv) ) { |
fprintf(stderr,"."); |
|
u = ndv_mul_nmv_trunc(mod,nmv,mi[k],DL(BDY(d))); |
u = ndv_mul_nmv_trunc(mod,nmv,mi[k],DL(BDY(d))); |
add_pbucket(mod,bucket,u); |
add_pbucket(mod,bucket,u); |
if ( !(a%1000) ) |
|
fprintf(stderr,"%d\n",a); |
|
} |
} |
} |
} |
if ( mj[k] && mij ) { |
if ( mj[k] && mij ) { |
nmv = BDY(mij); len = LEN(mij); |
nmv = BDY(mij); len = LEN(mij); |
fprintf(stderr,"len=%d\n",len); |
|
for ( a = 0; a < len; a++, NMV_ADV(nmv) ) { |
for ( a = 0; a < len; a++, NMV_ADV(nmv) ) { |
fprintf(stderr,"."); |
|
u = ndv_mul_nmv_trunc(mod,nmv,mj[k],DL(BDY(d))); |
u = ndv_mul_nmv_trunc(mod,nmv,mj[k],DL(BDY(d))); |
add_pbucket(mod,bucket,u); |
add_pbucket(mod,bucket,u); |
if ( !(a%1000) ) |
|
fprintf(stderr,"%d\n",a); |
|
} |
} |
} |
} |
u = nd_quo(mod,bucket,d); |
u = nd_quo(mod,bucket,d); |
Line 6967 void parse_nd_option(NODE opt) |
|
Line 6961 void parse_nd_option(NODE opt) |
|
if ( !value || OID(value) != O_LIST ) |
if ( !value || OID(value) != O_LIST ) |
error("nd_* : invalid value for gbblock option"); |
error("nd_* : invalid value for gbblock option"); |
u = BDY((LIST)value); |
u = BDY((LIST)value); |
nd_gbblock = MALLOC(2*length(t)+1); |
nd_gbblock = MALLOC((2*length(u)+1)*sizeof(int)); |
for ( i = 0; u; u = NEXT(u) ) { |
for ( i = 0; u; u = NEXT(u) ) { |
p = BDY((LIST)BDY(u)); |
p = BDY((LIST)BDY(u)); |
s = nd_gbblock[i++] = QTOS((Q)BDY(p)); |
s = nd_gbblock[i++] = QTOS((Q)BDY(p)); |