Convergence of an algorithm for constructing Lyapunov functions for switched systems using meshfree collocation
classification
🧮 math.DS
keywords
systemscollocationlyapunovswitchedalgorithmdescribedexistencefunctions
read the original abstract
Switched systems are a class of dynamical systems where trajectories switch between different systems based on a switching rule. This rule can depend on time and/or the position of the trajectory in the state space. The existence of a Lyapunov function implies the existence of a uniformly asymptotically stable equilibrium point at the origin, which we prove in this paper. A method to construct Lyapunov functions for switched systems using meshfree collocation and quadratic programming was described in a related article. We prove that, under suitable assumptions, the algorithm described in this previous work converges as the fill distance between the collocation points tends to zero.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.