An algorithmic approach to chain recurrence

Foundations of Computational Mathematics

Volumn 5, Issue 4, 2005, Pages 409-449

  Kalies, W D ^a   Mischaikow, K ^b   VanderVorst, R C A M ^c  

^a FLORIDA ATLANTIC UNIVERSITY   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Algorithms; Chain recurrence; Combinatorial dynamics; Computation; Conley's decomposition theorem; Lyapunov function

Indexed keywords

ALGORITHMIC CONSTRUCTION; CHAIN RECURRENCE; COMPUTATIONAL TECHNIQUE; COMPUTER-ASSISTED PROOFS; DECOMPOSITION THEOREMS; DISCRETE APPROXIMATION; QUALITATIVE DYNAMICS; SPATIAL DISCRETIZATIONS;

CALCULATIONS; CHAINS; COMPUTER AIDED ANALYSIS; DOMAIN DECOMPOSITION METHODS; LYAPUNOV FUNCTIONS;

ALGORITHMS;

EID: 31944446545     PISSN: 16153375     EISSN: 16153383     Source Type: Journal    
DOI: 10.1007/s10208-004-0163-9     Document Type: Conference Paper

References (16)

1. E. Boczko, W. Kalies, and K. Mischaikow, Polygonal approximation of flows, Preprint, 2004.
2. C. Conley, Isolated Invariant Sets and the Morse Index, CBMS Regional Conference Series in Mathematics, Vol. 38, American Mathematical Society, Providence, RI, 1978.
3. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, The MIT Electrical Engineering and Computer Science Series, MIT Press, Cambridge, MA, 1990.
4. S. Day, A Rigorous Numerical Method in Infinite Dimensions, PhD dissertation, 2003.
5. S. Day, O. Junge, and K. Mischaikow, A rigorous numerical method for the global analysis of infinite-dimensional discrete dynamical systems, SIAM J. Appl. Dyn. Syst. 3(2) (2004), 117-160 (electronic).
6. M. Dellnitz and O. Junge, GAIO, http://www-math.uni-paderborn.de/ ~agdellnitz/gaio, 1998.
7. M. Dellnitz, G. Froyland, and O. Junge, The algorithms behind GAIO-set oriented numerical methods for dynamical systems, in Ergodic Theory, Analysis, and Efficient Simulation of Dynamical Systems, pp. 145-174, 805-807, Springer-Verlag, Berlin, 2001.
8. R. W. Easton, Isolating blocks and symbolic dynamics, J. Differential Equations, 17 (1975), 96-118.
9. M. Eidenschink, Exploring Global Dynamics: A Numerical Algorithm Based on Conley Index Theory, PhD dissertation, 1995.
10. J. Franks and M. Misiurewicz, Topological methods in dynamics, in Handbook of Dynamical Systems, Vol. 1A, pp. 547-598, North-Holland, Amsterdam, 2002.
11. F. Y. Hunt, Finite precision representation of the Conley decomposition, J. Dynam. Differential Equations, 13(1) (2001), 87-105.
12. K. Mischaikow, Topological techniques for efficient rigorous computation in dynamics, Acta Numer., 11 (2002), 435-477.
13. M. Mrozek, An algorithm approach to the Conley index theory, J. Dynam. Differential Equations, 11(4) (1999), 711-734.
14. G. Osipenko and S. Campbell, Applied symbolic dynamics: Attractors and filtrations, Discrete Contin. Dynam. Systems, 5(1) (1999), 43-60.
15. C. Robinson, Dynamical Systems, Studies in Advanced Mathematics, CRC Press, Boca Raton, FL, Stability, Symbolic Dynamics, and Chaos, 2nd ed., 1999.
16. A. Szymczak, A combinatorial procedure for finding isolating neighbourhoods and index pairs, Proc. Roy. Soc. Edinburgh Sect. A 127(5) (1997), 1075-1088.