Abstract

A new algorithm is proposed for computing the embedding dimension and delay time in phase space reconstruction. It makes use of the zero of the nonbias multiple autocorrelation function of the chaotic time series to determine the time delay, which efficiently depresses the computing error caused by tracing arbitrarily the slop variation of average displacement (AD) in AD algorithm. Thereafter, by means of the iterative algorithm of multiple autocorrelation and Γ test, the near-optimum parameters of embedding dimension and delay time are estimated. This algorithm is provided with a sound theoretic basis, and its computing complexity is relatively lower and not strongly dependent on the data length. The simulated experimental results indicate that the relative error of the correlation dimension of standard chaotic time series is decreased from 4.4% when using conventional algorithm to 1.06% when using this algorithm. The accuracy of invariants in phase space reconstruction is greatly improved.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call