Lyapunov Function Synthesis - Infeasibility and Farkas' Lemma

Research output: Research - peer-reviewConference article in Journal

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
Book seriesIFAC-PapersOnLine
Volume50
Issue number1
Pages (from-to)1667-1672
ISSN2405-8963
DOI
StatePublished - 10 Jul 2017
Publication categoryResearch
Peer-reviewedYes
Event2017 IFAC Congress -
Duration: 9 Jul 201714 Jul 2017
https://www.ifac2017.org/

Conference

Conference2017 IFAC Congress
Period09/07/201714/07/2017
Internet address
ID: 263776582