Abstract
In this paper for linear discrete time switched systems, the problem of existence of a common solution to Stein inequalities is considered. A sufficient condition for robust Schur stability of a matrix polyope by using Schur complement lemma and a necessary and sufficient condition for the existence of a common solution of Stein equation are given. As in the case of continuous time systems, the problem of existence of a common solution is reduced to a convex optimization one. An efficient solution algorithm which requires solving a linear minimax problem at each step is suggested. The algorithm is supported with a number of examples from the literature and observed that the method desired results fastly.
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.
