185
Views
3
CrossRef citations to date
0
Altmetric
Section B

New matrix bounds, an existence uniqueness and a fixed-point iterative algorithm for the solution of the unified coupled algebraic Riccati equation

&
Pages 527-542 | Received 16 Jun 2011, Accepted 18 Nov 2011, Published online: 24 Jan 2012
 

Abstract

In this paper, combining the equivalent form of the unified coupled algebraic Riccati equation (UCARE) with the eigenvalue inequalities of a matrix's sum and product, using the properties of an M-matrix and its inverse matrix, we offer new lower and upper matrix bounds for the solution of the UCARE. Furthermore, applying the derived lower and upper matrix bounds and a fixed-point theorem, an existence uniqueness condition of the solution of the UCARE is proposed. Then, we propose a new fixed-point iterative algorithm for the solution of the UCARE. Finally, we present a corresponding numerical example to demonstrate the effectiveness of our results.

2010 AMS Subject Classifications :

Acknowledgements

The author would like to thank Professor Choi-Hong Lai and the referees for their very helpful comments and suggestions. The work was supported in part by the National Natural Science Foundation of China (10971176), the Key Project of Hunan Provincial Natural Science Foundation of China (10JJ2002) and the Hunan Provincial Innovation Foundation for Postgraduates (CX2011B242).

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.