1 / 22

Modeling chaos 1

Modeling chaos 1. Books: H. G. Schuster, Deterministic chaos , an introduction, VCH, 1995 H-O Peitgen, H. Jurgens, D. Saupe, Chaos and fractals Springer, 1992 H-O Peitgen, H. Jurgens, D. Saupe, Fractals for the Classroom , Part 1 and 2, Springer 1992. Journals :

kura
Télécharger la présentation

Modeling chaos 1

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Modeling chaos 1

  2. Books: H. G. Schuster, Deterministic chaos, an introduction, VCH, 1995 H-O Peitgen, H. Jurgens, D. Saupe, Chaos and fractals Springer, 1992 H-O Peitgen, H. Jurgens, D. Saupe, Fractals for the Classroom, Part 1 and 2, Springer 1992. Journals: Chaos: AnInterdisciplinaryJournalofNonlinearScience, Published by American Institute of Physics IEEE Transactions on Circuits and Systems, Published by IEEE Institute

  3. One-dimensional discrete systems • Logistic equation • Mechanism of doubling the period • Bifurcation diagram • Doubling – period tree, Feigenbaum constants • Lyapunov exponents – chaotic solutions

  4. Continuous-time systems • Rossler differential equation • Lorenz differential equation

  5. One – dimensional discrete systems

  6. Bernouli function

  7. Triangular function

  8. Logistic function

  9. Sinusoidal map

  10. Iterating logistic map

  11. r=2.6 x0=0.25

  12. r=3.2, x0=0.25

  13. x0=0.25, r=3.48

  14. x0=0.2, r=4

  15. Stability of equilibrium point:

  16. Plot of the function: f(x)

  17. f(2)( x ) = f ( f (x) )

  18. f(4)( x ) = f ( f ( f ( f (x) ) ) )

  19. Bifurcation diagram

  20. Period doubling tree x r r

  21. Why the discrete time logistic equation is so complicated compared to the continuous time one ?

More Related