English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

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 -1 A=L, where A is a singular matrix and L a positive definite matrix.

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