DocumentCode :
854108
Title :
On robust Hurwitz polynomials
Author :
Anderson, B. D O ; Jury, E.I. ; Mansour, M.
Author_Institution :
Australian National University, Canberra, Australia
Volume :
32
Issue :
10
fYear :
1987
fDate :
10/1/1987 12:00:00 AM
Firstpage :
909
Lastpage :
913
Abstract :
In this note, Kharitonov\´s theorem on robust Hurwitz polynomials is simplified for low-order polynomials. Specifically, for 
, and 5, the number of polynomials required to check robust stability is one, two, and three, respectively, instead of four. Furthermore, it is shown that for 
, the number of polynomials for robust stability checking is necessarily four, thus further simplification is not possible. The same simplifications arise in robust Schur polynomials by using the bilinear transformation. Applications of these simplifications to two-dimensional polynomials as well as to robustness for single parameters are indicated.
, and 5, the number of polynomials required to check robust stability is one, two, and three, respectively, instead of four. Furthermore, it is shown that for , the number of polynomials for robust stability checking is necessarily four, thus further simplification is not possible. The same simplifications arise in robust Schur polynomials by using the bilinear transformation. Applications of these simplifications to two-dimensional polynomials as well as to robustness for single parameters are indicated.Keywords :
Polynomials; Robustness, linear systems; Routh methods, linear systems; Automatic control; Polynomials; Robust stability; Robustness; Sufficient conditions; Systems engineering and theory; Testing;
fLanguage :
English
Journal_Title :
Automatic Control, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9286
Type :
jour
DOI :
10.1109/TAC.1987.1104459
Filename :
1104459
Link To Document :
