Robust stability analysis of polynomials with linearly dependent coefficient perturbations

Abstract

A computational tractable procedure for robust pole location analysis of uncertain linear time-invariant dynamical systems, whose characteristic polynomial coefficients depend linearly on parameter perturbations, is proposed. It is shown that, in the case of linearly dependent coefficient perturbations, the stability test with respect to any unconnected domain of the complex plane can be carried out, and the largest stability domain in parameter space can be computed by using only a quick test on a particular set of polynomials named vertex polynomials. The procedure requires only one sweeping function and simple geometrical considerations at each sweeping step. This leads to a very short execution time, as is shown in an example. A unification with Kharitonov's theory and edge theorem is also provided.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>