Abstract
We consider the numerical solution of large-scale discrete-time algebraic Riccati equations. The doubling algorithm is adapted, with the iterates for A not computed explicitly but recursively. The resulting algorithm is efficient, with computational complexity and memory requirement proportional to the size of the problem, and essentially converges quadratically. An error analysis, on the truncation of iterates, and some numerical results are presented.
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.
