OpenXM_contrib2/asir2000/engine/nd.c - diff

Return to nd.c CVS log

Up to [local] / OpenXM_contrib2 / asir2000 / engine

Diff for /OpenXM_contrib2/asir2000/engine/nd.c between version 1.124 and 1.128

version 1.124, 2005/02/09 07:58:43

version 1.128, 2005/08/03 06:10:47

Line 1

/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.123 2005/01/23 14:03:48 noro Exp $ */

/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.127 2005/08/03 05:01:01 noro Exp $ */

#include "nd.h"

Line 1284 int ndv_check_candidate(NODE input,int obpe,int oadv,E

NODE t,s;

union oNDC dn;

ndv_setup(0,0,cand);

ndv_setup(0,0,cand,0);

n = length(cand);

/* membercheck : list is a subset of Id(cand) ? */

Line 1839 NODE ndv_reduceall(int m,NODE f)

(int (*)(const void *,const void *))ndv_compare);

for ( t = f, i = 0; t; i++, t = NEXT(t) ) BDY(t) = (pointer)w[i];

#endif

ndv_setup(m,0,f);

ndv_setup(m,0,f,0);

for ( i = 0; i < n; ) {

g = ndvtond(m,nd_ps[i]);

g = nd_separate_head(g,&head);

Line 2179 int ndv_newps(int m,NDV a,NDV aq)

return nd_psn++;

}

void ndv_setup(int mod,int trace,NODE f)

void ndv_setup(int mod,int trace,NODE f,int dont_sort)

{

int i,j,td,len,max;

NODE s,s0,f0;

Line 2193 void ndv_setup(int mod,int trace,NODE f)

for ( nd_psn = 0, s = f; s; s = NEXT(s) ) if ( BDY(s) ) nd_psn++;

w = (NDV *)ALLOCA(nd_psn*sizeof(NDV));

for ( i = 0, s = f; s; s = NEXT(s) ) if ( BDY(s) ) w[i++] = BDY(s);

qsort(w,nd_psn,sizeof(NDV),

if ( !dont_sort )

(int (*)(const void *,const void *))ndv_compare);

qsort(w,nd_psn,sizeof(NDV),

(int (*)(const void *,const void *))ndv_compare);

nd_pslen = 2*nd_psn;

nd_ps = (NDV *)MALLOC(nd_pslen*sizeof(NDV));

nd_ps_trace = (NDV *)MALLOC(nd_pslen*sizeof(NDV));

Line 2396 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe

Line 2397 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe

if ( b ) { NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; }

}

if ( fd0 ) NEXT(fd) = 0;

ndv_setup(m,0,fd0);

ndv_setup(m,0,fd0,0);

x = f4?nd_f4(m):nd_gb(m,ishomo,0);

nd_demand = 0;

x = ndv_reducebase(x);

Line 2414 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe

Line 2415 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe

#endif

}

void nd_gr_postproc(LIST f,LIST v,int m,struct order_spec *ord,int do_check,LIST *rp)

{

VL tv,fv,vv,vc,av;

NODE fd,fd0,r,r0,t,x,s,xx,alist;

int e,max,nvar,i;

NDV b;

int ishomo,nalg;

Alg alpha,dp;

P p;

LIST f1,f2;

Obj obj;

NumberField nf;

struct order_spec *ord1;

get_vars((Obj)f,&fv); pltovl(v,&vv);

for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ );

switch ( ord->id ) {

case 1:

if ( ord->nv != nvar )

error("nd_check : invalid order specification");

break;

default:

break;

}

nd_nalg = 0;

av = 0;

if ( !m ) {

get_algtree((Obj)f,&av);

for ( nalg = 0, tv = av; tv; tv = NEXT(tv), nalg++ );

nd_ntrans = nvar;

nd_nalg = nalg;

/* #i -> t#i */

if ( nalg ) {

preprocess_algcoef(vv,av,ord,f,&ord1,&f1,&alist);

ord = ord1;

f = f1;

}

nvar += nalg;

}

nd_init_ord(ord);

for ( t = BDY(f), max = 0; t; t = NEXT(t) )

for ( tv = vv; tv; tv = NEXT(tv) ) {

e = getdeg(tv->v,(P)BDY(t));

max = MAX(e,max);

}

nd_setup_parameters(nvar,max);

ishomo = 1;

for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) {

b = (pointer)ptondv(CO,vv,(P)BDY(t));

if ( ishomo )

ishomo = ishomo && ndv_ishomo(b);

if ( m ) ndv_mod(m,b);

if ( b ) { NEXTNODE(fd0,fd); BDY(fd) = (pointer)b; }

}

if ( fd0 ) NEXT(fd) = 0;

ndv_setup(m,0,fd0,0);

for ( x = 0, i = 0; i < nd_psn; i++ )

x = update_base(x,i);

if ( do_check ) {

x = nd_gb(m,ishomo,1);

if ( !x ) {

*rp = 0;

return;

}

} else {

for ( t = x; t; t = NEXT(t) )

BDY(t) = (pointer)nd_ps[(int)BDY(t)];

}

x = ndv_reducebase(x);

x = ndv_reduceall(m,x);

for ( r0 = 0, t = x; t; t = NEXT(t) ) {

NEXTNODE(r0,r);

BDY(r) = ndvtop(m,CO,vv,BDY(t));

}

if ( r0 ) NEXT(r) = 0;

if ( nalg )

r0 = postprocess_algcoef(av,alist,r0);

MKLIST(*rp,r0);

}

void nd_gr_trace(LIST f,LIST v,int trace,int homo,struct order_spec *ord,LIST *rp)

{

VL tv,fv,vv,vc,av;

Line 2501 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru

Line 2582 void nd_gr_trace(LIST f,LIST v,int trace,int homo,stru

while ( 1 ) {

if ( Demand )

nd_demand = 1;

ndv_setup(m,1,fd0);

ndv_setup(m,1,fd0,0);

cand = nd_gb_trace(m,ishomo || homo);

if ( !cand ) {

/* failure */

Line 3536 ND nd_dup(ND p)

Line 3617 ND nd_dup(ND p)

void ndv_mod(int mod,NDV p)

{

NMV t,d;

int r;

int r,s,u;

int i,len,dlen;

Obj gfs;

Line 3558 void ndv_mod(int mod,NDV p)

Line 3639 void ndv_mod(int mod,NDV p)

if ( r ) {

if ( SGN(CQ(t)) < 0 )

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;

ndl_copy(DL(t),DL(d));

NMV_ADV(d);

Line 3945 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec

Line 4033 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec

if ( m ) ndv_mod(m,(NDV)BDY(in));

NEXT(in) = 0;

ndv_setup(m,0,in0);

/* dont sort */

ndv_setup(m,0,in0,1);

nd_psn--;

nd_scale=2;

while ( 1 ) {

Line 5090 void nd_det(int mod,MAT f,P *rp)

Line 5179 void nd_det(int mod,MAT f,P *rp)

int n,i,j,max,e,nvar,sgn,k0,l0,len0,len,k,l,a;

pointer **m;

Q mone;

P **w;

P mp,r;

NDV **dm;

NDV *t,*mi,*mj;

NDV d,s,mij,mjj;

Line 5098 void nd_det(int mod,MAT f,P *rp)

Line 5189 void nd_det(int mod,MAT f,P *rp)

UINT *bound;

PGeoBucket bucket;

struct order_spec *ord;

Q dq,dt,ds;

N gn,qn,dn0,nm,dn;

create_order_spec(0,0,&ord);

nd_init_ord(ord);

Line 5105 void nd_det(int mod,MAT f,P *rp)

Line 5198 void nd_det(int mod,MAT f,P *rp)

if ( f->row != f->col )

error("nd_det : non-square matrix");

n = f->row;

for ( nvar = 0, tv = fv; tv; tv = NEXT(tv), nvar++ );

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;

}

if ( !mod ) {

w = (P **)almat_pointer(n,n);

dq = ONE;

for ( i = 0; i < n; i++ ) {

dn0 = ONEN;

for ( j = 0; j < n; j++ ) {

if ( !m[i][j] ) continue;

lgp(m[i][j],&nm,&dn);

gcdn(dn0,dn,&gn); divsn(dn0,gn,&qn); muln(qn,dn,&dn0);

}

if ( !UNIN(dn0) ) {

NTOQ(dn0,1,ds);

for ( j = 0; j < n; j++ )

mulp(CO,(P)m[i][j],(P)ds,&w[i][j]);

mulq(dq,ds,&dt); dq = dt;

} else

for ( j = 0; j < n; j++ )

w[i][j] = (P)m[i][j];

}

m = (pointer **)w;

}

for ( i = 0, max = 0; i < n; i++ )

for ( j = 0; j < n; j++ )

for ( tv = fv; tv; tv = NEXT(tv) ) {

Line 5125 void nd_det(int mod,MAT f,P *rp)

Line 5255 void nd_det(int mod,MAT f,P *rp)

if ( mod ) ndv_mod(mod,d);

chsgnq(ONE,&mone);

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++ );

if ( i == n ) {

*rp = 0;

Line 5182 void nd_det(int mod,MAT f,P *rp)

Line 5312 void nd_det(int mod,MAT f,P *rp)

}

d = mjj;

}

if ( DP_Print ) fprintf(stderr,"\n",k);

if ( sgn < 0 )

if ( mod )

ndv_mul_c(mod,d,mod-1);

else

ndv_mul_c_q(d,mone);

*rp = ndvtop(mod,CO,fv,d);

r = ndvtop(mod,CO,fv,d);

if ( !mod && !UNIQ(dq) )

divsp(CO,r,(P)dq,rp);

else

*rp = r;

}

ND ndv_mul_nmv_trunc(int mod,NMV m0,NDV p,UINT *d)

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>