Efficient computation of Lyapunov functions for Morse decompositions

DOI10.3934/DCDSB.2015.20.2419MaRDI QIDQ258397zbMATH OpenOpenAlexFDO

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

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

Recommendations

• On the construction of Lyapunov functions with computer assistance
• Computation of Lyapunov functions for nonautonomous systems on finite time-intervals by linear programming
• Construction of Lyapunov functions for nonlinear planar systems by linear programming
• Computing continuous and piecewise affine Lyapunov functions for nonlinear systems
• Computing complete Lyapunov functions for discrete-time dynamical systems

Cites work

• scientific article; zbMATH DE number 3616736 (Why is no real title available?)
• scientific article; zbMATH DE number 203584 (Why is no real title available?)
• A Database Schema for the Analysis of Global Dynamics of Multiparameter Systems
• A combinatorial procedure for finding isolating neighbourhoods and index pairs
• A note on two problems in connexion with graphs
• Algorithms and data structures for external memory
• An algorithmic approach to chain recurrence
• An introduction to dynamical systems. Continuous and discrete
• Chaotic dynamics of a nonlinear density dependent population model
• Combinatorial-topological framework for the analysis of global dynamics
• Conley decomposition for closed relations
• Depth-First Search and Linear Graph Algorithms
• Fibonacci heaps and their uses in improved network optimization algorithms
• I/O- and CPU-optimal recognition of strongly connected components
• Lattice structures for attractors. I
• Liapunov functions for closed relations
• Some Discrete Competition Models and the Competitive Exclusion Principle^†
• Succinct representation of balanced parentheses and static trees
• The buffer tree: A technique for designing batched external data structures
• Ultra-succinct representation of ordered trees with applications

Cited in

(14)

• Review on computational methods for Lyapunov functions
• Topological techniques for efficient rigorous computation in dynamics
• Parallel computation of nearly recurrent components of piecewise constant vector fields
• Computation and verification of Lyapunov functions
• A database schema for the analysis of global dynamics
• Computing complete Lyapunov functions for discrete-time dynamical systems
• Minimization with differential inequality constraints applied to complete Lyapunov functions
• An algorithmic approach to lattices and order in dynamics
• Persistence of Morse decompositions over grid resolution for maps and time series
• Computing Optimal Discrete Morse Functions
• Minimization with differential inequality and equality constraints applied to complete Lyapunov functions
• Lattice structures for attractors. III
• Continuation sheaves in dynamics: sheaf cohomology and bifurcation
• Lattice structures for attractors. II

Describes a project that uses

Uses Software

• Conley-Morse-Database

This page was built for publication: Efficient computation of Lyapunov functions for Morse decompositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q258397)