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.
|Publication status||Published - 10 Jul 2017|
|Event||2017 IFAC Congress - |
Duration: 9 Jul 2017 → 14 Jul 2017
|Conference||2017 IFAC Congress|
|Period||09/07/2017 → 14/07/2017|