Skip to Main Content
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.