DocumentCode :
1236892
Title :
Necessary and sufficient conditions for root clustering of a polytope of polynomials in a simply connected domain
Author :
Zeheb, Ezra
Author_Institution :
Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel
Volume :
34
Issue :
9
fYear :
1989
fDate :
9/1/1989 12:00:00 AM
Firstpage :
986
Lastpage :
990
Abstract :
Linear time-invariant systems with uncertain parameters are considered. A test is given which is both necessary and sufficient for root clustering of a family of polytopic polynomials in a simply connected domain. The test does not require checking a continuum of polynomials. Special cases include stability testing of continuous-time systems and of discrete-time systems with uncertain parameters, as well as `relative stability´ tests of such systems. Interval polynomials can also be handled as a special case
Keywords :
discrete time systems; linear systems; polynomials; stability criteria; continuous-time systems; discrete-time systems; linear systems; necessary condition; polytopic polynomials; root clustering; stability testing; sufficient conditions; time-invariant systems; uncertain parameters; Eigenvalues and eigenfunctions; Equations; Polynomials; Robustness; Sensor systems; Stability; Sufficient conditions; System testing; Transfer functions; Uncertain systems;
fLanguage :
English
Journal_Title :
Automatic Control, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9286
Type :
jour
DOI :
10.1109/9.35813
Filename :
35813
Link To Document :
بازگشت