skip to content

Optimization over Polynomials for Analysis of Polynomial Vector Fields

Presented by: 
A Ahmadi IBM Thomas J. Watson Research Center
Thursday 18th July 2013 - 12:00 to 12:30
INI Seminar Room 1
We present complexity results and semidefinite programming (SDP) based algorithms for stability analysis of polynomial differential equations. We show that deciding asymptotic stability of homogeneous cubic vector fields is strongly NP-hard. We then settle some of the converse questions on existence of polynomial and sum of squares Lyapunov functions.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons