- Journal Home
- Volume 39 - 2021
- Volume 38 - 2020
- Volume 37 - 2019
- Volume 36 - 2018
- Volume 35 - 2017
- Volume 34 - 2016
- Volume 33 - 2015
- Volume 32 - 2014
- Volume 31 - 2013
- Volume 30 - 2012
- Volume 29 - 2011
- Volume 28 - 2010
- Volume 27 - 2009
- Volume 26 - 2008
- Volume 25 - 2007
- Volume 24 - 2006
- Volume 23 - 2005
- Volume 22 - 2004
- Volume 21 - 2003
- Volume 20 - 2002
- Volume 19 - 2001
- Volume 18 - 2000
- Volume 17 - 1999
- Volume 16 - 1998
- Volume 15 - 1997
- Volume 14 - 1996
- Volume 13 - 1995
- Volume 12 - 1994
- Volume 11 - 1993
- Volume 10 - 1992
- Volume 9 - 1991
- Volume 8 - 1990
- Volume 7 - 1989
- Volume 6 - 1988
- Volume 5 - 1987
- Volume 4 - 1986
- Volume 3 - 1985
- Volume 2 - 1984
- Volume 1 - 1983
On Eigenvalue Bounds and Iteration Methods for Discrete Algebraic Riccati Equations
- BibTex
- RIS
- TXT
@Article{JCM-29-341,
author = {Hua Dai and Zhong-Zhi Bai},
title = {On Eigenvalue Bounds and Iteration Methods for Discrete Algebraic Riccati Equations},
journal = {Journal of Computational Mathematics},
year = {2011},
volume = {29},
number = {3},
pages = {341--366},
abstract = { We derive new and tight bounds about the eigenvalues and certain sums of the eigenvalues for the unique symmetric positive definite solutions of the discrete algebraic Riccati equations. These bounds considerably improve the existing ones and treat the cases that have been not discussed in the literature. Besides, they also result in completions for the available bounds about the extremal eigenvalues and the traces of the solutions of the discrete algebraic Riccati equations. We study the fixed-point iteration methods for computing the symmetric positive definite solutions of the discrete algebraic Riccati equations and establish their general convergence theory. By making use of the Schulz iteration to partially avoid computing the matrix inversions, we present effective variants of the fixed-point iterations, prove their monotone convergence and estimate their asymptotic convergence rates. Numerical results show that the modified fixed-point iteration methods are feasible and effective solvers for computing the symmetric positive definite solutions of the discrete algebraic Riccati equations.},
issn = {1991-7139},
doi = {https://doi.org/10.4208/jcm.1010-m3258},
url = {http://global-sci.org/intro/article_detail/jcm/8482.html}
}
TY - JOUR
T1 - On Eigenvalue Bounds and Iteration Methods for Discrete Algebraic Riccati Equations
AU - Hua Dai & Zhong-Zhi Bai
JO - Journal of Computational Mathematics
VL - 3
SP - 341
EP - 366
PY - 2011
DA - 2011/06
SN - 29
DO - http://doi.org/10.4208/jcm.1010-m3258
UR - https://global-sci.org/intro/article_detail/jcm/8482.html
KW - Discrete algebraic Riccati equation
KW - Symmetric positive definite solution
KW - Eigenvalue bound
KW - Fixed-point iteration
KW - Convergence theory
AB - We derive new and tight bounds about the eigenvalues and certain sums of the eigenvalues for the unique symmetric positive definite solutions of the discrete algebraic Riccati equations. These bounds considerably improve the existing ones and treat the cases that have been not discussed in the literature. Besides, they also result in completions for the available bounds about the extremal eigenvalues and the traces of the solutions of the discrete algebraic Riccati equations. We study the fixed-point iteration methods for computing the symmetric positive definite solutions of the discrete algebraic Riccati equations and establish their general convergence theory. By making use of the Schulz iteration to partially avoid computing the matrix inversions, we present effective variants of the fixed-point iterations, prove their monotone convergence and estimate their asymptotic convergence rates. Numerical results show that the modified fixed-point iteration methods are feasible and effective solvers for computing the symmetric positive definite solutions of the discrete algebraic Riccati equations.
Hua Dai & Zhong-Zhi Bai. (1970). On Eigenvalue Bounds and Iteration Methods for Discrete Algebraic Riccati Equations.
Journal of Computational Mathematics. 29 (3).
341-366.
doi:10.4208/jcm.1010-m3258
Copy to clipboard