By Topic

On robust Hurwitz polynomials

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Anderson, B. ; Australian National University, Canberra, Australia ; Jury, E.I. ; Mansour, M.

In this note, Kharitonov's theorem on robust Hurwitz polynomials is simplified for low-order polynomials. Specifically, for n = 3, 4 , 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 n \geq 6 , 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.

Published in:

Automatic Control, IEEE Transactions on  (Volume:32 ,  Issue: 10 )