lyapunov_rosenstein_m.m

来自「lyapunov_rosenstein_m.rar是rosenstein算法的实」· M 代码 · 共 36 行

function [lyapunov_curve] = lyapunov_rosenstein_m(xn,tau,m,evolvement_length,mean_period,fs)
data = PhaSpaRecon(xn,tau,m);   
[row,column]=size(data);

disp('count all couples of the min distance dots,please wait.....')
for i=1:column
    for j=1:column
        if ((abs(i-j)>mean_period)&(abs(i-j)<10*mean_period))
            distance_vector=data(:,i)-data(:,j);
            data_distance(j)=norm(distance_vector,2);
        else
            data_distance(j)=1000;
        end
    end
    [reference_dot_distance(i),reference_dot_position(i)]=min(data_distance);
    max_evolvement_length=column-max(i,reference_dot_position(i));
    fact_evolvement_length(i)=min(max_evolvement_length,evolvement_length);
    the_number_now_is_counting=i
end

for i=1:evolvement_length
    sum_evolvement_dot_num=1;
    sum_distance_i_step=0;
    disp('begin to count the evolvement distance')     
    the_number_now_is_evolving=i
    for j=1:column
        if i<=fact_evolvement_length(j)
            evolvement_distance_vector=data(:,j+i)-data(:,reference_dot_position(j)+i);
            evolvement_dot_distance(j)=norm(evolvement_distance_vector,2);
            sum_distance_i_step=sum_distance_i_step+log(evolvement_dot_distance(j))-log(reference_dot_distance(j));
            sum_evolvement_dot_num=sum_evolvement_dot_num+1; 
        end
    end
    lyapunov_curve(i)=sum_distance_i_step/sum_evolvement_dot_num*fs;
end