Abstract
Several algorithms have been suggested to parameterize continuous and piecewise affine Lyapunov functions for nonlinear systems in various settings. In these algorithms linear constraints are formulated for the values of a Lyapunov function at all vertices of a simplicial complex. They are then either solved using convex optimization or computed by other means and then verified. Originally these algorithms were designed for continuous-time systems and their adaptation to discrete-time systems and control systems poses some challenges in designing and implementing efficient algorithms and data structures for simplicial complexes. In this paper we discuss several of these and give efficient implementations in C++.
| Original language | English |
|---|---|
| Title of host publication | SIMULTECH 2017 - Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications |
| Editors | Floriano De Rango, Tuncer Oren, Mohammad S. Obaidat |
| Publisher | SciTePress |
| Pages | 398-409 |
| Number of pages | 12 |
| ISBN (Electronic) | 9789897582653 |
| DOIs | |
| Publication status | Published - 2017 |
| Event | 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications, SIMULTECH 2017 - Madrid, Spain Duration: 26 Jul 2017 → 28 Jul 2017 |
Publication series
| Name | SIMULTECH 2017 - Proceedings of the 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications |
|---|
Conference
| Conference | 7th International Conference on Simulation and Modeling Methodologies, Technologies and Applications, SIMULTECH 2017 |
|---|---|
| Country/Territory | Spain |
| City | Madrid |
| Period | 26/07/17 → 28/07/17 |
Bibliographical note
Publisher Copyright:© Copyright 2017 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved.
Other keywords
- Algorithm
- Discrete-time System
- Lyapunov Function
- Nonlinear System
- Simplicial Complex
- Triangulation