schur2.m

该代码实现了am

n=1
ACF=[0.95013	0.23114	0.60684	0.48598	0.8913	0.7621	0.45647	0.018504	0.82141]
if ACF(1,n)==0
    for i=1:9
        r(1,i)=0
    end
elseif  ACF(1,n)~=0
        for i=1:7
            K(1,9-i)=ACF(1,i)
        end
        for j=1:9
            P(1,j)=ACF(1,j)
        end
if P(1,1)/abs(P(1,2))<1
for i=n:9
        r(1,i)=0
end
elseif P(1,1)/abs(P(1,2))>=1
    r(1,n)=abs(P(1,2))/P(1,1)
if P(1,1)>0
    r(1,n)=-r(1,n)
elseif n/8==1
    for k=n:1:8
        LAR(1,k)=r(1,k)
        P(1,1)=P(1,1)+P(1,2)*r(1,n)
for m=1
    P(1,m)=P(1,1+m)+r(1,m)*K(1,9-m)
    K(1,9-m)=K(9-m)+r(1,n)*P(1,1+m)
    if m==8-n
        n=n+1
    end
    m=m+1
    return
end
end
end
end
end