Minimization with differential inequality constraints applied to complete Lyapunov functions
DOI10.1090/mcom/3629zbMath1505.93221OpenAlexW3119084961MaRDI QIDQ4999471
Peter Giesl, Carlos Argáez, Sigurður Freyr Hafstein, Holger Wendland
Publication date: 7 July 2021
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: http://sro.sussex.ac.uk/id/eprint/96374/1/Peter%20Giesl%207-Accepted-23.12.20.pdf
convergencequadratic programmingdifferential inequalitymeshless collocationcomplete Lyapunov function
Quadratic programming (90C20) Stability of topological dynamical systems (37B25) Lyapunov and storage functions (93D30) Stability of solutions to ordinary differential equations (34D20) Numerical investigation of stability of solutions to ordinary differential equations (65L07) Computational methods for attractors of dynamical systems (37M22)
Related Items
Uses Software
Cites Work
- Computation of Lyapunov functions for systems with multiple local attractors
- Efficient computation of Lyapunov functions for Morse decompositions
- Construction of global Lyapunov functions using radial basis functions
- 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
- Numerical approximation of the data-rate limit for state estimation under communication constraints
- Smooth complete Lyapunov functions for ODEs
- 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
- Theory of Reproducing Kernels
- Scattered Data Approximation
- Construction of a Complete Lyapunov Function using Quadratic Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item