version 1.141, 2006/06/17 10:12:06 |
version 1.150, 2006/12/12 11:50:37 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.140 2006/06/12 21:51:33 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2000/engine/nd.c,v 1.149 2006/12/04 01:40:51 noro Exp $ */ |
|
|
#include "nd.h" |
#include "nd.h" |
|
|
|
|
NM _nm_free_list; |
NM _nm_free_list; |
ND _nd_free_list; |
ND _nd_free_list; |
ND_pairs _ndp_free_list; |
ND_pairs _ndp_free_list; |
|
NODE nd_hcf; |
|
|
|
static NODE nd_subst; |
|
static VL nd_vc; |
static int nd_ntrans; |
static int nd_ntrans; |
static int nd_nalg; |
static int nd_nalg; |
#if 0 |
#if 0 |
Line 50 void nd_det_reconstruct(NDV **dm,int n,int j,NDV d); |
|
Line 53 void nd_det_reconstruct(NDV **dm,int n,int j,NDV d); |
|
int nd_monic(int m,ND *p); |
int nd_monic(int m,ND *p); |
NDV plain_vect_to_ndv_q(Q *mat,int col,UINT *s0vect); |
NDV plain_vect_to_ndv_q(Q *mat,int col,UINT *s0vect); |
|
|
|
extern int Denominator,DP_Multiple; |
|
|
void nd_free_private_storage() |
void nd_free_private_storage() |
{ |
{ |
_nm_free_list = 0; |
_nm_free_list = 0; |
Line 976 ND nd_add(int mod,ND p1,ND p2) |
|
Line 981 ND nd_add(int mod,ND p1,ND p2) |
|
int nm_destructive_add_q(NM *m1,NM *m2,NM *mr0,NM *mr) |
int nm_destructive_add_q(NM *m1,NM *m2,NM *mr0,NM *mr) |
{ |
{ |
NM s; |
NM s; |
Q t; |
P t; |
int can; |
int can; |
|
|
addq(CQ(*m1),CQ(*m2),&t); |
addp(nd_vc,CP(*m1),CP(*m2),&t); |
s = *m1; *m1 = NEXT(*m1); |
s = *m1; *m1 = NEXT(*m1); |
if ( t ) { |
if ( t ) { |
can = 1; NEXTNM2(*mr0,*mr,s); CQ(*mr) = (t); |
can = 1; NEXTNM2(*mr0,*mr,s); CP(*mr) = (t); |
} else { |
} else { |
can = 2; FREENM(s); |
can = 2; FREENM(s); |
} |
} |
Line 995 ND nd_add_q(ND p1,ND p2) |
|
Line 1000 ND nd_add_q(ND p1,ND p2) |
|
int n,c,can; |
int n,c,can; |
ND r; |
ND r; |
NM m1,m2,mr0,mr,s; |
NM m1,m2,mr0,mr,s; |
Q t; |
P t; |
|
|
if ( !p1 ) return p2; |
if ( !p1 ) return p2; |
else if ( !p2 ) return p1; |
else if ( !p2 ) return p1; |
Line 1008 ND nd_add_q(ND p1,ND p2) |
|
Line 1013 ND nd_add_q(ND p1,ND p2) |
|
#if defined(__x86_64__) |
#if defined(__x86_64__) |
can += nm_destructive_add_q(&m1,&m2,&mr0,&mr); |
can += nm_destructive_add_q(&m1,&m2,&mr0,&mr); |
#else |
#else |
addq(CQ(m1),CQ(m2),&t); |
addp(nd_vc,CP(m1),CP(m2),&t); |
s = m1; m1 = NEXT(m1); |
s = m1; m1 = NEXT(m1); |
if ( t ) { |
if ( t ) { |
can++; NEXTNM2(mr0,mr,s); CQ(mr) = (t); |
can++; NEXTNM2(mr0,mr,s); CP(mr) = (t); |
} else { |
} else { |
can += 2; FREENM(s); |
can += 2; FREENM(s); |
} |
} |
Line 1088 ND nd_add_sf(ND p1,ND p2) |
|
Line 1093 ND nd_add_sf(ND p1,ND p2) |
|
} |
} |
} |
} |
|
|
|
ND nd_reduce2(int mod,ND d,ND g,NDV p,NM mul,NDC dn) |
|
{ |
|
int c,c1,c2; |
|
Q cg,cred,gcd,tq; |
|
P cgp,credp,gcdp; |
|
Obj tr,tr1; |
|
|
|
if ( mod == -1 ) |
|
CM(mul) = _mulsf(_invsf(HCM(p)),_chsgnsf(HCM(g))); |
|
else if ( mod ) { |
|
c1 = invm(HCM(p),mod); c2 = mod-HCM(g); |
|
DMAR(c1,c2,0,mod,c); CM(mul) = c; |
|
} else if ( nd_vc ) { |
|
ezgcdpz(nd_vc,HCP(g),HCP(p),&gcdp); |
|
divsp(nd_vc,HCP(g),gcdp,&cgp); divsp(nd_vc,HCP(p),gcdp,&credp); |
|
chsgnp(cgp,&CP(mul)); |
|
nd_mul_c_q(d,credp); nd_mul_c_q(g,credp); |
|
if ( dn ) { |
|
mulr(nd_vc,(Obj)dn->r,(Obj)credp,&tr); |
|
reductr(nd_vc,tr,&tr1); dn->r = (R)tr1; |
|
} |
|
} else { |
|
igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
|
chsgnq(cg,&CQ(mul)); |
|
nd_mul_c_q(d,(P)cred); nd_mul_c_q(g,(P)cred); |
|
if ( dn ) { |
|
mulq(dn->z,cred,&tq); dn->z = tq; |
|
} |
|
} |
|
return nd_add(mod,g,ndv_mul_nm(mod,mul,p)); |
|
} |
|
|
/* ret=1 : success, ret=0 : overflow */ |
/* ret=1 : success, ret=0 : overflow */ |
int nd_nf(int mod,ND g,NDV *ps,int full,NDC dn,ND *rp) |
int nd_nf(int mod,ND d,ND g,NDV *ps,int full,NDC dn,ND *rp) |
{ |
{ |
ND d; |
|
NM m,mrd,tail; |
NM m,mrd,tail; |
NM mul; |
NM mul; |
int n,sugar,psugar,sugar0,stat,index; |
int n,sugar,psugar,sugar0,stat,index; |
Line 1100 int nd_nf(int mod,ND g,NDV *ps,int full,NDC dn,ND *rp) |
|
Line 1136 int nd_nf(int mod,ND g,NDV *ps,int full,NDC dn,ND *rp) |
|
NDV p,red; |
NDV p,red; |
Q cg,cred,gcd,tq,qq; |
Q cg,cred,gcd,tq,qq; |
double hmag; |
double hmag; |
|
P tp,tp1; |
|
Obj tr,tr1; |
|
|
if ( dn ) { |
if ( dn ) { |
if ( mod ) |
if ( mod ) |
dn->m = 1; |
dn->m = 1; |
|
else if ( nd_vc ) |
|
dn->r = (R)ONE; |
else |
else |
dn->z = ONE; |
dn->z = ONE; |
} |
} |
if ( !g ) { |
if ( !g ) { |
*rp = 0; |
*rp = d; |
return 1; |
return 1; |
} |
} |
if ( !mod ) hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
if ( !mod ) hmag = ((double)p_mag(HCP(g)))*nd_scale; |
|
|
sugar0 = sugar = SG(g); |
sugar0 = sugar = SG(g); |
n = NV(g); |
n = NV(g); |
mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT)); |
mul = (NM)ALLOCA(sizeof(struct oNM)+(nd_wpd-1)*sizeof(UINT)); |
for ( d = 0; g; ) { |
if ( d ) |
|
for ( tail = BDY(d); NEXT(tail); tail = NEXT(tail) ); |
|
for ( ; g; ) { |
index = ndl_find_reducer(HDL(g)); |
index = ndl_find_reducer(HDL(g)); |
if ( index >= 0 ) { |
if ( index >= 0 ) { |
h = nd_psh[index]; |
h = nd_psh[index]; |
Line 1125 int nd_nf(int mod,ND g,NDV *ps,int full,NDC dn,ND *rp) |
|
Line 1167 int nd_nf(int mod,ND g,NDV *ps,int full,NDC dn,ND *rp) |
|
nd_free(g); nd_free(d); |
nd_free(g); nd_free(d); |
return 0; |
return 0; |
} |
} |
if ( nd_demand ) |
p = nd_demand ? ndv_load(index) : ps[index]; |
p = ndv_load(index); |
g = nd_reduce2(mod,d,g,p,mul,dn); |
else |
|
p = ps[index]; |
|
if ( mod == -1 ) |
|
CM(mul) = _mulsf(_invsf(HCM(p)),_chsgnsf(HCM(g))); |
|
else if ( mod ) { |
|
c1 = invm(HCM(p),mod); c2 = mod-HCM(g); |
|
DMAR(c1,c2,0,mod,c); CM(mul) = c; |
|
} else { |
|
igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
|
chsgnq(cg,&CQ(mul)); |
|
nd_mul_c_q(d,cred); nd_mul_c_q(g,cred); |
|
if ( dn ) { |
|
mulq(dn->z,cred,&tq); dn->z = tq; |
|
} |
|
} |
|
g = nd_add(mod,g,ndv_mul_nm(mod,mul,p)); |
|
sugar = MAX(sugar,SG(p)+TD(DL(mul))); |
sugar = MAX(sugar,SG(p)+TD(DL(mul))); |
if ( !mod && hmag && g && ((double)(p_mag((P)HCQ(g))) > hmag) ) { |
if ( !mod && g && ((double)(p_mag(HCP(g))) > hmag) ) { |
tq = HCQ(g); |
tp = HCP(g); |
nd_removecont2(d,g); |
nd_removecont2(d,g); |
if ( dn ) { |
if ( dn ) { |
divq(tq,HCQ(g),&qq); divq(dn->z,qq,&tq); dn->z = tq; |
if ( nd_vc ) { |
|
divsp(nd_vc,tp,HCP(g),&tp1); |
|
divr(nd_vc,(Obj)dn->r,(Obj)tp1,&tr); |
|
reductr(nd_vc,(Obj)tr,&tr1); dn->r = (R)tr1; |
|
} else { |
|
divq((Q)tp,HCQ(g),&qq); |
|
divq(dn->z,qq,&tq); dn->z = tq; |
|
} |
} |
} |
hmag = ((double)p_mag((P)HCQ(g)))*nd_scale; |
hmag = ((double)p_mag(HCP(g)))*nd_scale; |
} |
} |
} else if ( !full ) { |
} else if ( !full ) { |
*rp = g; |
*rp = g; |
Line 1231 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
Line 1264 int nd_nf_pbucket(int mod,ND g,NDV *ps,int full,ND *rp |
|
} else { |
} else { |
igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
igcd_cofactor(HCQ(g),HCQ(p),&gcd,&cg,&cred); |
chsgnq(cg,&CQ(mul)); |
chsgnq(cg,&CQ(mul)); |
nd_mul_c_q(d,cred); |
nd_mul_c_q(d,(P)cred); |
mulq_pbucket(bucket,cred); |
mulq_pbucket(bucket,cred); |
g = bucket->body[hindex]; |
g = bucket->body[hindex]; |
gmag = (double)p_mag((P)HCQ(g)); |
gmag = (double)p_mag((P)HCQ(g)); |
|
|
else |
else |
r = (NDV)BDY(t); |
r = (NDV)BDY(t); |
d = ndvtond(0,r); |
d = ndvtond(0,r); |
stat = nd_nf(0,d,nd_ps,0,0,&nf); |
stat = nd_nf(0,0,d,nd_ps,0,0,&nf); |
if ( !stat ) { |
if ( !stat ) { |
nd_reconstruct(0,0); |
nd_reconstruct(0,0); |
goto again; |
goto again; |
Line 1404 void mulq_pbucket(PGeoBucket g,Q c) |
|
Line 1437 void mulq_pbucket(PGeoBucket g,Q c) |
|
int k; |
int k; |
|
|
for ( k = 0; k <= g->m; k++ ) |
for ( k = 0; k <= g->m; k++ ) |
nd_mul_c_q(g->body[k],c); |
nd_mul_c_q(g->body[k],(P)c); |
} |
} |
|
|
NM remove_head_pbucket_symbolic(PGeoBucket g) |
NM remove_head_pbucket_symbolic(PGeoBucket g) |
Line 1539 ND normalize_pbucket(int mod,PGeoBucket g) |
|
Line 1572 ND normalize_pbucket(int mod,PGeoBucket g) |
|
return r; |
return r; |
} |
} |
|
|
|
#if 0 |
|
void register_hcf(NDV p) |
|
{ |
|
DCP dc,t; |
|
P hc,h; |
|
int c; |
|
NODE l,l1,prev; |
|
|
|
hc = p->body->c.p; |
|
if ( !nd_vc || NUM(hc) ) return; |
|
fctrp(nd_vc,hc,&dc); |
|
for ( t = dc; t; t = NEXT(t) ) { |
|
h = t->c; |
|
if ( NUM(h) ) continue; |
|
for ( prev = 0, l = nd_hcf; l; prev = l, l = NEXT(l) ) { |
|
c = compp(nd_vc,h,(P)BDY(l)); |
|
if ( c >= 0 ) break; |
|
} |
|
if ( !l || c > 0 ) { |
|
MKNODE(l1,h,l); |
|
if ( !prev ) |
|
nd_hcf = l1; |
|
else |
|
NEXT(prev) = l1; |
|
} |
|
} |
|
} |
|
#else |
|
void register_hcf(NDV p) |
|
{ |
|
DCP dc,t; |
|
P hc,h,q; |
|
Q dmy; |
|
int c; |
|
NODE l,l1,prev; |
|
|
|
hc = p->body->c.p; |
|
if ( NUM(hc) ) return; |
|
ptozp(hc,1,&dmy,&h); |
|
#if 1 |
|
for ( l = nd_hcf; l; l = NEXT(l) ) { |
|
while ( 1 ) { |
|
if ( divtpz(nd_vc,h,(P)BDY(l),&q) ) h = q; |
|
else break; |
|
} |
|
} |
|
if ( NUM(h) ) return; |
|
#endif |
|
for ( prev = 0, l = nd_hcf; l; prev = l, l = NEXT(l) ) { |
|
c = compp(nd_vc,h,(P)BDY(l)); |
|
if ( c >= 0 ) break; |
|
} |
|
if ( !l || c > 0 ) { |
|
MKNODE(l1,h,l); |
|
if ( !prev ) |
|
nd_hcf = l1; |
|
else |
|
NEXT(prev) = l1; |
|
} |
|
} |
|
#endif |
|
|
int do_diagonalize(int sugar,int m) |
int do_diagonalize(int sugar,int m) |
{ |
{ |
int i,nh,stat; |
int i,nh,stat; |
Line 1546 int do_diagonalize(int sugar,int m) |
|
Line 1641 int do_diagonalize(int sugar,int m) |
|
ND h,nf,s,head; |
ND h,nf,s,head; |
NDV nfv; |
NDV nfv; |
Q q,num,den; |
Q q,num,den; |
union oNDC dn; |
P nm,nmp,dn,mnp,dnp; |
|
|
for ( i = nd_psn-1; i >= 0 && SG(nd_psh[i]) == sugar; i-- ) { |
for ( i = nd_psn-1; i >= 0 && SG(nd_psh[i]) == sugar; i-- ) { |
if ( nd_demand ) |
if ( nd_demand ) |
Line 1555 int do_diagonalize(int sugar,int m) |
|
Line 1650 int 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); |
stat = nd_nf(m,s,nd_ps,1,&dn,&nf); |
stat = nd_nf(m,head,s,nd_ps,1,0,&nf); |
if ( !stat ) return 0; |
if ( !stat ) return 0; |
if ( !m ) { |
|
NTOQ(NM(dn.z),SGN(dn.z),num); |
|
mulq(HCQ(head),num,&q); HCQ(head) = q; |
|
if ( DN(dn.z) ) { |
|
NTOQ(DN(dn.z),1,den); |
|
nd_mul_c_q(nf,den); |
|
} |
|
} |
|
nf = nd_add(m,head,nf); |
|
ndv_free(nfv); |
ndv_free(nfv); |
nd_removecont(m,nf); |
nd_removecont(m,nf); |
nfv = ndtondv(m,nf); |
nfv = ndtondv(m,nf); |
nd_free(nf); |
nd_free(nf); |
nd_bound[i] = ndv_compute_bound(nfv); |
nd_bound[i] = ndv_compute_bound(nfv); |
|
if ( !m ) register_hcf(nfv); |
if ( nd_demand ) { |
if ( nd_demand ) { |
ndv_save(nfv,i); |
ndv_save(nfv,i); |
ndv_free(nfv); |
ndv_free(nfv); |
|
|
goto again; |
goto again; |
} |
} |
#if USE_GEOBUCKET |
#if USE_GEOBUCKET |
stat = m?nd_nf_pbucket(m,h,nd_ps,!Top,&nf):nd_nf(m,h,nd_ps,!Top,0,&nf); |
stat = m?nd_nf_pbucket(m,h,nd_ps,!Top,&nf):nd_nf(m,0,h,nd_ps,!Top,0,&nf); |
#else |
#else |
stat = nd_nf(m,h,nd_ps,!Top,0,&nf); |
stat = nd_nf(m,0,h,nd_ps,!Top,0,&nf); |
#endif |
#endif |
if ( !stat ) { |
if ( !stat ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
|
|
else |
else |
for ( t = g; t; t = NEXT(t) ) |
for ( t = g; t; t = NEXT(t) ) |
BDY(t) = (pointer)nd_ps[(int)BDY(t)]; |
BDY(t) = (pointer)nd_ps[(int)BDY(t)]; |
|
if ( !checkonly && DP_Print ) { printf("nd_gb done.\n"); fflush(stdout); } |
return g; |
return g; |
} |
} |
|
|
Line 1674 int do_diagonalize_trace(int sugar,int m) |
|
Line 1762 int do_diagonalize_trace(int sugar,int m) |
|
ND h,nf,nfq,s,head; |
ND h,nf,nfq,s,head; |
NDV nfv,nfqv; |
NDV nfv,nfqv; |
Q q,den,num; |
Q q,den,num; |
union oNDC dn; |
|
|
|
for ( i = nd_psn-1; i >= 0 && SG(nd_psh[i]) == sugar; i-- ) { |
for ( i = nd_psn-1; i >= 0 && SG(nd_psh[i]) == sugar; i-- ) { |
/* for nd_ps */ |
/* for nd_ps */ |
Line 1694 int do_diagonalize_trace(int sugar,int m) |
|
Line 1781 int 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); |
stat = nd_nf(0,s,nd_ps_trace,1,&dn,&nf); |
stat = nd_nf(0,head,s,nd_ps_trace,1,0,&nf); |
if ( !stat ) return 0; |
if ( !stat ) return 0; |
NTOQ(NM(dn.z),SGN(dn.z),num); |
|
mulq(HCQ(head),num,&q); HCQ(head) = q; |
|
if ( DN(dn.z) ) { |
|
NTOQ(DN(dn.z),1,den); |
|
nd_mul_c_q(nf,den); |
|
} |
|
nf = nd_add(0,head,nf); |
|
ndv_free(nfv); |
ndv_free(nfv); |
nd_removecont(0,nf); |
nd_removecont(0,nf); |
nfv = ndtondv(0,nf); |
nfv = ndtondv(0,nf); |
nd_free(nf); |
nd_free(nf); |
nd_bound[i] = ndv_compute_bound(nfv); |
nd_bound[i] = ndv_compute_bound(nfv); |
|
register_hcf(nfv); |
if ( nd_demand ) { |
if ( nd_demand ) { |
ndv_save(nfv,i); |
ndv_save(nfv,i); |
ndv_free(nfv); |
ndv_free(nfv); |
Line 1720 int do_diagonalize_trace(int sugar,int m) |
|
Line 1801 int do_diagonalize_trace(int sugar,int m) |
|
static struct oEGT eg_invdalg; |
static struct oEGT eg_invdalg; |
struct oEGT eg_le; |
struct oEGT eg_le; |
|
|
|
void nd_subst_vector(VL vl,P p,NODE subst,P *r) |
|
{ |
|
NODE tn; |
|
P p1; |
|
|
|
for ( tn = subst; tn; tn = NEXT(NEXT(tn)) ) { |
|
substp(vl,p,BDY(tn),BDY(NEXT(tn)),&p1); p = p1; |
|
} |
|
*r = p; |
|
} |
|
|
NODE nd_gb_trace(int m,int ishomo) |
NODE nd_gb_trace(int m,int ishomo) |
{ |
{ |
int i,nh,sugar,stat; |
int i,nh,sugar,stat; |
Line 1729 NODE nd_gb_trace(int m,int ishomo) |
|
Line 1821 NODE nd_gb_trace(int m,int ishomo) |
|
ND h,nf,nfq,s,head; |
ND h,nf,nfq,s,head; |
NDV nfv,nfqv; |
NDV nfv,nfqv; |
Q q,den,num; |
Q q,den,num; |
|
P hc; |
union oNDC dn; |
union oNDC dn; |
struct oEGT eg_monic,egm0,egm1; |
struct oEGT eg_monic,egm0,egm1; |
int diag_count = 0; |
int diag_count = 0; |
|
|
if ( SG(l) != sugar ) { |
if ( SG(l) != sugar ) { |
#if 1 |
#if 1 |
if ( ishomo ) { |
if ( ishomo ) { |
|
if ( DP_Print > 2 ) fprintf(asir_out,"|"); |
stat = do_diagonalize_trace(sugar,m); |
stat = do_diagonalize_trace(sugar,m); |
|
if ( DP_Print > 2 ) fprintf(asir_out,"|"); |
diag_count = 0; |
diag_count = 0; |
if ( !stat ) { |
if ( !stat ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
|
|
#if USE_GEOBUCKET |
#if USE_GEOBUCKET |
stat = nd_nf_pbucket(m,h,nd_ps,!Top,&nf); |
stat = nd_nf_pbucket(m,h,nd_ps,!Top,&nf); |
#else |
#else |
stat = nd_nf(m,h,nd_ps,!Top,0,&nf); |
stat = nd_nf(m,0,h,nd_ps,!Top,0,&nf); |
#endif |
#endif |
if ( !stat ) { |
if ( !stat ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
|
|
} else |
} else |
nfq = 0; |
nfq = 0; |
if ( !nfq ) { |
if ( !nfq ) { |
if ( !nd_sp(0,1,l,&h) || !nd_nf(0,h,nd_ps_trace,!Top,0,&nfq) ) { |
if ( !nd_sp(0,1,l,&h) || !nd_nf(0,0,h,nd_ps_trace,!Top,0,&nfq) ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
d = nd_reconstruct(1,d); |
d = nd_reconstruct(1,d); |
goto again; |
goto again; |
|
|
} |
} |
if ( nfq ) { |
if ( nfq ) { |
/* m|HC(nfq) => failure */ |
/* m|HC(nfq) => failure */ |
if ( !rem(NM(HCQ(nfq)),m) ) return 0; |
if ( nd_vc ) { |
|
nd_subst_vector(nd_vc,HCP(nfq),nd_subst,&hc); q = (Q)hc; |
|
} else |
|
q = HCQ(nfq); |
|
if ( !rem(NM(q),m) ) return 0; |
|
|
if ( DP_Print ) { printf("+"); fflush(stdout); } |
if ( DP_Print ) { printf("+"); fflush(stdout); } |
if ( nd_nalg ) { |
if ( nd_nalg ) { |
|
|
nh = ndv_newps(0,nfv,nfqv); |
nh = ndv_newps(0,nfv,nfqv); |
if ( ishomo && ++diag_count == diag_period ) { |
if ( ishomo && ++diag_count == diag_period ) { |
diag_count = 0; |
diag_count = 0; |
|
if ( DP_Print > 2 ) fprintf(asir_out,"|"); |
stat = do_diagonalize_trace(sugar,m); |
stat = do_diagonalize_trace(sugar,m); |
|
if ( DP_Print > 2 ) fprintf(asir_out,"|"); |
if ( !stat ) { |
if ( !stat ) { |
NEXT(l) = d; d = l; |
NEXT(l) = d; d = l; |
d = nd_reconstruct(1,d); |
d = nd_reconstruct(1,d); |
|
|
print_eg("invdalg",&eg_invdalg); |
print_eg("invdalg",&eg_invdalg); |
print_eg("le",&eg_le); |
print_eg("le",&eg_le); |
} |
} |
|
if ( DP_Print ) { printf("nd_gb_trace done.\n"); fflush(stdout); } |
return g; |
return g; |
} |
} |
|
|
Line 1869 NODE ndv_reduceall(int m,NODE f) |
|
Line 1971 NODE ndv_reduceall(int m,NODE f) |
|
for ( i = 0; i < n; ) { |
for ( i = 0; i < n; ) { |
g = ndvtond(m,nd_ps[i]); |
g = ndvtond(m,nd_ps[i]); |
g = nd_separate_head(g,&head); |
g = nd_separate_head(g,&head); |
stat = nd_nf(m,g,nd_ps,1,&dn,&nf); |
stat = nd_nf(m,head,g,nd_ps,1,0,&nf); |
if ( !stat ) |
if ( !stat ) |
nd_reconstruct(0,0); |
nd_reconstruct(0,0); |
else { |
else { |
if ( DP_Print ) { printf("."); fflush(stdout); } |
if ( DP_Print ) { printf("."); fflush(stdout); } |
if ( !m ) { |
|
NTOQ(NM(dn.z),SGN(dn.z),num); |
|
mulq(HCQ(head),num,&q); HCQ(head) = q; |
|
if ( DN(dn.z) ) { |
|
NTOQ(DN(dn.z),1,den); |
|
nd_mul_c_q(nf,den); |
|
} |
|
} |
|
nf = nd_add(m,head,nf); |
|
ndv_free(nd_ps[i]); |
ndv_free(nd_ps[i]); |
nd_removecont(m,nf); |
nd_removecont(m,nf); |
nd_ps[i] = ndtondv(m,nf); nd_free(nf); |
nd_ps[i] = ndtondv(m,nf); nd_free(nf); |
Line 2187 int ndv_newps(int m,NDV a,NDV aq) |
|
Line 2280 int ndv_newps(int m,NDV a,NDV aq) |
|
nd_ps[nd_psn] = a; |
nd_ps[nd_psn] = a; |
if ( aq ) { |
if ( aq ) { |
nd_ps_trace[nd_psn] = aq; |
nd_ps_trace[nd_psn] = aq; |
|
register_hcf(aq); |
nd_bound[nd_psn] = ndv_compute_bound(aq); |
nd_bound[nd_psn] = ndv_compute_bound(aq); |
SG(r) = SG(aq); ndl_copy(HDL(aq),DL(r)); |
SG(r) = SG(aq); ndl_copy(HDL(aq),DL(r)); |
} else { |
} else { |
|
if ( !m ) register_hcf(a); |
nd_bound[nd_psn] = ndv_compute_bound(a); |
nd_bound[nd_psn] = ndv_compute_bound(a); |
SG(r) = SG(a); ndl_copy(HDL(a),DL(r)); |
SG(r) = SG(a); ndl_copy(HDL(a),DL(r)); |
} |
} |
Line 2233 void ndv_setup(int mod,int trace,NODE f,int dont_sort) |
|
Line 2328 void ndv_setup(int mod,int trace,NODE f,int dont_sort) |
|
nd_ps_trace = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
nd_ps_trace = (NDV *)MALLOC(nd_pslen*sizeof(NDV)); |
nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist)); |
nd_psh = (RHist *)MALLOC(nd_pslen*sizeof(RHist)); |
nd_bound = (UINT **)MALLOC(nd_pslen*sizeof(UINT *)); |
nd_bound = (UINT **)MALLOC(nd_pslen*sizeof(UINT *)); |
|
nd_hcf = 0; |
|
|
|
if ( trace && nd_vc ) |
|
makesubst(nd_vc,&nd_subst); |
|
else |
|
nd_subst = 0; |
|
|
if ( !nd_red ) |
if ( !nd_red ) |
nd_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist)); |
nd_red = (RHist *)MALLOC(REDTAB_LEN*sizeof(RHist)); |
for ( i = 0; i < REDTAB_LEN; i++ ) nd_red[i] = 0; |
for ( i = 0; i < REDTAB_LEN; i++ ) nd_red[i] = 0; |
Line 2241 void ndv_setup(int mod,int trace,NODE f,int dont_sort) |
|
Line 2342 void ndv_setup(int mod,int trace,NODE f,int dont_sort) |
|
if ( trace ) { |
if ( trace ) { |
a = nd_ps_trace[i] = ndv_dup(0,w[i]); |
a = nd_ps_trace[i] = ndv_dup(0,w[i]); |
ndv_removecont(0,a); |
ndv_removecont(0,a); |
|
register_hcf(a); |
am = nd_ps[i] = ndv_dup(mod,a); |
am = nd_ps[i] = ndv_dup(mod,a); |
ndv_mod(mod,am); |
ndv_mod(mod,am); |
ndv_removecont(mod,am); |
ndv_removecont(mod,am); |
} else { |
} else { |
a = nd_ps[i] = ndv_dup(mod,w[i]); |
a = nd_ps[i] = ndv_dup(mod,w[i]); |
ndv_removecont(mod,a); |
ndv_removecont(mod,a); |
|
if ( !mod ) register_hcf(a); |
} |
} |
NEWRHist(r); SG(r) = HTD(a); ndl_copy(HDL(a),DL(r)); |
NEWRHist(r); SG(r) = HTD(a); ndl_copy(HDL(a),DL(r)); |
nd_bound[i] = ndv_compute_bound(a); |
nd_bound[i] = ndv_compute_bound(a); |
Line 2376 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
Line 2479 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
NDV b; |
NDV b; |
int ishomo,nalg; |
int ishomo,nalg; |
Alg alpha,dp; |
Alg alpha,dp; |
P p; |
P p,zp; |
|
Q dmy; |
LIST f1,f2; |
LIST f1,f2; |
Obj obj; |
Obj obj; |
NumberField nf; |
NumberField nf; |
Line 2385 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
Line 2489 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
if ( !m && Demand ) nd_demand = 1; |
if ( !m && Demand ) nd_demand = 1; |
else nd_demand = 0; |
else nd_demand = 0; |
|
|
|
if ( DP_Multiple ) |
|
nd_scale = ((double)DP_Multiple)/(double)(Denominator?Denominator:1); |
#if 0 |
#if 0 |
ndv_alloc = 0; |
ndv_alloc = 0; |
#endif |
#endif |
get_vars((Obj)f,&fv); pltovl(v,&vv); |
get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc); |
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
switch ( ord->id ) { |
switch ( ord->id ) { |
case 1: |
case 1: |
Line 2422 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
Line 2528 void nd_gr(LIST f,LIST v,int m,int f4,struct order_spe |
|
nd_setup_parameters(nvar,max); |
nd_setup_parameters(nvar,max); |
ishomo = 1; |
ishomo = 1; |
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
b = (pointer)ptondv(CO,vv,(P)BDY(t)); |
ptozp((P)BDY(t),1,&dmy,&zp); |
|
b = (pointer)ptondv(CO,vv,zp); |
if ( ishomo ) |
if ( ishomo ) |
ishomo = ishomo && ndv_ishomo(b); |
ishomo = ishomo && ndv_ishomo(b); |
if ( m ) ndv_mod(m,b); |
if ( m ) ndv_mod(m,b); |
Line 2455 void nd_gr_postproc(LIST f,LIST v,int m,struct order_s |
|
Line 2562 void nd_gr_postproc(LIST f,LIST v,int m,struct order_s |
|
NDV b; |
NDV b; |
int ishomo,nalg; |
int ishomo,nalg; |
Alg alpha,dp; |
Alg alpha,dp; |
P p; |
P p,zp; |
|
Q dmy; |
LIST f1,f2; |
LIST f1,f2; |
Obj obj; |
Obj obj; |
NumberField nf; |
NumberField nf; |
struct order_spec *ord1; |
struct order_spec *ord1; |
|
|
get_vars((Obj)f,&fv); pltovl(v,&vv); |
get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc); |
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
switch ( ord->id ) { |
switch ( ord->id ) { |
case 1: |
case 1: |
Line 2495 void nd_gr_postproc(LIST f,LIST v,int m,struct order_s |
|
Line 2603 void nd_gr_postproc(LIST f,LIST v,int m,struct order_s |
|
nd_setup_parameters(nvar,max); |
nd_setup_parameters(nvar,max); |
ishomo = 1; |
ishomo = 1; |
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
for ( fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
b = (pointer)ptondv(CO,vv,(P)BDY(t)); |
ptozp((P)BDY(t),1,&dmy,&zp); |
|
b = (pointer)ptondv(CO,vv,zp); |
if ( ishomo ) |
if ( ishomo ) |
ishomo = ishomo && ndv_ishomo(b); |
ishomo = ishomo && ndv_ishomo(b); |
if ( m ) ndv_mod(m,b); |
if ( m ) ndv_mod(m,b); |
Line 2534 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
Line 2643 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
int m,nocheck,nvar,mindex,e,max; |
int m,nocheck,nvar,mindex,e,max; |
NDV c; |
NDV c; |
NMV a; |
NMV a; |
P p; |
P p,zp; |
|
Q dmy; |
EPOS oepos; |
EPOS oepos; |
int obpe,oadv,wmax,i,len,cbpe,ishomo,nalg; |
int obpe,oadv,wmax,i,len,cbpe,ishomo,nalg; |
Alg alpha,dp; |
Alg alpha,dp; |
Line 2543 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
Line 2653 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
Obj obj; |
Obj obj; |
NumberField nf; |
NumberField nf; |
struct order_spec *ord1; |
struct order_spec *ord1; |
|
struct oEGT eg_check,eg0,eg1; |
|
|
get_vars((Obj)f,&fv); pltovl(v,&vv); |
if ( DP_Multiple ) |
|
nd_scale = ((double)DP_Multiple)/(double)(Denominator?Denominator:1); |
|
|
|
get_vars((Obj)f,&fv); pltovl(v,&vv); vlminus(fv,vv,&nd_vc); |
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
for ( nvar = 0, tv = vv; tv; tv = NEXT(tv), nvar++ ); |
switch ( ord->id ) { |
switch ( ord->id ) { |
case 1: |
case 1: |
Line 2589 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
Line 2703 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
obpe = nd_bpe; oadv = nmv_adv; oepos = nd_epos; |
obpe = nd_bpe; oadv = nmv_adv; oepos = nd_epos; |
ishomo = 1; |
ishomo = 1; |
for ( in0 = 0, fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
for ( in0 = 0, fd0 = 0, t = BDY(f); t; t = NEXT(t) ) { |
c = ptondv(CO,vv,(P)BDY(t)); |
ptozp((P)BDY(t),1,&dmy,&zp); |
|
c = (pointer)ptondv(CO,vv,zp); |
if ( ishomo ) |
if ( ishomo ) |
ishomo = ishomo && ndv_ishomo(c); |
ishomo = ishomo && ndv_ishomo(c); |
if ( c ) { |
if ( c ) { |
Line 2634 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
Line 2749 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
cbpe = nd_bpe; |
cbpe = nd_bpe; |
if ( nocheck ) |
if ( nocheck ) |
break; |
break; |
|
get_eg(&eg0); |
if ( ndv_check_candidate(in0,obpe,oadv,oepos,cand) ) |
if ( ndv_check_candidate(in0,obpe,oadv,oepos,cand) ) |
/* success */ |
/* success */ |
break; |
break; |
Line 2653 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
Line 2769 void nd_gr_trace(LIST f,LIST v,int trace,int homo,int |
|
} |
} |
} |
} |
} |
} |
|
get_eg(&eg1); init_eg(&eg_check); add_eg(&eg_check,&eg0,&eg1); |
|
if ( DP_Print ) |
|
fprintf(asir_out,"check=%fsec\n",eg_check.exectime+eg_check.gctime); |
/* dp->p */ |
/* dp->p */ |
nd_bpe = cbpe; |
nd_bpe = cbpe; |
nd_setup_parameters(nd_nvar,0); |
nd_setup_parameters(nd_nvar,0); |
Line 2789 void nd_removecont(int mod,ND p) |
|
Line 2908 void nd_removecont(int mod,ND p) |
|
v.len = n; |
v.len = n; |
v.body = (pointer *)w; |
v.body = (pointer *)w; |
for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) w[i] = CQ(m); |
for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) w[i] = CQ(m); |
removecont_array(w,n); |
removecont_array((P *)w,n,1); |
for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) CQ(m) = w[i]; |
for ( m = BDY(p), i = 0; i < n; m = NEXT(m), i++ ) CQ(m) = w[i]; |
} |
} |
} |
} |
Line 2803 void nd_removecont2(ND p1,ND p2) |
|
Line 2922 void nd_removecont2(ND p1,ND p2) |
|
struct oVECT v; |
struct oVECT v; |
N q,r; |
N q,r; |
|
|
if ( !p1 ) { |
|
nd_removecont(0,p2); return; |
|
} else if ( !p2 ) { |
|
nd_removecont(0,p1); return; |
|
} |
|
n1 = nd_length(p1); |
n1 = nd_length(p1); |
n2 = nd_length(p2); |
n2 = nd_length(p2); |
n = n1+n2; |
n = n1+n2; |
w = (Q *)ALLOCA(n*sizeof(Q)); |
w = (Q *)ALLOCA(n*sizeof(Q)); |
v.len = n; |
v.len = n; |
v.body = (pointer *)w; |
v.body = (pointer *)w; |
for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) w[i] = CQ(m); |
i = 0; |
for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) w[i] = CQ(m); |
if ( p1 ) |
removecont_array(w,n); |
for ( m = BDY(p1); i < n1; m = NEXT(m), i++ ) w[i] = CQ(m); |
for ( m = BDY(p1), i = 0; i < n1; m = NEXT(m), i++ ) CQ(m) = w[i]; |
if ( p2 ) |
for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) CQ(m) = w[i]; |
for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) w[i] = CQ(m); |
|
removecont_array((P *)w,n,1); |
|
i = 0; |
|
if ( p1 ) |
|
for ( m = BDY(p1); i < n1; m = NEXT(m), i++ ) CQ(m) = w[i]; |
|
if ( p2 ) |
|
for ( m = BDY(p2); i < n; m = NEXT(m), i++ ) CQ(m) = w[i]; |
} |
} |
|
|
void ndv_removecont(int mod,NDV p) |
void ndv_removecont(int mod,NDV p) |
{ |
{ |
int i,len; |
int i,len,all_p; |
Q *w; |
Q *c; |
|
P *w; |
Q dvr,t; |
Q dvr,t; |
|
P g,cont,tp; |
NMV m; |
NMV m; |
|
|
if ( mod == -1 ) |
if ( mod == -1 ) |
Line 2834 void ndv_removecont(int mod,NDV p) |
|
Line 2956 void ndv_removecont(int mod,NDV p) |
|
ndv_mul_c(mod,p,invm(HCM(p),mod)); |
ndv_mul_c(mod,p,invm(HCM(p),mod)); |
else { |
else { |
len = p->len; |
len = p->len; |
w = (Q *)ALLOCA(len*sizeof(Q)); |
w = (P *)ALLOCA(len*sizeof(P)); |
for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) w[i] = CQ(m); |
c = (Q *)ALLOCA(len*sizeof(Q)); |
sortbynm(w,len); |
for ( m = BDY(p), all_p = 1, i = 0; i < len; NMV_ADV(m), i++ ) { |
qltozl(w,len,&dvr); |
ptozp(CP(m),1,&c[i],&w[i]); |
for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) { |
all_p = all_p && !NUM(w[i]); |
divq(CQ(m),dvr,&t); CQ(m) = t; |
|
} |
} |
|
if ( all_p ) { |
|
qltozl(c,len,&dvr); nd_heu_nezgcdnpz(nd_vc,w,len,1,&g); |
|
mulp(nd_vc,(P)dvr,g,&cont); |
|
for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) { |
|
divsp(nd_vc,CP(m),cont,&tp); CP(m) = tp; |
|
} |
|
} else { |
|
sortbynm((Q *)c,len); |
|
qltozl((Q *)c,len,&dvr); |
|
for ( m = BDY(p), i = 0; i < len; NMV_ADV(m), i++ ) { |
|
divsp(nd_vc,CP(m),(P)dvr,&tp); CP(m) = tp; |
|
} |
|
} |
} |
} |
} |
} |
|
|
Line 2890 void ndv_dehomogenize(NDV p,struct order_spec *ord) |
|
Line 3024 void ndv_dehomogenize(NDV p,struct order_spec *ord) |
|
NV(p)--; |
NV(p)--; |
} |
} |
|
|
void removecont_array(Q *c,int n) |
void nd_heu_nezgcdnpz(VL vl,P *pl,int m,int full,P *pr) |
{ |
{ |
|
int i; |
|
P *tpl,*tpl1; |
|
NODE l; |
|
P h,gcd,t; |
|
|
|
tpl = (P *)ALLOCA(m*sizeof(P)); |
|
tpl1 = (P *)ALLOCA(m*sizeof(P)); |
|
bcopy(pl,tpl,m*sizeof(P)); |
|
gcd = (P)ONE; |
|
for ( l = nd_hcf; l; l = NEXT(l) ) { |
|
h = (P)BDY(l); |
|
while ( 1 ) { |
|
for ( i = 0; i < m; i++ ) |
|
if ( !divtpz(vl,tpl[i],h,&tpl1[i]) ) |
|
break; |
|
if ( i == m ) { |
|
bcopy(tpl1,tpl,m*sizeof(P)); |
|
mulp(vl,gcd,h,&t); gcd = t; |
|
} else |
|
break; |
|
} |
|
} |
|
if ( DP_Print > 2 ){fprintf(asir_out,"[%d]",nmonop(gcd)); fflush(asir_out);} |
|
if ( full ) { |
|
heu_nezgcdnpz(vl,tpl,m,&t); |
|
mulp(vl,gcd,t,pr); |
|
} else |
|
*pr = gcd; |
|
} |
|
|
|
void removecont_array(P *p,int n,int full) |
|
{ |
|
int all_p,all_q,i; |
|
Q *c; |
|
P *w; |
|
P t,s; |
|
|
|
for ( all_q = 1, i = 0; i < n; i++ ) |
|
all_q = all_q && NUM(p[i]); |
|
if ( all_q ) { |
|
removecont_array_q((Q *)p,n); |
|
} else { |
|
c = (Q *)ALLOCA(n*sizeof(Q)); |
|
w = (P *)ALLOCA(n*sizeof(P)); |
|
for ( i = 0; i < n; i++ ) { |
|
ptozp(p[i],1,&c[i],&w[i]); |
|
} |
|
removecont_array_q(c,n); |
|
nd_heu_nezgcdnpz(nd_vc,w,n,full,&t); |
|
for ( i = 0; i < n; i++ ) { |
|
divsp(nd_vc,w[i],t,&s); mulp(nd_vc,s,(P)c[i],&p[i]); |
|
} |
|
} |
|
} |
|
|
|
void removecont_array_q(Q *c,int n) |
|
{ |
struct oVECT v; |
struct oVECT v; |
Q d0,d1,a,u,u1,gcd; |
Q d0,d1,a,u,u1,gcd; |
int i,j; |
int i,j; |
Line 2941 void nd_mul_c(int mod,ND p,int mul) |
|
Line 3132 void nd_mul_c(int mod,ND p,int mul) |
|
} |
} |
} |
} |
|
|
void nd_mul_c_q(ND p,Q mul) |
void nd_mul_c_q(ND p,P mul) |
{ |
{ |
NM m; |
NM m; |
Q c; |
P c; |
|
|
if ( !p ) return; |
if ( !p ) return; |
if ( UNIQ(mul) ) return; |
if ( UNIQ(mul) ) return; |
for ( m = BDY(p); m; m = NEXT(m) ) { |
for ( m = BDY(p); m; m = NEXT(m) ) { |
mulq(CQ(m),mul,&c); CQ(m) = c; |
mulp(nd_vc,CP(m),mul,&c); CP(m) = c; |
} |
} |
} |
} |
|
|
Line 3239 ND nd_copy(ND p) |
|
Line 3430 ND nd_copy(ND p) |
|
|
|
int nd_sp(int mod,int trace,ND_pairs p,ND *rp) |
int nd_sp(int mod,int trace,ND_pairs p,ND *rp) |
{ |
{ |
NM m; |
NM m1,m2; |
NDV p1,p2; |
NDV p1,p2; |
ND t1,t2; |
ND t1,t2; |
UINT *lcm; |
UINT *lcm; |
|
P gp,tp; |
|
Q g,t; |
int td; |
int td; |
|
|
if ( !mod && nd_demand ) { |
if ( !mod && nd_demand ) { |
Line 3255 int nd_sp(int mod,int trace,ND_pairs p,ND *rp) |
|
Line 3448 int nd_sp(int mod,int trace,ND_pairs p,ND *rp) |
|
} |
} |
} |
} |
lcm = LCM(p); |
lcm = LCM(p); |
NEWNM(m); |
NEWNM(m1); ndl_sub(lcm,HDL(p1),DL(m1)); |
CQ(m) = HCQ(p2); |
if ( ndl_check_bound2(p->i1,DL(m1)) ) { |
ndl_sub(lcm,HDL(p1),DL(m)); |
FREENM(m1); return 0; |
if ( ndl_check_bound2(p->i1,DL(m)) ) |
|
return 0; |
|
t1 = ndv_mul_nm(mod,m,p1); |
|
if ( mod == -1 ) CM(m) = _chsgnsf(HCM(p1)); |
|
else if ( mod ) CM(m) = mod-HCM(p1); |
|
else chsgnq(HCQ(p1),&CQ(m)); |
|
ndl_sub(lcm,HDL(p2),DL(m)); |
|
if ( ndl_check_bound2(p->i2,DL(m)) ) { |
|
nd_free(t1); |
|
return 0; |
|
} |
} |
t2 = ndv_mul_nm(mod,m,p2); |
NEWNM(m2); ndl_sub(lcm,HDL(p2),DL(m2)); |
|
if ( ndl_check_bound2(p->i2,DL(m2)) ) { |
|
FREENM(m1); FREENM(m2); return 0; |
|
} |
|
|
|
if ( mod == -1 ) { |
|
CM(m1) = HCM(p2); CM(m2) = _chsgnsf(HCM(p1)); |
|
} else if ( mod ) { |
|
CM(m1) = HCM(p2); CM(m2) = mod-HCM(p1); |
|
} else if ( nd_vc ) { |
|
ezgcdpz(nd_vc,HCP(p1),HCP(p2),&gp); |
|
divsp(nd_vc,HCP(p2),gp,&CP(m1)); |
|
divsp(nd_vc,HCP(p1),gp,&tp); chsgnp(tp,&CP(m2)); |
|
} else { |
|
igcd_cofactor(HCQ(p1),HCQ(p2),&g,&t,&CQ(m1)); chsgnq(t,&CQ(m2)); |
|
} |
|
t1 = ndv_mul_nm(mod,m1,p1); t2 = ndv_mul_nm(mod,m2,p2); |
*rp = nd_add(mod,t1,t2); |
*rp = nd_add(mod,t1,t2); |
FREENM(m); |
FREENM(m1); FREENM(m2); |
return 1; |
return 1; |
} |
} |
|
|
Line 3473 ND ndv_mul_nm(int mod,NM m0,NDV p) |
|
Line 3672 ND ndv_mul_nm(int mod,NM m0,NDV p) |
|
NMV m; |
NMV m; |
UINT *d,*dt,*dm; |
UINT *d,*dt,*dm; |
int c,n,td,i,c1,c2,len; |
int c,n,td,i,c1,c2,len; |
Q q; |
P q; |
ND r; |
ND r; |
|
|
if ( !p ) return 0; |
if ( !p ) return 0; |
Line 3505 ND ndv_mul_nm(int mod,NM m0,NDV p) |
|
Line 3704 ND ndv_mul_nm(int mod,NM m0,NDV p) |
|
ndl_add(DL(m),d,DL(mr)); |
ndl_add(DL(m),d,DL(mr)); |
} |
} |
} else { |
} else { |
q = CQ(m0); |
q = CP(m0); |
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
for ( i = 0; i < len; i++, NMV_ADV(m) ) { |
NEXTNM(mr0,mr); |
NEXTNM(mr0,mr); |
mulq(CQ(m),q,&CQ(mr)); |
mulp(nd_vc,CP(m),q,&CP(mr)); |
ndl_add(DL(m),d,DL(mr)); |
ndl_add(DL(m),d,DL(mr)); |
} |
} |
} |
} |
Line 3651 void ndv_mod(int mod,NDV p) |
|
Line 3850 void ndv_mod(int mod,NDV p) |
|
NMV t,d; |
NMV t,d; |
int r,s,u; |
int r,s,u; |
int i,len,dlen; |
int i,len,dlen; |
|
P cp; |
|
Q c; |
Obj gfs; |
Obj gfs; |
|
|
if ( !p ) return; |
if ( !p ) return; |
Line 3667 void ndv_mod(int mod,NDV p) |
|
Line 3868 void ndv_mod(int mod,NDV p) |
|
} |
} |
else |
else |
for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) { |
for ( t = d = BDY(p), i = 0; i < len; i++, NMV_ADV(t) ) { |
r = rem(NM(CQ(t)),mod); |
if ( nd_vc ) { |
|
nd_subst_vector(nd_vc,CP(t),nd_subst,&cp); |
|
c = (Q)cp; |
|
} else |
|
c = CQ(t); |
|
r = rem(NM(c),mod); |
if ( r ) { |
if ( r ) { |
if ( SGN(CQ(t)) < 0 ) |
if ( SGN(c) < 0 ) |
r = mod-r; |
r = mod-r; |
if ( DN(CQ(t)) ) { |
if ( DN(c) ) { |
s = rem(DN(CQ(t)),mod); |
s = rem(DN(c),mod); |
if ( !s ) |
if ( !s ) |
error("ndv_mod : division by 0"); |
error("ndv_mod : division by 0"); |
s = invm(s,mod); |
s = invm(s,mod); |
Line 4032 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
Line 4238 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
VL vv,tv; |
VL vv,tv; |
int stat,nvar,max,e; |
int stat,nvar,max,e; |
union oNDC dn; |
union oNDC dn; |
|
Q cont; |
|
P pp; |
|
|
if ( !f ) { |
if ( !f ) { |
*rp = 0; |
*rp = 0; |
Line 4057 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
Line 4265 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
/* 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); |
BDY(in) = (pointer)ptondv(CO,vv,(P)BDY(t)); |
ptozp((P)BDY(t),1,&cont,&pp); |
|
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); |
NEXTNODE(in0,in); |
Line 4071 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
Line 4280 void nd_nf_p(P f,LIST g,LIST v,int m,struct order_spec |
|
nd_scale=2; |
nd_scale=2; |
while ( 1 ) { |
while ( 1 ) { |
nd = (pointer)ndvtond(m,nd_ps[nd_psn]); |
nd = (pointer)ndvtond(m,nd_ps[nd_psn]); |
stat = nd_nf(m,nd,nd_ps,1,0,&nf); |
stat = nd_nf(m,0,nd,nd_ps,1,0,&nf); |
if ( !stat ) { |
if ( !stat ) { |
nd_psn++; |
nd_psn++; |
nd_reconstruct(0,0); |
nd_reconstruct(0,0); |
Line 4264 int ndv_reduce_vect_q(Q *svect,int trace,int col,IndAr |
|
Line 4473 int ndv_reduce_vect_q(Q *svect,int trace,int col,IndAr |
|
if ( j == col ) break; |
if ( j == col ) break; |
if ( hmag && ((double)p_mag((P)svect[j]) > hmag) ) { |
if ( hmag && ((double)p_mag((P)svect[j]) > hmag) ) { |
nz = compress_array(svect,cvect,col); |
nz = compress_array(svect,cvect,col); |
removecont_array(cvect,nz); |
removecont_array((P *)cvect,nz,1); |
expand_array(svect,cvect,nz); |
expand_array(svect,cvect,nz); |
hmag = ((double)p_mag((P)svect[j]))*nd_scale; |
hmag = ((double)p_mag((P)svect[j]))*nd_scale; |
} |
} |
} |
} |
} |
} |
nz = compress_array(svect,cvect,col); |
nz = compress_array(svect,cvect,col); |
removecont_array(cvect,nz); |
removecont_array((P *)cvect,nz,1); |
expand_array(svect,cvect,nz); |
expand_array(svect,cvect,nz); |
if ( DP_Print ) { |
if ( DP_Print ) { |
fprintf(asir_out,"-"); fflush(asir_out); |
fprintf(asir_out,"-"); fflush(asir_out); |