Lyapunov Function Synthesis - Infeasibility and Farkas' Lemma

Publication: Research - peer-reviewArticle in proceeding

Abstract

In this paper we prove the convergence of an algorithm synthesising continuous piecewise-polynomial Lyapunov functions for polynomial vector elds dened on simplices. We subsequently modify the algorithm to sub-divide locally by utilizing information from infeasible linear problems. We prove that this modication does not destroy the convergence of the algorithm. Both methods are accompanied by examples.
Close

Details

In this paper we prove the convergence of an algorithm synthesising continuous piecewise-polynomial Lyapunov functions for polynomial vector elds dened on simplices. We subsequently modify the algorithm to sub-divide locally by utilizing information from infeasible linear problems. We prove that this modication does not destroy the convergence of the algorithm. Both methods are accompanied by examples.
Original languageEnglish
Title of host publicationPreprints of the 20th World Congress
Number of pages6
PublisherIEEE Press
Publication date10 Jul 2017
Pages1703-1708
StatePublished - 10 Jul 2017
Event2017 IFAC Congress -

Conference

Conference2017 IFAC Congress
Periode09/07/201714/07/2017
Internetadresse
ID: 261976775