Abstract
Recurrent versus gradient-like behavior in global dynamics can be characterized via a surjective lattice homomorphism between certain bounded, distributive lattices, that is, between attracting blocks (or neighborhoods) and attractors. Using this characterization, we build finite, combinatorial models in terms of surjective lattice homomorphisms, which lay a foundation for a computational theory for dynamical systems that focuses on Morse decompositions and index lattices. In particular we present an algorithm that builds a combinatorial model that represents a Morse decomposition for the underlying dynamics. We give computational examples that illustrate the theory for both maps and flows.
Original language | English |
---|---|
Pages (from-to) | 1617-1649 |
Number of pages | 33 |
Journal | SIAM Journal on Applied Dynamical Systems |
Volume | 17 |
Issue number | 2 |
Early online date | 5 Jun 2018 |
DOIs | |
Publication status | Published - 2018 |