System specific triangulations for the construction of cpa lyapunov functions

Peter Giesl, Sigurdur Hafstein

Research output: Contribution to journalArticlepeer-review

Abstract

Recently, a transformation of the vertices of a regular triangulation of Rn with vertices in the lattice Zn was introduced, which distributes the vertices with approximate rotational symmetry properties around the origin. We prove that the simplices of the transformed triangulation are (h; d)-bounded, a type of non-degeneracy particularly useful in the numerical computation of Lyapunov functions for nonlinear systems using the CPA (continuous piecewise afine) method. Additionally, we discuss and give examples of how this transformed triangulation can be used together with a Lyapunov function for a linearization to compute a Lyapunov function for a nonlinear system with the CPA method using considerably fewer simplices than when using a regular triangulation.

Original languageEnglish
Pages (from-to)6027-6046
Number of pages20
JournalDiscrete and Continuous Dynamical Systems - Series B
Volume26
Issue number12
DOIs
Publication statusPublished - Dec 2021

Bibliographical note

Publisher Copyright: © 2021 American Institute of Mathematical Sciences. All rights reserved.

Other keywords

  • Lyapunov function
  • Nonlinear transformation
  • Simplicial complex
  • Triangulation

Fingerprint

Dive into the research topics of 'System specific triangulations for the construction of cpa lyapunov functions'. Together they form a unique fingerprint.

Cite this