Dynamical Systems, Graphs, and Algorithms
β Scribed by Prof. George Osipenko (auth.)
- Book ID
- 127428990
- Publisher
- Springer
- Year
- 2007
- Tongue
- English
- Weight
- 3 MB
- Edition
- 1
- Category
- Library
- City
- Berlin ; New York
- ISBN
- 1280700300
- ISSN
- 0075-8434
No coin nor oath required. For personal study only.
β¦ Synopsis
From the reviews:
"This book provides a taster for using symbolic analysis, graph theory, and set-oriented methods in a quest to understand the global structure of the dynamics in a continuous- or discrete-time system. In many ways, the techniques discussed here are complementary to more traditional ways of analysing a dynamical system and as such, this book can be viewed as a valuable entry into the theory and computational methods. β¦ The book is intended for postgraduate researchers β¦ ." (Hinke M. Osinga, Mathematical Reviews, Issue 2008 i)
"This monograph contains a summary of the authorβs work on constructive methods for the study of discrete dynamical systems. β¦ The structure of the book is very clear with 14 chapters devoted to different dynamical objects such as chain recurrent sets, structural stability or invariant manifolds, followed by two examples: the Ikeda mapping and a discrete food-chain model. β¦ is certainly a valuable and very readable reference, in particular for the study of low-dimensional concrete systems with complicated dynamics." (JΓΆrg HΓ€rterich, Zentralblatt MATH, Vol. 1130 (8), 2008)
β¦ Subjects
Ordinary Differential Equations
π SIMILAR VOLUMES
In many applications of graph algorithms, including communication networks, graphics, assembly planning, and VLSI design, graphs are subject to discrete changes, such as additions or deletions of edges or vertices. In the last decade there has been a growing interest in such dynamically changing gra