Approximating hidden chaotic attractors via parameter switching
Danca, Marius-F., Kuznetsov, N., & Chen, G. (2018). Approximating hidden chaotic attractors via parameter switching. Chaos, 28(1), Article 013127. https://doi.org/10.1063/1.5007925
Julkaistu sarjassa
ChaosPäivämäärä
2018Tekijänoikeudet
© American Institute of Physics, 2018. Published in this repository with the kind permission of the publisher.
In this paper, the problem of approximating hidden chaotic attractors of a general class of nonlinear systems is investigated. The parameter switching (PS) algorithm is utilized, which switches the control parameter within a given set of values with the initial value problem numerically solved. The PS-generated attractor approximates the attractor obtained by averaging the control parameter with the switched values, which represents the hidden chaotic attractor. The hidden chaotic attractors of a generalized Lorenz system and the Rabinovich-Fabrikant system are simulated for illustration.
In Refs. 1–3, it is proved that the attractors of a chaotic system, considered as the unique numerical approximations of the underlying ω-limit sets (see, e.g., Ref. 31) after neglecting sufficiently long transients, can be numerically approximated by switching the control parameter in some deterministic or random manner, while the underlying initial value problem (IVP) is numerically integrated with the parameter switching (PS) algorithm. The attractors, whose basins of attractions are not connected with equilibria, are called hidden attractors, while the attractors for which the trajectories starting from a point in a neighborhood of an unstable equilibrium are attracted by some attractor are called self-excited attractors.4–6 In this paper, we prove analytically and verified numerically that the PS algorithm can be used to approximate any desired hidden attractors of a class of general systems, which model systems such as Lorenz, Chen, and Rössler.
...
![showless](/themes/JYX2//images/showless.png)
![showmore](/themes/JYX2//images/showmore.png)
Julkaisija
American Institute of PhysicsISSN Hae Julkaisufoorumista
1054-1500Asiasanat
Julkaisu tutkimustietojärjestelmässä
https://converis.jyu.fi/converis/portal/detail/Publication/27875302
Metadata
Näytä kaikki kuvailutiedotKokoelmat
Samankaltainen aineisto
Näytetään aineistoja, joilla on samankaltainen nimeke tai asiasanat.
-
Numerical analysis of dynamical systems : unstable periodic orbits, hidden transient chaotic sets, hidden attractors, and finite-time Lyapunov dimension
Kuznetsov, Nikolay; Mokaev, Timur (IOP Publishing, 2019)In this article, on the example of the known low-order dynamical models, namely Lorenz, Rössler and Vallis systems, the difficulties of reliable numerical analysis of chaotic dynamical systems are discussed. For the Lorenz ... -
Complex dynamics, hidden attractors and continuous approximation of a fractional-order hyperchaotic PWC system
Danca, Marius-F.; Fečkan, Michal; Kuznetsov, Nikolay; Chen, Guanrong (Springer, 2018) -
The Lorenz system : hidden boundary of practical stability and the Lyapunov dimension
Kuznetsov, N. V.; Mokaev, T. N.; Kuznetsova, O. A.; Kudryashova, E. V. (Springer, 2020)On the example of the famous Lorenz system, the difficulties and opportunities of reliable numerical analysis of chaotic dynamical systems are discussed in this article. For the Lorenz system, the boundaries of global ... -
Localization and dimension estimation of attractors in the Glukhovsky-Dolzhansky system
Mokaev, Timur (University of Jyväskylä, 2016) -
Graphical Structure of Attraction Basins of Hidden Chaotic Attractors : The Rabinovich-Fabrikant System
Danca, Marius-F.; Bourke, Paul; Kuznetsov, Nikolay (World Scientific Publishing Co. Pte. Ltd., 2019)The attraction basin of hidden attractors does not intersect with small neighborhoods of any equilibrium point. To the best of our knowledge this property has not been explored using realtime interactive three-dimensions ...
Ellei toisin mainittu, julkisesti saatavilla olevia JYX-metatietoja (poislukien tiivistelmät) saa vapaasti uudelleenkäyttää CC0-lisenssillä.