version 1.19, 2004/01/07 06:53:11 |
version 1.29, 2004/01/13 03:26:49 |
Line 112 def jacobi(N,A,W){ |
|
Line 112 def jacobi(N,A,W){ |
|
return 1; |
return 1; |
} |
} |
|
|
|
def interval2value(A,Vars){ |
|
|
|
B=atl(A)$ |
|
|
|
if(length(B)>2){ |
|
print("bug")$ |
|
return []$ |
|
} |
|
else if(length(B)==0){ |
|
if(fop(A)==0) |
|
return [Vars,1]$ |
|
else |
|
return []$ |
|
} |
|
else if(length(B)==1){ |
|
|
|
C=fargs(B[0])$ |
|
D=vars(C)$ |
|
E=solve(C,D)$ |
|
|
|
if(fop(B[0])==15) |
|
return [Vars,E[0][1]+1]$ |
|
else if(fop(B[0])==11) |
|
return [Vars,E[0][1]-1]$ |
|
else if(fop(B[0])==8) |
|
return [Vars,E[0][1]]$ |
|
else |
|
return []$ |
|
} |
|
else{ |
|
|
|
C=fargs(B[0])$ |
|
D=vars(C)$ |
|
E=solve(C,D)$ |
|
|
|
C=fargs(B[1])$ |
|
D=vars(C)$ |
|
F=solve(C,D)$ |
|
|
|
return [Vars,(E[0][1]+F[0][1])/2]$ |
|
} |
|
|
|
} |
|
|
|
def fixpointmain(F,Vars){ |
|
|
|
RET=[]$ |
|
for(I=length(Vars)-1;I>=1;I--){ |
|
|
|
for(H=[],J=0;J<I;J++) |
|
H=cons(Vars[J],H)$ |
|
|
|
G=interval2value(qe(ex(H,F)),Vars[I])$ |
|
|
|
if(G==[]) |
|
return RET$ |
|
else |
|
RET=cons(G,RET)$ |
|
|
|
F=subf(F,G[0],G[1])$ |
|
} |
|
|
|
G=interval2value(simpl(F),Vars[0])$ |
|
|
|
if(G==[]) |
|
return RET$ |
|
else |
|
RET=cons(G,RET)$ |
|
|
|
return RET$ |
|
} |
|
|
|
|
|
def fixedpoint(A,FLAG){ |
|
|
|
Vars=vars(A)$ |
|
|
|
N=length(A)$ |
|
|
|
if (FLAG==0) |
|
for(F=@true,I=0;I < N; I++ ) { F = F @&& A[I] @> 0$ } |
|
else if (FLAG==1) |
|
for(F=@true,I=0;I < N; I++ ) { F = F @&& A[I] @< 0$ } |
|
|
|
return fixpointmain(F,Vars)$ |
|
} |
|
|
def nonzerovec(A){ |
def nonzerovec(A){ |
|
|
for(I=0;I<size(A)[0];I++) |
for(I=0;I<size(A)[0];I++) |
|
|
return A$ |
return A$ |
} |
} |
|
|
def perm(I,P,TMP){ |
def wsort(A,B,C,ID){ |
|
|
if(I>0){ |
D=newvect(length(B))$ |
TMP=perm(I-1,P,TMP)$ |
for(I=0;I<length(B);I++) |
for(J=I-1;J>=0;J--){ |
D[I]=[A[I],B[I],C[I]]$ |
T=P[I]$ |
|
P[I]=P[J]$ |
|
P[J]=T$ |
|
TMP=perm(I-1,P,TMP)$ |
|
T=P[I]$ |
|
P[I]=P[J]$ |
|
P[J]=T$ |
|
} |
|
|
|
return TMP$ |
D=bsort(D)$ |
} |
|
else{ |
|
for(TMP0=[],K=0;K<size(P)[0];K++) |
|
TMP0=cons(P[K],TMP0)$ |
|
|
|
TMP=cons(TMP0,TMP)$ |
|
return TMP$ |
|
} |
|
} |
|
|
|
def marge(A,B){ |
for(E=[],I=0;I<length(B);I++) |
|
E=cons(D[I][1],E)$ |
|
E=reverse(E)$ |
|
|
RET=[]$ |
for(F=[],I=0;I<length(B);I++) |
for(I=0;I<length(A);I++) |
F=cons(D[I][2],F)$ |
for(J=0;J<length(B);J++) |
F=reverse(F)$ |
RET=cons(append(A[I],B[J]),RET)$ |
|
|
|
return RET$ |
|
} |
|
|
|
def wsort(A,B,C,FLAG,ID){ |
|
|
|
if(FLAG==0){ |
|
D=newvect(length(B))$ |
|
for(I=0;I<length(B);I++) |
|
D[I]=[A[I],B[I],C[I]]$ |
|
|
|
D=bsort(D)$ |
|
E=[]$ |
|
for(I=0;I<length(B);I++) |
|
E=cons(D[I][1],E)$ |
|
E=reverse(E)$ |
|
F=[]$ |
|
for(I=0;I<length(B);I++) |
|
F=cons(D[I][2],F)$ |
|
F=reverse(F)$ |
|
|
|
return [[ID,E,F]]$ |
return [[ID,E,F]]$ |
} |
|
else{ |
|
D=newvect(length(B))$ |
|
for(I=0;I<length(B);I++) |
|
D[I]=[A[I],B[I],C[I]]$ |
|
|
|
D=qsort(D,worder)$ |
|
D0=[]$ |
|
|
|
for(I=0,J=0,TMP=[],X=0;I<size(D)[0];I++){ |
|
if(X==D[I][0]) |
|
TMP=cons(cdr(D[I]),TMP)$ |
|
else{ |
|
D0=cons(TMP,D0)$ |
|
TMP=[]$ |
|
TMP=cons(cdr(D[I]),TMP)$ |
|
X=car(D[I])$ |
|
} |
|
} |
|
D0=cdr(reverse(cons(TMP,D0)))$ |
|
D0=map(ltov,D0)$ |
|
for(I=0,TMP=[[]];I<length(D0);I++){ |
|
TMP0=perm(length(D0[I])-1,D0[I],[])$ |
|
TMP=marge(TMP,TMP0)$ |
|
} |
|
|
|
RET=[]$ |
|
for(I=0;I<length(TMP);I++){ |
|
TMP0=[]$ |
|
TMP1=[]$ |
|
for(J=0;J<length(TMP[I]);J++){ |
|
TMP0=cons(TMP[I][J][0],TMP0)$ |
|
TMP1=cons(TMP[I][J][1],TMP1)$ |
|
} |
|
TMP0=reverse(TMP0)$ |
|
TMP1=reverse(TMP1)$ |
|
|
|
RET=cons([ID,TMP0,TMP1],RET)$ |
|
} |
|
|
|
return RET$ |
|
} |
|
} |
} |
|
|
def nonposdegchk(Res){ |
def nonposdegchk(Res){ |
Line 304 def makeret(Res,Vars,FLAG){ |
|
Line 313 def makeret(Res,Vars,FLAG){ |
|
|
|
ResVec=newvect(ResNum)$ |
ResVec=newvect(ResNum)$ |
|
|
for(M=0,I=0;I<ResNum;I++){ |
if(FLAG) |
|
M=0$ |
|
else |
|
M=-1$ |
|
|
|
for(I=0;I<ResNum;I++){ |
if(member(Res[I][0],Vars)){ |
if(member(Res[I][0],Vars)){ |
ResVec[I]=Res[I][1]$ |
ResVec[I]=Res[I][1]$ |
|
|
if(FLAG && type(ResVec[I])==1){ |
if(FLAG){ |
if(M==0) |
if(type(ResVec[I])==1){ |
M=ResVec[I]$ |
if(M==0) |
else |
M=ResVec[I]$ |
if(ResVec[I]<M) |
else |
M=ResVec[I]$ |
if(ResVec[I]<M) |
} |
M=ResVec[I]$ |
} |
} |
|
else |
|
M=-1$ |
|
} |
|
} |
} |
} |
|
|
if(M!=0) |
|
|
if(M!=-1) |
ResVec=ResVec/M; |
ResVec=ResVec/M; |
|
|
RET=newvect(VarsNum,Vars)$ |
RET=newvect(VarsNum,Vars)$ |
Line 449 def checktd(PolyList,Vars,ResVars){ |
|
Line 468 def checktd(PolyList,Vars,ResVars){ |
|
return 1$ |
return 1$ |
} |
} |
|
|
|
def value2(Vars,Ans){ |
|
|
|
N=length(Vars)$ |
|
Res=newvect(N)$ |
|
for(I=0;I<N;I++){ |
|
Res[I]=newvect(2)$ |
|
Res[I][0]=Vars[I]$ |
|
Res[I][1]=Ans[I]$ |
|
} |
|
|
|
Res=getgcd(Res,Vars)$ |
|
|
|
if(nonposdegchk(Res)){ |
|
TMP1=makeret(Res,Vars,1)$ |
|
return vtol(TMP1[1])$ |
|
} |
|
else |
|
return []$ |
|
} |
|
|
def qcheck(PolyList,Vars,FLAG){ |
def qcheck(PolyList,Vars,FLAG){ |
|
|
RET=[]$ |
RET=[]$ |
Line 480 def qcheck(PolyList,Vars,FLAG){ |
|
Line 519 def qcheck(PolyList,Vars,FLAG){ |
|
|
|
if(nonposdegchk(Res)){ |
if(nonposdegchk(Res)){ |
|
|
ResVars=makeret(Res,Vars,0)$ |
TMP1=makeret(Res,Vars,0)$ |
|
|
if(checktd(PolyList,Vars,ResVars[1])==1){ |
if(checktd(PolyList,Vars,TMP1[1])==1){ |
if(ResVars[0]==0){ |
|
RET=append(RET,wsort(ResVars[1],Vars, |
|
ResVars[1],FLAG,0))$ |
|
|
|
return RET$ |
if(FLAG==0){ |
|
|
|
if(TMP1[0]==0) |
|
RET=append(RET,wsort(TMP1[1],Vars,TMP1[1],0))$ |
|
else{ |
|
|
|
TMP=vtol(TMP1[1])$ |
|
RET0=[]$ |
|
if((TMP0=fixedpoint(TMP,0))!=[]){ |
|
|
|
for(I=0;I<length(TMP0);I++) |
|
TMP=map(subst,TMP,TMP0[I][0],TMP0[I][1])$ |
|
RET0=value2(Vars,TMP)$ |
|
if(RET0!=[]) |
|
RET0=wsort(RET0,Vars,RET0,1/10)$ |
|
} |
|
|
|
TMP=vtol(TMP1[1])$ |
|
if(RET0==[] && (TMP0=fixedpoint(TMP,1))!=[]){ |
|
|
|
for(I=0;I<length(TMP0);I++) |
|
TMP=map(subst,TMP,TMP0[I][0],TMP0[I][1])$ |
|
RET0=value2(Vars,TMP)$ |
|
|
|
if(RET0!=[]) |
|
RET0=wsort(RET0,Vars,RET0,1/10)$ |
|
} |
|
RET=append(RET,RET0)$ |
|
} |
} |
} |
else{ |
else if(FLAG==1) |
RET=append(RET,[[0,Vars,vtol(ResVars[1])]])$ |
RET=append(RET,[[0,Vars,vtol(TMP1[1])]])$ |
return RET$ |
|
} |
|
} |
} |
else |
|
return []$ |
|
} |
} |
else |
|
return []$ |
|
|
|
|
return RET$ |
} |
} |
|
|
def leastsq(NormMat,ExpMat,Vars,FLAG,ID){ |
def leastsq(NormMat,ExpMat,Vars,FLAG,ID){ |
Line 552 def leastsq(NormMat,ExpMat,Vars,FLAG,ID){ |
|
Line 611 def leastsq(NormMat,ExpMat,Vars,FLAG,ID){ |
|
|
|
TMP1=makeret(Res,Vars,1)$ |
TMP1=makeret(Res,Vars,1)$ |
|
|
if(TMP1[0]==0){ |
if(FLAG==0){ |
TMP=roundret(TMP1[1])$ |
|
|
|
RET=append(RET,wsort(TMP1[1],Vars, |
if(TMP1[0]==0){ |
map(drint,TMP1[1]*1.0),FLAG,ID))$ |
|
|
|
if(TMP!=[]) |
TMP=roundret(TMP1[1])$ |
RET=append(RET,wsort(TMP1[1],Vars, |
|
TMP,FLAG,ID+1))$ |
|
|
|
return RET$ |
RET=append(RET,wsort(TMP1[1],Vars,map(drint,TMP1[1]*1.0),ID))$ |
|
|
|
if(TMP!=[]) |
|
RET=append(RET,wsort(TMP1[1],Vars,TMP,ID+1))$ |
|
} |
|
else{ |
|
|
|
TMP=vtol(TMP1[1])$ |
|
RET0=[]$ |
|
if((TMP0=fixedpoint(TMP,0))!=[]){ |
|
|
|
for(I=0;I<length(TMP0);I++) |
|
TMP=map(subst,TMP,TMP0[I][0],TMP0[I][1])$ |
|
RET0=value2(Vars,TMP)$ |
|
if(RET0!=[]) |
|
RET0=wsort(RET0,Vars,RET0,ID+1/10)$ |
|
} |
|
|
|
TMP=vtol(TMP1[1])$ |
|
if(RET0==[] && (TMP0=fixedpoint(TMP,1))!=[]){ |
|
|
|
for(I=0;I<length(TMP0);I++) |
|
TMP=map(subst,TMP,TMP0[I][0],TMP0[I][1])$ |
|
RET0=value2(Vars,TMP)$ |
|
|
|
if(RET0!=[]) |
|
RET0=wsort(RET0,Vars,RET0,ID+1/10)$ |
|
} |
|
|
|
RET=append(RET,RET0)$ |
|
} |
|
|
} |
} |
else{ |
else if(FLAG==1) |
RET=append(RET,[[ID,Vars,vtol(TMP1[1]*1.0)]])$ |
RET=append(RET,[[ID,Vars,vtol(TMP1[1])]])$ |
return RET$ |
|
} |
|
} |
} |
else |
|
return RET$ |
|
|
|
|
return RET$ |
} |
} |
|
|
def unitweight(ExpMat,Vars,PolyListNum,OneMat,FLAG){ |
def unitweight(ExpMat,Vars,PolyListNum,OneMat,FLAG){ |
Line 616 def unitweight(ExpMat,Vars,PolyListNum,OneMat,FLAG){ |
|
Line 699 def unitweight(ExpMat,Vars,PolyListNum,OneMat,FLAG){ |
|
for(I=0;I<ExpMatColNum;I++) |
for(I=0;I<ExpMatColNum;I++) |
for(J=0;J<PolyListNum;J++) |
for(J=0;J<PolyListNum;J++) |
for(K=OneMat[J];K<OneMat[J+1];K++) |
for(K=OneMat[J];K<OneMat[J+1];K++) |
NormMat1[I][J+ExpMatColNum]-= |
NormMat1[I][J+ExpMatColNum]-=ExpMat[K][I]$ |
ExpMat[K][I]$ |
|
|
|
for(I=0;I<PolyListNum;I++) |
for(I=0;I<PolyListNum;I++) |
NormMat1[I+ExpMatColNum][I+ExpMatColNum]=OneMat[I+1]-OneMat[I]$ |
NormMat1[I+ExpMatColNum][I+ExpMatColNum]=OneMat[I+1]-OneMat[I]$ |
Line 635 def unitweight(ExpMat,Vars,PolyListNum,OneMat,FLAG){ |
|
Line 717 def unitweight(ExpMat,Vars,PolyListNum,OneMat,FLAG){ |
|
|
|
TMP1=makeret(Res,Vars,1)$ |
TMP1=makeret(Res,Vars,1)$ |
|
|
TMP=roundret(TMP1[1])$ |
if(FLAG==0){ |
|
TMP=roundret(TMP1[1])$ |
|
|
RET=append(RET,wsort(TMP1[1],Vars, |
RET=append(RET,wsort(TMP1[1],Vars,map(drint,TMP1[1]*1.0),1))$ |
map(drint,TMP1[1]*1.0),FLAG,1))$ |
|
|
|
if(TMP!=[]) |
if(TMP!=[]) |
RET=append(RET,wsort(TMP1[1],Vars, |
RET=append(RET,wsort(TMP1[1],Vars,TMP,2))$ |
TMP,FLAG,2))$ |
} |
|
else if(FLAG==1) |
|
RET=append(RET,[[1,Vars,vtol(TMP1[1])]])$ |
} |
} |
|
|
} |
} |
|
|
return [NormMat0,RET]$ |
return [NormMat0,RET]$ |
Line 690 def weight(PolyList,Vars,FLAG){ |
|
Line 773 def weight(PolyList,Vars,FLAG){ |
|
|
|
RET=append(RET,TMP[1])$ |
RET=append(RET,TMP[1])$ |
|
|
RET=append(RET,leastsq(TMP[0],ExpMat,Vars,FLAG,3))$ |
TMP0=leastsq(TMP[0],ExpMat,Vars,FLAG,3)$ |
|
|
|
RET=append(RET,TMP0)$ |
|
|
ExpMat=qsort(ExpMat,junban)$ |
ExpMat=qsort(ExpMat,junban)$ |
|
|
ExpMat2=[]$ |
ExpMat2=[]$ |
Line 702 def weight(PolyList,Vars,FLAG){ |
|
Line 787 def weight(PolyList,Vars,FLAG){ |
|
if(size(ExpMat)[0]!=length(ExpMat2)){ |
if(size(ExpMat)[0]!=length(ExpMat2)){ |
ExpMat=newvect(length(ExpMat2),ExpMat2)$ |
ExpMat=newvect(length(ExpMat2),ExpMat2)$ |
RET=append(RET,leastsq(0,ExpMat,Vars,FLAG,5))$ |
RET=append(RET,leastsq(0,ExpMat,Vars,FLAG,5))$ |
|
} |
|
else{ |
|
TMP0=map(ltov,TMP0)$ |
|
|
|
for(I=0;I<length(TMP0);I++) |
|
if(TMP0[I][0]==3) |
|
TMP0[I][0]=5$ |
|
else if(TMP0[I][0]==4) |
|
TMP0[I][0]=6$ |
|
|
|
TMP0=map(vtol,TMP0)$ |
|
|
|
RET=append(RET,TMP0)$ |
} |
} |
|
|
return RET$ |
return RET$ |