A practical method for calculating largest Lyapunov exponents from small data sets
Citations
2,344 citations
Cites methods from "A practical method for calculating ..."
...Several methods have been proposed: Lyapunov exponents [105], 1/f slope [64], approximate entropy (ApEn) [93] and detrended fluctuation analysis (DFA) [91]....
[...]
1,381 citations
1,356 citations
Cites background from "A practical method for calculating ..."
...A reliable characterization requires that the independence of embedding parameters and the exponential law for the growth of distances are checked [69,70] explicitly....
[...]
...[70] where only the closest neighbor is followed for each reference point....
[...]
1,226 citations
Cites methods from "A practical method for calculating ..."
...Later simpler and faster algorithms to compute the largest Lyapunov exponent were introduced by Kantz and by Rosenstein et al. (Kantz, 1994; Rosenstein et al., 1993)....
[...]
1,018 citations
Cites background or methods from "A practical method for calculating ..."
...In order to avoid these shortcomings, a combination of improved algorithms can be used (Rosenstein et al., 1993; Kantz, 1994b) according to which the Lmax can be estimated from djðiÞ Cje,...
[...]
...Moreover, it strongly depends on parameters used for the state space reconstruction and is computationally highly expensive (Rosenstein et al., 1993)....
[...]
References
16,554 citations
Additional excerpts
...21 [24] E....
[...]
...Lorenz [24] ẋ = σ(y − x) σ = 16....
[...]
8,128 citations
4,619 citations
4,323 citations
"A practical method for calculating ..." refers background or methods in this paper
...In particular, methods exist for calculating correlation dimension ( D2) [20], Kolmogorov entropy [21], and Lyapunov characteristic exponents [15, 17, 32, 39]....
[...]
...The Grassberger-Procaccia algorithm [20] estimates dimension by examining the scaling properties of the correlation sum, Cm (r) ....
[...]
...Hence, the practical significance of the GPA is questionable, and the Lyapunov exponents may provide a more useful characterization of chaotic systems....
[...]
...However, the GPA is sensitive to variations in its parameters, e.g., number of data points [28], embedding dimension [28], reconstruction delay [3], and it is usually unreliable except for long, noise-free time series....
[...]
...The Grassberger-Procaccia algorithm (GPA) [20] appears to be the most popular method used to quantify chaos....
[...]