Efficient computation of Lyapunov functions for Morse decompositions
DOI10.3934/DCDSB.2015.20.2419zbMATH Open1366.37031OpenAlexW2525522017MaRDI QIDQ258397FDOQ258397
William D. Kalies, Dinesh Kasti, Arnaud Goullet, K. 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
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
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)
Cites Work
- A note on two problems in connexion with graphs
- Fibonacci heaps and their uses in improved network optimization algorithms
- An algorithmic approach to chain recurrence
- Title not available (Why is that?)
- Title not available (Why is that?)
- Depth-First Search and Linear Graph Algorithms
- I/O- and CPU-optimal recognition of strongly connected components
- The buffer tree: A technique for designing batched external data structures
- 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
- Ultra-succinct representation of ordered trees with applications
- 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
- Title not available (Why is that?)
- A Database Schema for the Analysis of Global Dynamics of Multiparameter Systems
Cited In (12)
- Review on computational methods for Lyapunov functions
- Topological techniques for efficient rigorous computation in dynamics
- Minimization with differential inequality constraints applied to complete Lyapunov functions
- Computing complete Lyapunov functions for discrete-time dynamical systems
- 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
- Computation and Verification of Lyapunov Functions
- An Algorithmic Approach to Lattices and Order in Dynamics
- Lattice structures for attractors. II
Uses Software
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)
