Abstract
An iterative algorithm to solve algebraic riccati equations with an indefinite quadratic term is proposed. The global convergence and local quadratic rate of convergence of the algorithm are guaranteed and a proof is given. Numerical examples are also provided to demonstrate the superior effectiveness of the proposed algorithm when compared with methods based on finding stable invariant subspaces of Hamiltonian matrices. A game theoretic interpretation of the algorithm is also provided.
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.
