A parallel algorithm is presented for computing the Correlation Dimension (h 2 ) from a time series generated by a dynamical system, using the method of correlation integrals. Three versions are discussed: the ยฎrst computes all distances between points in the phase space, whereas the second and thir
Efficient computation of the correlation dimension from a time series on a LIW computer
โ Scribed by A. Corana; A. Casaleggio; C. Rolando; S. Ridella
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 586 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We present a parallel algorithm for computing the correlation dimension (D2) from a time series generated by a dynamic system, using the method of correlation integrals, which essentially requires the computation of distances among a set of points in the state space. The parallelization is suitable
The program presented computes all the Lyapunov exponents of an unknown dynamical system from a time series. The method used is based on a fitting of the time series with an analytical function through a least square minimizatior, after which the Lyapunov exponents are determined from the stability