{"title":"A non-recursive method for solving the general discrete-time riccati equations related to the H∞ control problem","authors":"Ben M. Chen, A. Saberi, Y. Shamash","doi":"10.23919/ACC.1993.4793376","DOIUrl":null,"url":null,"abstract":"In this paper we propose a non-recursive method for solving the general discrete-time algebraic Riccati equation related to the H<sub>∞</sub>, control problem (H<sub>∞</sub>-DARE). We have achieved this by casting the problem of solving a given H<sub>∞</sub>-DARE to the problem of solving an auxiliary continuous-time algebraic Riccati equation associated with the H<sub>∞</sub> control problem (H<sub>∞</sub>-CARE) for which the well known non-recursive methods of solving are available. The advantages of our approach are: it reduces the computation involved in the recursive algorithms while giving much more accurate solutions, and it readily provides the properties of the general H<sub>∞</sub>-DARE.","PeriodicalId":162700,"journal":{"name":"1993 American Control Conference","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1993 American Control Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/ACC.1993.4793376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12
Abstract
In this paper we propose a non-recursive method for solving the general discrete-time algebraic Riccati equation related to the H∞, control problem (H∞-DARE). We have achieved this by casting the problem of solving a given H∞-DARE to the problem of solving an auxiliary continuous-time algebraic Riccati equation associated with the H∞ control problem (H∞-CARE) for which the well known non-recursive methods of solving are available. The advantages of our approach are: it reduces the computation involved in the recursive algorithms while giving much more accurate solutions, and it readily provides the properties of the general H∞-DARE.