Computing complete Lyapunov functions for discrete-time dynamical systems
From MaRDI portal
Publication:2026611
DOI10.3934/dcdsb.2020331zbMath1467.93274OpenAlexW3097660423MaRDI QIDQ2026611
Peter Giesl, Zachary Langhorne, Carlos Argáez, Sigurður Freyr Hafstein
Publication date: 20 May 2021
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.2020331
Numerical optimization and variational techniques (65K10) Quadratic programming (90C20) Lyapunov and storage functions (93D30) Discrete-time control/observation systems (93C55) Numerical radial basis function approximation (65D12)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computation of Lyapunov functions for systems with multiple local attractors
- Efficient computation of Lyapunov functions for Morse decompositions
- Functional analysis, Sobolev spaces and partial differential equations
- Generalizations of the Poincaré-Birkhoff theorem
- Error estimates for interpolation by compactly supported radial basis functions of minimal degree
- Lyapounov functions of closed cone fields: from Conley theory to time functions
- Chain recurrence, semiflows, and gradients
- An algorithmic approach to chain recurrence
- Existence of complete Lyapunov functions for semiflows on separable metric spaces
- Computational Approach for Complete Lyapunov Functions
- Meshless Collocation: Error Estimates with Application to Dynamical Systems
- Chain recurrence and attraction in non-compact spaces
- Noncompact Chain Recurrence and Attraction
- Lyapunov functions and attractors in arbitrary metric spaces
- Smoothing Lyapunov functions
- The Mathematical Theory of Finite Element Methods
- THREE-DIMENSIONAL HÉNON-LIKE MAPS AND WILD LORENZ-LIKE ATTRACTORS
- Theory of Reproducing Kernels
- Construction of a Complete Lyapunov Function using Quadratic Programming
