4.4 Article

A new inversion-free iterative algorithm for the discrete algebraic Riccati equation

Publisher

OXFORD UNIV PRESS
DOI: 10.1093/imamci/dnad033

Keywords

inverse-free; discrete algebraic Riccati equation; iterative algorithm; convergence analysis

Ask authors/readers for more resources

In this paper, a new inverse-free iterative algorithm is proposed to obtain the positive definite solution of the discrete algebraic Riccati equation (DARE). Monotone convergence is proved and convergence rate analysis is presented for the derived algorithm. Numerical examples demonstrate the feasibility and effectiveness of the proposed algorithm.
In this paper, by the transformation form of the discrete algebraic Riccati equation (DARE), we propose a new inverse-free iterative algorithm to obtain the positive definite solution of the DARE. Furthermore, the monotone convergence is proved and convergence rate analysis is presented for the derived algorithm. Compared with some existing algorithms, numerical examples demonstrate the feasibility and effectiveness of our algorithm.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available