@article{LETH20171667,
Abstract = {In this paper we prove the convergence of an algorithm synthesising continuous piecewise-polynomial Lyapunov functions for polynomial vector fields defined on simplices. We subsequently modify the algorithm to sub-divide locally by utilizing information from infeasible linear problems. We prove that this modification does not destroy the convergence of the algorithm. Both methods are accompanied by examples.},
Author = {Leth, Tobias and Sloth, Christoffer and Wisniewski, Rafa{\l} and Sankaranarayanan, Sriram},
File = {Lyapunov Function Synthesis - Infeasibility and Farkas’ Lemma - 1-s2.0-S2405896317306687-main - a - d.pdf},
ISSN = {2405-8963},
Journal = {IFAC-PapersOnLine},
Keywords = {Lyapunov methods, Stability of nonlinear systems, Algorithmic design},
Note = {20th IFAC World Congress},
Number = {1},
Pages = {1667 - 1672},
Title = {Lyapunov Function Synthesis - Infeasibility and Farkas' Lemma**This work is supported by the Danish Council for Independent Research under grant number DFF - 4005-00452 in the project CodeMe.},
URL = {http://www.sciencedirect.com/science/article/pii/S2405896317306687},
Volume = {50},
Year = {2017},
bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S2405896317306687},
bdsk-url-2 = {https://doi.org/10.1016/j.ifacol.2017.08.339},
date-added = {2021-01-20 19:36:20 +0100},
date-modified = {2021-01-20 19:36:20 +0100},
doi = {10.1016/j.ifacol.2017.08.339}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A