Combinatorial-topological framework for the analysis of global dynamics
- 1 December 2012
- journal article
- research article
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 22 (4) , 047508
Abstract
We discuss an algorithmic framework based on efficient graph algorithms and algebraic-topological computational tools. The framework is aimed at automatic computation of a database of global dynamics of a given m-parameter semidynamical system with discrete time on a bounded subset of the n-dimensional phase space. We introduce the mathematical background, which is based upon Conley's topological approach to dynamics, describe the algorithms for the analysis of the dynamics using rectangular grids both in phase space and parameter space, and show two sample applications.Keywords
This publication has 23 references indexed in Scilit:
- Verification methods: Rigorous results using floating-point arithmeticActa Numerica, 2010
- Graph Approach to the Computation of the Homology of Continuous MapsFoundations of Computational Mathematics, 2005
- Chaotic dynamics of a nonlinear density dependent population modelNonlinearity, 2004
- Construction of Symbolic Dynamics from Experimental Time SeriesPhysical Review Letters, 1999
- Chaos in the Lorenz equations: a computer-assisted proofBulletin of the American Mathematical Society, 1995
- Permanence and the dynamics of biological systemsMathematical Biosciences, 1992
- Leray functor and cohomological Conley index for discrete dynamical systemsTransactions of the American Mathematical Society, 1990
- Clustering, coding, switching, hierarchical ordering, and control in a network of chaotic elementsPhysica D: Nonlinear Phenomena, 1990
- Dynamical systems, shape theory and the Conley indexErgodic Theory and Dynamical Systems, 1988
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984