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.
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.
