Dynamical Systems, Graphs, and Algorithms

Front Cover
Springer, Oct 28, 2006 - Mathematics - 288 pages
0 Reviews
Reviews aren't verified, but Google checks for and removes fake content when it's identified

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.

 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Introduction
1
Symbolic Image
15
Periodic Trajectories
27
Newtons Method 35
34
Invariant Sets
43
Chain Recurrent Set
55
Attractors 65
64
Filtration
85
Structural Graph 97
96
References
233
A Double Logistic Map
241
B Implementation of the Symbolic Image
253
Index 281
280
Copyright

Other editions - View all

Common terms and phrases

Bibliographic information