Nonrecursive solution for the discrete algebraic Riccati equation and X + A*X-1A=L

Abstract In this paper, we present two new algebraic algorithms for the solution of the discrete algebraic Riccati equation. The first algorithm requires the nonsingularity of the transition matrix and is based on the solution of a standard eigenvalue problem for a new symplectic matrix; the proposed algorithm computes the extreme solutions of the discrete algebraic Riccati equation. The second algorithm solves the Riccati equation without the assumption of the nonsingularity of the transition matrix; the proposed algorithm is based on the solution of the matrix equation X + A*X-1A=L, where A is a singular matrix and L a positive definite matrix.