Journal
SIAM JOURNAL ON APPLIED DYNAMICAL SYSTEMS
Volume 17, Issue 2, Pages 1617-1649Publisher
SIAM PUBLICATIONS
DOI: 10.1137/17M1139606
Keywords
attractor; Morse decomposition; index lattice; distributive lattice; order retraction; Birkhoff's representation theorem; binary relation
Categories
Funding
- NSF [NFS-DMS-0914995]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available