Efficient computation of Lyapunov functions for Morse decompositions

DOI10.3934/dcdsb.2015.20.2419zbMath1366.37031OpenAlexW2525522017MaRDI QIDQ258397

William D. Kalies, Dinesh Kasti, Arnaud Goullet, Konstantin Mischaikow, Shaun Harker

Publication date: 10 March 2016

Published in: Discrete and Continuous Dynamical Systems. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/dcdsb.2015.20.2419

zbMATH Keywords

Lyapunov functionMorse decompositioncombinatorial dynamicsConley's decomposition theorem

Mathematics Subject Classification ID

Stability of topological dynamical systems (37B25) Gradient-like behavior; isolated (locally maximal) invariant sets; attractors, repellers for topological dynamical systems (37B35) Index theory for dynamical systems, Morse-Conley indices (37B30) Computational methods for ergodic theory (approximation of invariant measures, computation of Lyapunov exponents, entropy, etc.) (37M25)

Related Items

Computation and Verification of Lyapunov Functions, An Algorithmic Approach to Lattices and Order in Dynamics, Persistence of Morse decompositions over grid resolution for maps and time series, Lattice structures for attractors. III, Continuation sheaves in dynamics: sheaf cohomology and bifurcation, Lattice structures for attractors. II, Computing complete Lyapunov functions for discrete-time dynamical systems, Minimization with differential inequality constraints applied to complete Lyapunov functions, Review on computational methods for Lyapunov functions

Uses Software

• Conley-Morse-Database

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Ultra-succinct representation of ordered trees with applications
• I/O- and CPU-optimal recognition of strongly connected components
• The buffer tree: A technique for designing batched external data structures
• An algorithmic approach to chain recurrence
• Lattice structures for attractors. I
• Succinct Representation of Balanced Parentheses and Static Trees
• Algorithms and Data Structures for External Memory
• Combinatorial-topological framework for the analysis of global dynamics
• Conley decomposition for closed relations
• Liapunov functions for closed relations
• A combinatorial procedure for finding isolating neighbourhoods and index pairs
• Some Discrete Competition Models and the Competitive Exclusion Principle^†
• Chaotic dynamics of a nonlinear density dependent population model
• A Database Schema for the Analysis of Global Dynamics of Multiparameter Systems
• Fibonacci heaps and their uses in improved network optimization algorithms
• Depth-First Search and Linear Graph Algorithms