Abstract
This paper deals with the robust stability of discrete-time linear time-invariant systems with parametric uncertainties belonging to a semialgebraic set. It is asserted that the robust stability of any system over any semialgebraic set (satisfying a mild condition) is equivalent to solvability of a semidefinite programming (SDP) problem, which can be handled using the available software tools. The particular case of a semialgebraic set associated with a polytope is then investigated, and a computationally appealing method is proposed to attain the SDP problem by means of a sampling technique, introduced recently in the literature. Furthermore, it is shown that the current result encompasses the ones presented in some of the recent works. The efficacy of the proposed method is demonstrated through some illustrative examples, and the results are compared to some of the existing methods.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
