Cart (Loading....) | Create Account
Close category search window
 

Robust stability of LTI discrete-time systems using sum-of-squares matrix polynomials

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
$31 $13
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

2 Author(s)
Yanesi, J.L. ; Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que. ; Aghdam, A.G.

This paper deals with the robust stability of discrete-time systems with convex polytopic uncertainties. A necessary and sufficient condition for the robust stability of the system is presented, which states that the system is robust stable if and only if there exist three matrix polynomials to satisfy a specific relation. This existence condition can be easily converted to a semidefinite programming (SDP) problem, which can be solved using a number of available softwares

Published in:

American Control Conference, 2006

Date of Conference:

14-16 June 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.