Dynamical Systems, Graphs, and Algorithms

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.

Publication Year: 2007
Imprint: Springer Berlin Heidelberg
Format: P
Weight (Gram): 468