{"title":"求解方程X + A*X- 1a = I的新算法","authors":"Min Li, Yueting Yang, Qingchun Li","doi":"10.1109/CSO.2012.17","DOIUrl":null,"url":null,"abstract":"In this paper, we investigate the existence of positive definite solutions for the matrix equation X+A*X-1 A=I. A new inversion free variant of the basic fixed point iteration method for obtaining the maximal positive definite solution is established. Moreover, some necessary conditions and sufficient conditions for the existence of positive definite solutions of the matrix equation are obtained. In the end, one numerical example is given to illustrate the effectiveness of our results.","PeriodicalId":170543,"journal":{"name":"2012 Fifth International Joint Conference on Computational Sciences and Optimization","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A New Algorithm for Solving the Equation X + A*X-1A = I\",\"authors\":\"Min Li, Yueting Yang, Qingchun Li\",\"doi\":\"10.1109/CSO.2012.17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we investigate the existence of positive definite solutions for the matrix equation X+A*X-1 A=I. A new inversion free variant of the basic fixed point iteration method for obtaining the maximal positive definite solution is established. Moreover, some necessary conditions and sufficient conditions for the existence of positive definite solutions of the matrix equation are obtained. In the end, one numerical example is given to illustrate the effectiveness of our results.\",\"PeriodicalId\":170543,\"journal\":{\"name\":\"2012 Fifth International Joint Conference on Computational Sciences and Optimization\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Fifth International Joint Conference on Computational Sciences and Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSO.2012.17\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fifth International Joint Conference on Computational Sciences and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSO.2012.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A New Algorithm for Solving the Equation X + A*X-1A = I
In this paper, we investigate the existence of positive definite solutions for the matrix equation X+A*X-1 A=I. A new inversion free variant of the basic fixed point iteration method for obtaining the maximal positive definite solution is established. Moreover, some necessary conditions and sufficient conditions for the existence of positive definite solutions of the matrix equation are obtained. In the end, one numerical example is given to illustrate the effectiveness of our results.