• DOI:10.1007/s10208-015-9272-x
• Corpus ID: 13521482

Lattice Structures for Attractors II

@article{Kalies2016LatticeSF,
  title={Lattice Structures for Attractors II},
  author={William D. Kalies and Konstantin Mischaikow and Robert C. Vandervorst},
  journal={Foundations of Computational Mathematics},
  year={2016},
  volume={16},
  pages={1151-1191}
}

• W. Kalies, K. Mischaikow, R. Vandervorst
• Published 5 July 2013
• Computer Science
• Foundations of Computational Mathematics

The algebraic structure of the attractors in a dynamical system determines much of its global dynamics. The collection of all attractors has a natural lattice structure, and this structure can be detected through attracting neighborhoods, which can in principle be computed. Indeed, there has been much recent work on developing and implementing general computational algorithms for global dynamics, which are capable of computing attracting neighborhoods efficiently. Here we address the question of whether all of the algebraic structure of attractors can be captured by these methods.