Sciweavers

INFORMATICALT
2007

Strongly Absolute Stability Problem of Descriptor Systems

13 years 4 months ago
Strongly Absolute Stability Problem of Descriptor Systems
Abstract. This paper considers Lur’e type descriptor systems (LDS). The concept of strongly absolute stability is defined for LDS and such a notion is a generalization of absolute stability for Lur’e type standard state-space systems (LSS). A reduced-order LSS is obtained by a standard coordinate transformation and it is shown that the strongly absolute stability of the LDS is equivalent to the absolute stability of the reduced-order LSS. By a generalized Lyapunov function, we derive an LMIs based strongly absolute stability criterion. Furthermore, we present the frequency-domain interpretation of the criterion, which shows that the criterion is a generalization of the classical circle criterion. Finally, numerical examples are given to illustrate the effectiveness of the obtained results. Key words: Lur’e type systems, descriptor systems, strongly absolute stability, linear matrix inequality (LMI).
Chunyu Yang, Qingling Zhang, Linna Zhou
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where INFORMATICALT
Authors Chunyu Yang, Qingling Zhang, Linna Zhou
Comments (0)