Awrejcewicz, J.; Krysko, A.V.; Erofeev, N.P.; Dobriyan, V.; Barulina, M.A.; Krysko, V.A. Quantifying Chaos by Various Computational Methods. Part 1: Simple Systems. Entropy2018, 20, 175.
Awrejcewicz, J.; Krysko, A.V.; Erofeev, N.P.; Dobriyan, V.; Barulina, M.A.; Krysko, V.A. Quantifying Chaos by Various Computational Methods. Part 1: Simple Systems. Entropy 2018, 20, 175.
The first part of the paper was aimed at analyzing the given nonlinear problem by different methods of computation of the Lyapunov exponents (Wolf method , Rosenstein method , Kantz method , method based on the modification of a neural network [4, 5], and the synchronization method [6, 7]) for the classical problems governed by difference and differential equations (Hénon map , hyper-chaotic Hénon map , logistic map , Rössler attractor , Lorenz attractor ) and with the use of both Fourier spectra and Gauss wavelets . It was shown that a modification of the neural network method [4, 5] makes it possible to compute a spectrum of Lyapunov exponents, and then to detect a transition of the system regular dynamics into chaos, hyper-chaos, hyper hyper-chaos and deep chaos [14-16]. Different algorithms for computation of Lyapunov exponents were validated by comparison with the known dynamical systems spectra of the Lyapunov exponents. The carried out analysis helps comparatively estimate the employed methods in order to choose the most suitable/optimal one to study different kinds of dynamical systems and different classes of problems in both this and the next paper parts.
Lyapunov exponents; Wolf method; Rosenstein method, Kantz method; neural network method; method of synchronization; Benettin method; Fourier spectrum; Gauss wavelets.
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.