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}
}
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… 
View on Springer
arxiv.org
25 Citations
Background Citations
11
Methods Citations
7

25 Citations

Lattice structures for attractors I
We describe the basic lattice structures of attractors and repellers in dynamical systems. The structure of distributive lattices allows for an algebraic treatment of gradient-like dynamics in…
Lattice Structures for Attractors III
The theory of bounded, distributive lattices provides the appropriate language for describing directionality and asymptotics in dynamical systems. For bounded, distributive lattices the general…
Continuation Sheaves in Dynamics: Sheaf Cohomology and Bifurcation
Continuation of algebraic structures in families of dynamical systems is described using category theory, sheaves, and lattice algebras. Well-known concepts in dynamics, such as attractors or…
Computational Conley theory
tion — gradient-like dynamics, cf. Figure 1. In the absence of friction the system returns to its initial state, and its motion is periodic. In this case the system is said to exhibit recurrence.…
Efficient computation of Lyapunov functions for Morse decompositions
TLDR
It is proved that if the diameters of the grid elements go to zero, then the sequence of piecewise constant Lyapunov functions generated by the algorithm converge to a continuous LyAPunov function for the dynamics generated the nonlinear map.
Global Dynamics for Steep Nonlinearities in Two Dimensions.
Global Dynamics for Steep Sigmoidal Nonlinearities in Two Dimensions
TLDR
It is proved that for 2-dimensional systems, the Morse graph defines a Morse decomposition for the dynamics of any smooth differential equation that is sufficiently close to the original piecewise affine ordinary differential equation.
The Morse Equation in the Conley Index Theory for Discrete Multivalued Dynamical Systems
  • B. Batko
  • Mathematics
    Journal of Dynamics and Differential Equations
  • 2022
A recent generalization of the Conley index to discrete multivalued dynamical systems without a continuous selector is motivated by applications to data–drive dynamics. In the present paper we…
Kleene Algebra to Compute Invariant Sets of Dynamical Systems
In this paper, we show that a basic fixed point method used to enclose the greatest fixed point in a Kleene algebra will allow us to compute inner and outer approximations of invariant-based sets for…
A computational framework for connection matrix theory
TLDR
This paper casts the connection matrix theory into appropriate categorical, homotopy-theoretic language and identifies objects of the appropriate categories which correspond to connection matrices and may be computed within the computational Conley theory paradigm by using the technique of reductions.
...
...

References

SHOWING 1-10 OF 57 REFERENCES
Lattice structures for attractors I
We describe the basic lattice structures of attractors and repellers in dynamical systems. The structure of distributive lattices allows for an algebraic treatment of gradient-like dynamics in…
Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems
TLDR
A review of a few recent results which look at nonlinear dynamical systems from a computational perspective, especially information concerning their long-term evolution.
The general topology of dynamical systems
Topology, the foundation of modern analysis, arose historically as a way to organize ideas like compactness and connectedness which had emerged from analysis. Similarly, recent work in dynamical…
A Rigorous Numerical Method for the Global Analysis of Infinite-Dimensional Discrete Dynamical Systems
TLDR
A numerical method is presented to prove certain statements about the global dynamics of infinite-dimensional maps and the existence of period points, connecting orbits, and chaotic dynamics in the Kot--Schaffer growth-dispersal model for plants.
Lyapunov maps, simplicial complexes and the Stone functor
Abstract Let be an attractor network for a dynamical system ft: M → M, indexed by the lower sets of a partially ordered set P. Our main theorem asserts the existence of a Lyapunov map ψ:M → K(P)…
Combinatorial-topological framework for the analysis of global dynamics.
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…
A computational approach to conley's decomposition theorem
Background. The discrete dynamics generated by a continuous map can be represented combinatorially by an appropriate multivalued map on a discretization of the phase space such as a cubical grid or…
Construction of symbolic dynamics from experimental time series
TLDR
Using data obtained from a magnetoelastic ribbon experiment, it is shown how a topological approach that allows for experimental error and bounded noise can be used to obtain a description of the dynamics in terms of subshift dynamics on a finite set of symbols.
Dynamical Systems: Stability, Symbolic Dynamics, and Chaos
A complete study of dynamical systems theory which focuses on the dynamics of both iteration of functions and solutions of ordinary differential equations. Symbolic dynamics, structural dynamics and…
Efficient computation of Lyapunov functions for Morse decompositions
TLDR
It is proved that if the diameters of the grid elements go to zero, then the sequence of piecewise constant Lyapunov functions generated by the algorithm converge to a continuous LyAPunov function for the dynamics generated the nonlinear map.
...
...