By Topic

Robust root-clustering analysis in a union of subregions for descriptor systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
O. Rejichi ; ENIS, Univ. of Sfax, Sfax ; O. Bachelier ; M. Chaabane ; D. Mehdi

A robust matrix root-clustering analysis for descriptor systems is considered. It states a necessary and sufficient condition for a descriptor system to be regular, impulse free and to have its finite poles in a specified region of the complex plane. This region is a union of convex and possibly disjoint and non-symmetric subregions. A sufficient condition to preserve those properties in the presence of polytopic and norm-bounded uncertainties affecting the state matrix is also established. This condition is based upon the implicit derivation of parameter-dependent Lyapunov functions. All the conditions are expressed in terms of linear matrix inequalities.

Published in:

IET Control Theory & Applications  (Volume:2 ,  Issue: 7 )