Optimization over Polynomials for Analysis of Polynomial Vector Fields
Seminar Room 1, Newton Institute
AbstractWe 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.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.