35
C H A P T E R 2
Overview of Kharitonov’s
eorem
2.1 INTRODUCTION
Kharitonov’s theorem addresses the stability problem of interval polynomials. It can be consid-
ered as a generalization of Routh–Hurwitz stability test. Routh–Hurwitz is concerned with an
ordinary polynomial, i.e., a polynomial with fixed coefficients, while Kharitonov’s theorem can
study the stability of polynomials with uncertain coefficients. Before presenting the theorem,
some definition must be introduced.
2.2 KHARITONOV’S THEOREM AND RELATED
MATHEMATICAL TOOLS
Before presenting the Kharitonov’s theorem, some definitions must be studied. Required defi-
nitions are given below.
Definition 2.1 (Stability). A fixed polynomial P .s/, i.e., with fixed coefficients, is said to be
stable (or Hurwitz) if all its roots lie in the strict Left Half Plane (LHP).
For example, p
.
s
/
D s
2
C 2s C 5 is stable since its roots .1 ˙ 2j /, lie in the LHP. De-
pendence of a transfer function on a vector of uncertain parameters q is shown with the aid of
p.s; q/ instead of p.s/.
Definition 2.2 (Robust Stability). A given family of polynomials P D fp
.
; q
/
W q 2 Qg is
said to be robustly stable if, for all q 2 Q, P .s; q/ is stable. at is, for all roots of P .s; q/ lie in
the strict LHP.
Definition 2.3 (D Stability). A polynomial is said to be D stable if all of its roots lie in D C .
In the above definition, D is sub-region of LHP. In fact, D stability is an attempt to restrict
the acceptable region of poles. Assume a system that needs a settling time of less than 5 sec and