Sufficient conditions for checking the robust stability of a polytope of polynomial matrices are proposed in this paper. Simple feasibility tests performed in a convex set of linear matrix inequalities defined at the vertices of the polytope yield sufficient conditions for the robust stability of the entire domain. Both continuous-time (left half-plane) and discrete-time stability (unit disk) are investigated. Improved sufficient conditions are also presented, containing the previous ones as special cases, providing an efficient numerical method for the robust stability analysis of polytopes of polynomial matrices. Numerical comparisons with quadratic stability and with results obtained from other recent methods in the literature show that the proposed conditions provide less conservative evaluations.
Robust stability; polynomial matrices; uncertain polynomials; linear matrix inequalities; parameter dependent Lyapunov functions
