Cycles in continuous and discrete dynamical systems : computations, computer-assisted proofs, and computer experiments
The present work is devoted to calculation of periodic solutions and bifurcation research in quadratic systems, Lienard system, and non-unimodal one-dimensional discrete maps using modern computational capabilities and symbolic computing packages.In the first chapter the problem of Academician A.N. Kolmogorov on localization and modeling of cycles of quadratic systems is considered. For the investigation of small limit cycles (so-called local 16th Hilbert’s problem) the method of calculation of Lyapunov quantities (or Poincaré-Lyapunov constants) is used. To calculate symbolic expressions for the Lyapunov quantities the Lyapunov method to the case of non-analytical systems was generalized. Following the works of L.A. Cherkas and G.A. Leonov, the symbolic algorithms for transformation of quadratic systems to special Lienard systems were developed. For the first time general symbolic expressions of first four Lyapunov quantities for Lienard systems are obtained. The large limit cycles (or "normal" limit cycles) for quadratic and Lienard systems with parameters corresponding to the domain of existence of a large cycle, obtained by G.A. Leonov, are presented. Visualization on the plane of parameters of a Lienard system of the domain of parameters of quadratic systems with four limit cycles, obtained by S.L. Shi, is realized.The second chapter of the thesis is devoted to non-unimodal one-dimensional discrete maps describing operation of digital phase locked loop (PLL). Qualitative analysis of PLL equations helps one to determine necessary system operating conditions (which, for example, include phase synchronization and clock-skew elimination). In this work, application of the qualitative theory of dynamical systems, special analytical methods, and modern mathematical packages has helped us to advance considerably in calculation of bifurcation values and to define numerically fourteen bifurcation values of the DPLL’s parameter. It is shown that for the obtained bifurcation values of a non-unimodal map, the effect of convergence similar to Feigenbaum’s effect is observed
...
Elena Kudryashovan väitöstutkimuksessa selvitettiin matemaattisten mallien ratkeavuutta käyttäen nykyaikaisia laskentamahdollisuuksia ja symbolisen laskennan ohjelmistoja. Tutkimuksen käytännön sovellutukset liittyvät tietokoneiden toiminnan tehostamiseen.
Julkaisija
University of JyväskyläISBN
978-951-39-3666-2ISSN Hae Julkaisufoorumista
1456-5390Asiasanat
Metadata
Näytä kaikki kuvailutiedotKokoelmat
- Väitöskirjat [3599]
Lisenssi
Samankaltainen aineisto
Näytetään aineistoja, joilla on samankaltainen nimeke tai asiasanat.
-
Lyapunov quantities and limit cycles in two-dimensional dynamical systems : analytical methods, symbolic computation and visualization
Kuznetsova, Olga (University of Jyväskylä, 2011) -
Localization and dimension estimation of attractors in the Glukhovsky-Dolzhansky system
Mokaev, Timur (University of Jyväskylä, 2016) -
Implementation techniques for the lattice Boltzmann method
Mattila, Keijo (University of Jyväskylä, 2010) -
Response to computer-assisted intervention in children most at risk for mathematics difficulties
Salminen, Jonna (University of Jyväskylä, 2015)Evidence of an association between poor early number skills and a high risk for later difficulties in mathematics manifests a need for both early identification of risk and effective prevention of difficulties. However, ... -
Hidden attractors in Chua circuit : mathematical theory meets physical experiments
Kuznetsov, Nikolay; Mokaev, Timur; Ponomarenko, Vladimir; Seleznev, Evgeniy; Stankevich, Nataliya; Chua, Leon (Springer Science and Business Media LLC, 2023)After the discovery in early 1960s by E. Lorenz and Y. Ueda of the first example of a chaotic attractor in numerical simulation of a real physical process, a new scientific direction of analysis of chaotic behavior in ...
Ellei toisin mainittu, julkisesti saatavilla olevia JYX-metatietoja (poislukien tiivistelmät) saa vapaasti uudelleenkäyttää CC0-lisenssillä.