{"title":"求解不定二次项代数里卡蒂方程的迭代算法","authors":"A. Lanzon, Yantao Feng, B. Anderson","doi":"10.23919/ECC.2007.7068239","DOIUrl":null,"url":null,"abstract":"In this paper, an iterative algorithm to solve Algebraic Riccati Equations (ARE) arising from, for example, a standard H∞ control problem is proposed. By constructing two sequences of positive semidefinite matrices, we reduce an ARE with an indefinite quadratic term to a series of AREs with a negative semidefinite quadratic term which can be solved more easily by existing iterative methods (e.g. Kleinman algorithm in [2]). We prove that the proposed algorithm is globally convergent and has local quadratic rate of convergence. Numerical examples are provided to show that our algorithm has better numerical reliability when compared with some traditional algorithms (e.g. Schur method in [5]). Some proofs are omitted for brevity and will be published elsewhere.","PeriodicalId":407048,"journal":{"name":"2007 European Control Conference (ECC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"An iterative algorithm to solve Algebraic Riccati Equations with an indefinite quadratic term\",\"authors\":\"A. Lanzon, Yantao Feng, B. Anderson\",\"doi\":\"10.23919/ECC.2007.7068239\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an iterative algorithm to solve Algebraic Riccati Equations (ARE) arising from, for example, a standard H∞ control problem is proposed. By constructing two sequences of positive semidefinite matrices, we reduce an ARE with an indefinite quadratic term to a series of AREs with a negative semidefinite quadratic term which can be solved more easily by existing iterative methods (e.g. Kleinman algorithm in [2]). We prove that the proposed algorithm is globally convergent and has local quadratic rate of convergence. Numerical examples are provided to show that our algorithm has better numerical reliability when compared with some traditional algorithms (e.g. Schur method in [5]). Some proofs are omitted for brevity and will be published elsewhere.\",\"PeriodicalId\":407048,\"journal\":{\"name\":\"2007 European Control Conference (ECC)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 European Control Conference (ECC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/ECC.2007.7068239\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 European Control Conference (ECC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/ECC.2007.7068239","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An iterative algorithm to solve Algebraic Riccati Equations with an indefinite quadratic term
In this paper, an iterative algorithm to solve Algebraic Riccati Equations (ARE) arising from, for example, a standard H∞ control problem is proposed. By constructing two sequences of positive semidefinite matrices, we reduce an ARE with an indefinite quadratic term to a series of AREs with a negative semidefinite quadratic term which can be solved more easily by existing iterative methods (e.g. Kleinman algorithm in [2]). We prove that the proposed algorithm is globally convergent and has local quadratic rate of convergence. Numerical examples are provided to show that our algorithm has better numerical reliability when compared with some traditional algorithms (e.g. Schur method in [5]). Some proofs are omitted for brevity and will be published elsewhere.