A converse sum of squares Lyapunov result with a degree bound

Matthew M. Peet, Antonis Papachristodoulou

Research output: Contribution to journalArticle

23 Scopus citations

Abstract

Although sum of squares programming has been used extensively over the past decade for the stability analysis of nonlinear systems, several fundamental questions remain unanswered. In this paper, we show that exponential stability of a polynomial vector field on a bounded set implies the existence of a Lyapunov function which is a sum of squares of polynomials. In particular, the main result states that if a system is exponentially stable on a bounded nonempty set, then there exists a sum of squares Lyapunov function which is exponentially decreasing on that bounded set. Furthermore, we derive a bound on the degree of this converse Lyapunov function as a function of the continuity and stability properties of the vector field. The proof is constructive and uses the Picard iteration. Our result implies that semidefinite programming can be used to answer the question of stability of a polynomial vector field with a bound on complexity.

Original languageEnglish (US)
Article number6194280
Pages (from-to)2281-2293
Number of pages13
JournalIEEE Transactions on Automatic Control
Volume57
Issue number9
DOIs
StatePublished - Sep 7 2012
Externally publishedYes

    Fingerprint

Keywords

  • Computational complexity
  • Lyapunov functions
  • linear matrix inequalities (LMIs)
  • nonlinear systems
  • ordinary differential equations
  • stability
  • sum-of-squares

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this