Piecewise polynomial Lyapunov functions with guaranteed accuracy

We address the stability problem for switched systems. We present new semidefinite programming based methods that appear very efficient in practice. These methods rely on the computation of piecewise defined Lyapunov functions. We compare the state-of-the-art in continuous and discrete time. We raise a few questions, with an emphasis on the computational complexity point of view, and answer some of them.