Dynamical Systems, Graphs, and Algorithms - George Osipenko
-25% koodilla BOOKS
Toimitus 12-18 arkipäivässä
30 päivän palautusoikeus
This book describes a family of algorithms for studying the global structure of systems. By a finite covering of the phase space we construct a directed graph with vertices corresponding to cells of the covering and edges corresponding to admissible transitions. The method is used, among other things, to locate the periodic orbits and the chain recurrent set, to construct the attractors and their basins, to ... Täydellinen kuvaus
Saatat myös pitää
Kuvaus
This book describes a family of algorithms for studying the global structure of systems. By a finite covering of the phase space we construct a directed graph with vertices corresponding to cells of the covering and edges corresponding to admissible transitions. The method is used, among other things, to locate the periodic orbits and the chain recurrent set, to construct the attractors and their basins, to estimate the entropy, and more.
Lisätietoja
| Kirjoittaja | George Osipenko |
|---|---|
| Julkaisija | Springer Berlin Heidelberg |
| Series | Lecture Notes in Mathematics |
| Julkaisuvuosi | 2006 |
| Kannen tyyppi | Pehmeäkantinen |
| EAN | 9783540355939 |