📄 findbeststep.m
字号:
function [step,cs] = findbeststep(D,lags);% findbeststep - calculate best step in delaying%% [step,cs] = findbeststep(D)%% 1.6.05% Peter Grubererror(nargchk(1,2,nargin)) % check no. of input argsif (nargin<2) lags=0; endcs=[];step = 1;old = cov(fortrandlay(D,1,step)');old = norm(old(1,:));d = cov(fortrandlay(D,1,step+1)');d = norm(d(1,:));while ((d<old) || (step<lags)) cs(step)=old; step = step + 1; old = d; d = cov(fortrandlay(D,1,step+1)'); d = norm(d(1,:));endcs(step)=old;return
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -