Robust stability of interval polynomial sets in discrete-time

Author

Feuer, Arie ; Zeheb, Ezra

Author_Institution

Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel

Volume

1

fYear

1997

fDate

10-12 Dec 1997

Firstpage

902

Abstract

Kharitonov (1979) has shown that the robust stability of an interval polynomial, which is the characteristic polynomial in a continuous-time system, can be determined by testing the stability of four polynomials only. In some later results, for the discrete-time counterpart, it was shown that, when realized by the delta operator, for a similar test one needs to test the stability of 2ⁿ⁺¹ polynomials. We present here a novel proof of a similar result in the process of which it is shown that the number of polynomials needed for the test is in fact smaller-this smaller set of polynomials is explicitly specified. Furthermore, we show that as the sampling rate associated with the discrete-time system grows to infinity the stability test presented here converges to the Kharitonov test

Keywords

discrete time systems; numerical stability; polynomials; robust control; sampled data systems; set theory; Kharitonov test; characteristic polynomial; continuous-time system; delta operator; discrete-time; discrete-time system; interval polynomial sets; robust stability; sampling rate; Discrete transforms; H infinity control; Polynomials; Robust stability; Robustness; Sampling methods; System testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Decision and Control, 1997., Proceedings of the 36th IEEE Conference on

Conference_Location

San Diego, CA

ISSN

0191-2216

Print_ISBN

0-7803-4187-2

Type

conf

DOI

10.1109/CDC.1997.650757

Filename

650757