s42979-023-01777-2.pdf (2.39 MB)
Triangulations and error estimates for interpolating Lyapunov functions
Version 2 2023-11-15, 15:30
Version 1 2023-06-10, 06:47
journal contribution
posted on 2023-11-15, 15:30 authored by Peter GieslPeter Giesl, Sigurdur HafsteinThe CPA method to compute Lyapunov functions depends on a triangulation of the relevant part of the state-space. In more detail, a CPA (Continuous and Piecewise Affine) function is affine on each simplex of a given triangulation and is determined by the values at the vertices of the triangulation. Two important aspects in the proof that the CPA method is always able to generate a CPA Lyapunov function if the triangulation is sufficiently fine, are (a) the geometry of the simplices of the triangulation and (b) error estimates of CPA interpolations of functions. In this paper the aspect (a) is tackled by extending the notion of (h,d)-boundedness, which so far has depended on the order of the vertices in each simplex, and it is shown that it is essentially independent of the order and can be expressed in terms of the condition number of the shape matrix. Concerning (b), existing error estimates are generalised to other norms to increase the flexibility of the CPA method. In particular, when the CPA method is used to verify Lyapunov function candidates generated by other methods. Parts of the results were presented in.
History
Publication status
- Published
File Version
- Published version
Journal
SN Computer ScienceISSN
2661-8907Publisher
SpringerExternal DOI
Volume
4Page range
1-15Department affiliated with
- Mathematics Publications
Institution
University of SussexFull text available
- Yes
Peer reviewed?
- Yes
Legacy Posted Date
2023-04-18First Open Access (FOA) Date
2023-05-04First Compliant Deposit (FCD) Date
2023-04-17Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC