A test for robust Hurwitz stability of convex combinations of complex polynomials (Q697792)

The paper describes an algorithm for testing Hurwitz stability (location of the roots in the open left half-plane) of a segment of polynomials with complex coefficients (a polynomial affected by one uncertain parameter belonging to a given interval), a problem with applications in linear systems robust control. The algorithm is a minor extension of an existing fraction-free Routh array algorithm for real polynomials. It is based on the Euclidean algorithm to extract the greatest divisor of two polynomials. Entries of the Routh table are kept polynomial in the uncertain parameter, which allows robust stability to be checked in a finite number of arithmetic operations and prevents the use of a numerical polynomial root-finding algorithm. The paper is the exact continuous-time counterpart of a previous publication of the authors [Int. J. Syst. Sci. 32, 1243-1250 (2001; Zbl 1009.93061)], which is surprisingly not referenced here.