Abstract
A new sharp lower bound for the solution of the algebraic Riccati equation of optimal control is presented for the case when the state cost matrix Q is positive definite. The bound is easier to evaluate than previous sharp bounds. It is then used in the derivation of a geometric convergence rate for the Kleinman algorithm (an iterative method for solving the algebraic Riccati equation).
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.
