Results on Robustness of Pole Location in Perturbed Systems

Abstract

In this paper we present some results on the robustness of the location of roots of polynomials in given regions of the complex plan for unknown but hounded perturbations on the polynomial coefficients. A geometric approach in coefficient space is exploited to derive maximal deviations (in a given class of admissible perturbations) of characeristic polynomial coefficients of an uncertain linear system from their nominal values preserving system poles in a given region of the complex plane. It is also shown that the solution of this problem can he used to give computationally feasible necessary and sufficient conditions such that all the roots of the members of a given interval family of polynomials lie in a given open region of the complex plane. This last result can be considered an extension of the result of the well known theorem of Kharitonov. It is also outlined how the proposed technique can be used to deal with families of polynomials with linearly correlated coefficient perturbations.