{"title":"Common Solutions to Stein Inequalities","authors":"Şerife Yilmaz, Birgül Aksoy","doi":"10.16984/saufenbilder.1260438","DOIUrl":null,"url":null,"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.","PeriodicalId":21468,"journal":{"name":"Sakarya University Journal of Science","volume":"27 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sakarya University Journal of Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.16984/saufenbilder.1260438","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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.