version 1.17, 2010/07/12 07:20:03 |
version 1.20, 2014/09/05 11:55:19 |
|
|
/* $OpenXM: OpenXM/src/asir-contrib/testing/noro/ndbf.rr,v 1.16 2010/07/12 07:01:04 noro Exp $ */ |
/* $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 |
Line 31 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 */ |
|
|
|
|
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); |
|
|
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 388 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 430 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) |
|
|
|
|
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 816 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 1424 def bf_strat(F) |
|
Line 1449 def bf_strat(F) |
|
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 1462 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) ) { |