version 1.10, 2010/04/28 05:58:43 |
version 1.20, 2014/09/05 11:55:19 |
|
|
|
/* $OpenXM: OpenXM/src/asir-contrib/testing/noro/ndbf.rr,v 1.19 2011/03/30 05:07:01 noro Exp $ */ |
/* requires 'primdec' */ |
/* requires 'primdec' */ |
|
|
#define TMP_H hhhhhhhh |
#define TMP_H hhhhhhhh |
#define TMP_S ssssssss |
#define TMP_S ssssssss |
#define TMP_DS dssssssss |
#define TMP_DS dssssssss |
#define TMP_T t |
#define TMP_T tttttttt |
#define TMP_DT dt |
#define TMP_DT dtttttttt |
#define TMP_Y1 yyyyyyyy1 |
#define TMP_Y1 yyyyyyyy1 |
#define TMP_DY1 dyyyyyyyy1 |
#define TMP_DY1 dyyyyyyyy1 |
#define TMP_Y2 yyyyyyyy2 |
#define TMP_Y2 yyyyyyyy2 |
Line 30 localf weyl_nf_quo, weyl_nf_mod, b_subst, v_factorial, |
|
Line 31 localf weyl_nf_quo, weyl_nf_mod, b_subst, v_factorial, |
|
localf replace_vars_f, replace_vars_v, replace_var$ |
localf replace_vars_f, replace_vars_v, replace_var$ |
localf action_on_gfs, action_on_gfs_1$ |
localf action_on_gfs, action_on_gfs_1$ |
localf nd_gb_candidate$ |
localf nd_gb_candidate$ |
localf in_gb_oaku$ |
localf in_gb_oaku, homogenize_oaku$ |
|
|
/* stratification */ |
/* stratification */ |
|
|
Line 44 localf ideal_intersection$ |
|
Line 45 localf ideal_intersection$ |
|
|
|
def bfunction(F) |
def bfunction(F) |
{ |
{ |
|
if ( member(s,vars(F)) ) |
|
error("ann : the variable 's' is reserved."); |
|
/* F -> F/Fcont */ |
|
F1 = ptozp(F); Fcont = sdiv(F,F1); F = F1; |
|
|
if ( type(Heu=getopt(heuristic)) == -1 ) Heu = 0; |
if ( type(Heu=getopt(heuristic)) == -1 ) Heu = 0; |
if ( type(Vord=getopt(vord)) == -1 || type(Vord) != 4 ) Vord = 0; |
if ( type(Vord=getopt(vord)) == -1 || type(Vord) != 4 ) Vord = 0; |
if ( type(Wt=getopt(weight)) == -1 ) Wt = 0; |
if ( type(Wt=getopt(weight)) == -1 ) Wt = 0; |
|
if ( type(Op=getopt(op)) == -1 ) Op = 0; |
L = in_ww(F|weight=Wt,heuristic=Heu,vord=Vord); |
L = in_ww(F|weight=Wt,heuristic=Heu,vord=Vord); |
Indata = L[0]; AllData = L[1]; VData = L[2]; |
Indata = L[0]; AllData = L[1]; VData = L[2]; |
GIN = Indata[0]; VDV = Indata[1]; WVDV = AllData[4]; |
GIN = Indata[0]; VDV = Indata[1]; WVDV = AllData[4]; |
|
|
dp_set_weight(W); |
dp_set_weight(W); |
B = weyl_minipoly(GIN,VDV,0,WVDV); |
B = weyl_minipoly(GIN,VDV,0,WVDV); |
dp_set_weight(0); |
dp_set_weight(0); |
return subst(B,s,-s-1); |
if ( !Op ) return subst(B,s,-s-1); |
|
|
|
V0 = VData[0]; DV0 = VData[1]; T = VData[2]; DT = VData[3]; |
|
BPT = weyl_subst(B,T*DT,VDV); |
|
|
|
/* computation using G0,GIN0,VDV0 */ |
|
G0 = AllData[0]; GIN0 = AllData[1]; VDV0 = AllData[2]; WtV0 = AllData[5]; |
|
dp_set_weight(WtV0); dp_ord(0); |
|
PS = map(dp_ptod,GIN0,VDV0); Len = length(PS); |
|
for ( I = Len-1, Ind = []; I >= 0; I-- ) Ind = cons(I,Ind); |
|
/* QR = [D,M,Coef] */ |
|
Ax = 1; |
|
AxBPT = dp_ptod(Ax*BPT,VDV0); |
|
QR = weyl_nf_quo(Ind,AxBPT,1,PS); |
|
if ( !weyl_nf_quo_check(AxBPT,PS,QR) ) |
|
error("bfunction : invalid quotient"); |
|
if ( QR[0] ) error("bfunction : invalid quotient"); |
|
Den = QR[1]; Coef = QR[2]; |
|
for ( I = 0, R = Den*AxBPT; I < Len; I++ ) |
|
R -= dp_weyl_mul(Coef[I],dp_ptod(G0[I],VDV0)); |
|
R = dp_dtop(R,VDV0); |
|
CR = conv_tdt(R,F,V0,DV0,T,DT); |
|
|
|
dp_set_weight(0); |
|
Cont = cont(CR); CR /= Cont; |
|
Cont *= dn(Fcont); Den *= nm(Fcont); |
|
Gcd = igcd(Den,Cont); |
|
return [subst(B,s,-s-1),(Cont*CR)/(Den*Ax)]; |
} |
} |
|
|
/* |
/* |
|
|
if ( type(Vord) != 4 ) { |
if ( type(Vord) != 4 ) { |
for ( I = 0; I < N; I++ ) |
for ( I = 0; I < N; I++ ) |
D[I] = [deg(F,V[I]),V[I]]; |
D[I] = [deg(F,V[I]),V[I]]; |
qsort(D,compare_first); |
qsort(D,ndbf.compare_first); |
for ( V = [], I = 0; I < N; I++ ) |
for ( V = [], I = 0; I < N; I++ ) |
V = cons(D[I][1],V); |
V = cons(D[I][1],V); |
V = reverse(V); |
V = reverse(V); |
|
|
} |
} |
for ( I = 0; I < N; I++ ) |
for ( I = 0; I < N; I++ ) |
D[I] = [deg(F1,V[I]),V[I]]; |
D[I] = [deg(F1,V[I]),V[I]]; |
qsort(D,compare_first); |
qsort(D,ndbf.compare_first); |
for ( V = [], I = 0; I < N; I++ ) |
for ( V = [], I = 0; I < N; I++ ) |
V = cons(D[I][1],V); |
V = cons(D[I][1],V); |
V = reverse(V); |
V = reverse(V); |
|
|
{ |
{ |
if ( member(s,vars(F)) ) |
if ( member(s,vars(F)) ) |
error("ann : the variable 's' is reserved."); |
error("ann : the variable 's' is reserved."); |
|
if ( type(Vord=getopt(vord)) == -1 ) Vord = 0; |
F = ptozp(F); |
F = ptozp(F); |
V = vars(F); |
V = vars(F); |
|
if ( Vord ) { |
|
Param = setminus(V,Vord); |
|
V = Vord; |
|
} |
N = length(V); |
N = length(V); |
D = newvect(N); |
D = newvect(N); |
if ( type(Wt=getopt(weight)) == -1 ) |
if ( type(Wt=getopt(weight)) == -1 ) |
|
|
F1 = subst(F1,VI,VI^WI); |
F1 = subst(F1,VI,VI^WI); |
} |
} |
for ( I = 0; I < N; I++ ) D[I] = [deg(F1,V[I]),V[I]]; |
for ( I = 0; I < N; I++ ) D[I] = [deg(F1,V[I]),V[I]]; |
qsort(D,compare_first); |
qsort(D,ndbf.compare_first); |
for ( V = [], I = 0; I < N; I++ ) V = cons(D[I][1],V); |
for ( V = [], I = 0; I < N; I++ ) V = cons(D[I][1],V); |
V = reverse(V); |
V = reverse(V); |
for ( I = 0; I < N; I++ ) { |
for ( I = 0; I < N; I++ ) { |
Line 349 def in_gb_oaku(F) |
|
Line 388 def in_gb_oaku(F) |
|
F1 = subst(F1,VI,VI^WI); |
F1 = subst(F1,VI,VI^WI); |
} |
} |
for ( I = 0; I < N; I++ ) D[I] = [deg(F1,V[I]),V[I]]; |
for ( I = 0; I < N; I++ ) D[I] = [deg(F1,V[I]),V[I]]; |
qsort(D,compare_first); |
qsort(D,ndbf.compare_first); |
for ( V = [], I = 0; I < N; I++ ) V = cons(D[I][1],V); |
for ( V = [], I = 0; I < N; I++ ) V = cons(D[I][1],V); |
V = reverse(V); |
V = reverse(V); |
for ( I = 0; I < N; I++ ) { |
for ( I = 0; I < N; I++ ) { |
Line 391 def in_gb_oaku(F) |
|
Line 430 def in_gb_oaku(F) |
|
return [G1,append(V,DV)]; |
return [G1,append(V,DV)]; |
} |
} |
|
|
|
/* homogenization w.r.t. (-W,W)-weight */ |
|
/* VDV = [x1,...,xn,dx1,...,dxn] */ |
|
/* homogenize F w.r.t. (W,-W,1) for (x,dx,y) */ |
|
|
|
def homogenize_oaku(F,VDV,W,Y) |
|
{ |
|
N = length(VDV); |
|
if ( N%2 ) error("invalid variable list"); |
|
N2 = N/2; |
|
if ( length(W) != N2 ) error("inconsistent weight vector"); |
|
W0 = dp_set_weight(); |
|
Wt = append(W,append(vtol(-ltov(W)),[1])); |
|
dp_set_weight(Wt); |
|
H = homogenize(F,VDV,Y); |
|
dp_set_weight(W0); |
|
if ( type(Vars=getopt(vars)) != -1 && Vars ) { |
|
DY = strtov("d"+rtostr(Y)); |
|
for ( I = 0, T = VDV, V = []; I < N2; I++, T = cdr(T) ) |
|
V = cons(car(T),V); |
|
T = cons(Y,append(T,[DY])); |
|
for ( ; V != []; V = cdr(V) ) T = cons(car(V),T); |
|
return [H,T]; |
|
} else return H; |
|
} |
|
|
/* F = [F0,F1,...] */ |
/* F = [F0,F1,...] */ |
|
|
def ann_n(F) |
def ann_n(F) |
|
|
B = car(S); |
B = car(S); |
for ( R = []; B != []; B = cdr(B) ) |
for ( R = []; B != []; B = cdr(B) ) |
if ( H = car(car(B)) ) |
if ( H = car(car(B)) ) |
R = cons(H,R); |
R = cons(ptozp(H),R); |
} else { |
} else { |
/* colon method */ |
/* colon method */ |
for ( I = 0; I < D; I++ ) |
for ( I = 0; I < D; I++ ) |
|
|
|
|
for ( I = 0; I < N; I++ ) |
for ( I = 0; I < N; I++ ) |
D[I] = [deg(F,V[I]),V[I]]; |
D[I] = [deg(F,V[I]),V[I]]; |
qsort(D,compare_first); |
qsort(D,ndbf.compare_first); |
for ( V = [], I = 0; I < N; I++ ) |
for ( V = [], I = 0; I < N; I++ ) |
V = cons(D[I][1],V); |
V = cons(D[I][1],V); |
for ( I = N-1, DV = []; I >= 0; I-- ) |
for ( I = N-1, DV = []; I >= 0; I-- ) |
Line 777 def bfct_via_gbfct(F) |
|
Line 841 def bfct_via_gbfct(F) |
|
|
|
for ( I = 0; I < N; I++ ) |
for ( I = 0; I < N; I++ ) |
D[I] = [deg(F,V[I]),V[I]]; |
D[I] = [deg(F,V[I]),V[I]]; |
qsort(D,compare_first); |
qsort(D,ndbf.compare_first); |
for ( V = [], I = 0; I < N; I++ ) |
for ( V = [], I = 0; I < N; I++ ) |
V = cons(D[I][1],V); |
V = cons(D[I][1],V); |
V = reverse(V); |
V = reverse(V); |
Line 1229 def replace_var(V,X,Y) |
|
Line 1293 def replace_var(V,X,Y) |
|
|
|
def action_on_gfs(P,V,GFS) |
def action_on_gfs(P,V,GFS) |
{ |
{ |
|
for ( T = V, DV = []; T != []; T = cdr(T) ) |
|
DV = cons(strtov("d"+rtostr(car(T))),DV); |
|
V = append(append(V,[s]),reverse(cons(ds,DV))); |
DP = dp_ptod(P,V); |
DP = dp_ptod(P,V); |
N = length(V)/2; |
N = length(V)/2; |
for ( I = N-1, V0 = []; I >= 0; I-- ) |
for ( I = N-1, V0 = []; I >= 0; I-- ) |
Line 1375 def weyl_ideal_quotient(B,F,VDV) |
|
Line 1442 def weyl_ideal_quotient(B,F,VDV) |
|
|
|
def bf_strat(F) |
def bf_strat(F) |
{ |
{ |
|
if ( member(s,vars(F)) ) |
|
error("ann : the variable 's' is reserved."); |
dp_ord(0); |
dp_ord(0); |
T0 = time(); |
T0 = time(); |
if ( type(Heu=getopt(heuristic)) == -1 ) Heu = 0; |
if ( type(Heu=getopt(heuristic)) == -1 ) Heu = 0; |
if ( type(Vord=getopt(vord)) == -1 || type(Vord) != 4 ) Vord = 0; |
if ( type(Vord=getopt(vord)) == -1 || type(Vord) != 4 ) Vord = 0; |
if ( type(Wt=getopt(weight)) == -1 ) Wt = 0; |
if ( type(Wt=getopt(weight)) == -1 ) Wt = 0; |
|
if ( type(ElimIdeal=getopt(elimideal)) == -1 ) ElimIdeal = 0; |
L = in_ww(F|weight=Wt,heuristic=Heu,vord=Vord); |
L = in_ww(F|weight=Wt,heuristic=Heu,vord=Vord); |
T1 = time(); |
T1 = time(); |
print(["in_ww",(T1[0]+T1[1])-(T0[0]+T0[1])]); |
print(["in_ww",(T1[0]+T1[1])-(T0[0]+T0[1])]); |
Line 1418 def bf_strat(F) |
|
Line 1488 def bf_strat(F) |
|
} |
} |
|
|
L2 = bf_strat_stage2(L); |
L2 = bf_strat_stage2(L); |
|
if ( ElimIdeal ) return L2; |
S = bf_strat_stage3(L2); |
S = bf_strat_stage3(L2); |
R = []; |
R = []; |
for ( T = S; T != []; T = cdr(T) ) { |
for ( T = S; T != []; T = cdr(T) ) { |
Line 1528 def bf_strat_stage3(L) |
|
Line 1599 def bf_strat_stage3(L) |
|
|
|
def bf_local(F,P) |
def bf_local(F,P) |
{ |
{ |
|
if ( member(s,vars(F)) ) |
|
error("ann : the variable 's' is reserved."); |
/* F -> F/Fcont */ |
/* F -> F/Fcont */ |
F1 = ptozp(F); Fcont = sdiv(F,F1); F = F1; |
F1 = ptozp(F); Fcont = sdiv(F,F1); F = F1; |
if ( type(Heu=getopt(heuristic)) == -1 ) Heu = 0; |
if ( type(Heu=getopt(heuristic)) == -1 ) Heu = 0; |