15th Triennial World Congress of the International Federation of Automatic Control
  Barcelona, 21–26 July 2002 
A TABULAR ALGORITHM FOR TESTING THE ROBUST HURWITZ STABILITY OF CONVEX COMBINATIONS OF COMPLEX POLYNOMIALS
Shih-Feng Yang* Chyi Hwang**
* Department of Information Management
Transworld Institute of Technology
Douliu 640
TAIWAN
E-mail: ysf@tit.edu.tw
** Department of Chemical Engineering
National Chung Cheng University
Chia-Yi 621
TAIWAN
E-mail: chmch@ccunix.ccu.edu.tw
Fax: 886-5-272-1206

In this paper we present a tabular altorithm for testing the Hurwitz property of a segment of complex polynomials. The algorithm consists in constructing a parametric Routh-like array with polynomial entries and generating Sturm sequences for checking the absence of zeros of two real polynomials in the interval (0,1). The presented algorithm is easy to implement. Moreover, it accomplishes the test in a finite number of arithmetic operations because it does not invoke any numerical root-finding procedure.
Keywords: Hurwitz polynomial, robust stability, robustness, Routh’s criterion, uncertainty
Session slot T-We-A15: Robust Analysis II/Area code 2e : Robust Control