Skip to content
naulon
Not checkedNot checked for notices yet.

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

Adam Maria, Assimakis Nicholas

Open Mathematics · 2015

doi:10.1515/math-2015-0006 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

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.

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.