Abstract
We propose a new quadratically convergent algorithm, having a low computational cost per step and good numerical stability properties, that allows the computation of the maximal solutions of the matrix equations X + C*X -1 C = Q, X - C*X -1 C = Q, X + C*(R + B*XB) -1 C = Q. The algorithm is based on the cyclic reduction method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W. N. Anderson Jr., T. D. Morley, and G. E. Trapp. Positive solutions to X = A-BX -1 B*. Linear Algebra Appl., 134:53–62, 1990.
D. A. Bini and B. Meini. On the solution of a nonlinear matrix equation arising in queueing problems. SIAM J. Matrix Anal. Appl., 17:906–926, 1996.
D. A. Bini and B. Meini. Improved cyclic reduction for solving queueing problems. Numerical Algorithms, 15:57–74, 1997.
D. A. Bini and B. Meini. Effective methods for solving banded Toeplitz systems. SIAM J. Matrix Anal. Appl., 20:700–719, 1999.
H. Dym. Hermitian block toeplitz matrices, orthogonal polynomials, reproducing kernel pontryagin spaces, interpolation and extension. Oper. Theory, Adv. Appl., 34:79–135, 1998. Orthogonal matrix-valued polynomials and applications, Pap. Semin. Oper. Theory, Tel Aviv/Isr.
J. C. Engwerda. On the existence of a positive definite solution of the matrix equation X + A T X -1 A = I. Linear Algebra Appl., 194:91–108, 1993.
J. C. Engwerda, A. C. M. Ran, and A. L. Rijkeboer. Necessary and sufficient conditions for the existence of a positive definite solution of the matrix equation X + A*X -1 A = Q. Linear Algebra Appl., 186:255–275, 1993.
A. Ferrante and B. C. Levy. Hermitian solutions of the equation X = Q+NX -1 N.. Linear Algebra Appl., 247:359–373, 1996.
C.-H. Guo. Newtons’s method for discrete algebraic Riccati equations when the closed-loop matrix has eigenvalues on the unit circle. SIAM J. Matrix Anal. Appl., 20:279–294, 1999.
C.-H. Guo and P. Lancaster. Iterative solution of two matrix equations. Math. Comp., 68:1589–1603, 1999.
P. Lancaster and L. Rodman. Algebraic Riccati equations. Clarendon Press, Oxford, 1995.
B. Meini. Efficient computation of the extreme solutions of X + A*X-1A = Q, X-A*X-1A = Q. Submitted for publication, 1999. 579, 580, 582, 583
M. Miranda and P. Tilli. Block Toeplitz matrices and preconditioning. Calcolo, 33(1–2):79–86 (1998), 1996. Toeplitz matrices: structures, algorithms and applications (Cortona, 1996). 581
M. Miranda and P. Tilli. Asymptotic spectra of Hermitian block Toeplitz matrices and preconditioning results. SIAM J. Matrix Anal. Appl., 21(3):867–881 (electronic), 2000. 581
S. Serra. Asymptotic results on the spectra of block Toeplitz preconditioned matrices. SIAM J. Matrix Anal. Appl., 20(1):31–44 (electronic), 1999. 581
S. Serra. Spectral and computational analysis of block Toeplitz matrices having nonnegative definite matrix-valued generating functions. BIT, 39(1):152–175, 1999. 581
P. Tilli. Asymptotic spectral distribution of Toeplitz-related matrices. In T. Kailath and A. H. Sayed, editors, Fast reliable algorithms for matrices with structure, chapter 6, pages 153–187. SIAM, Philadelphia, 1999. 581
X. Zhan. Computing the extremal positive definite solutions of a matrix equation. SIAM J. Sci. Comput., 17:1167–1174, 1996. 578, 579, 580
X. Zhan and J. Xie. On the matrix equation X + ATX-1A = I. Linear Algebra Appl., 247:337–345, 1996. 578, 580
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meini, B. (2001). Matrix Equations and Structures: Efficient Solution of Special Discrete Algebraic Riccati Equations. In: Vulkov, L., Yalamov, P., Waśniewski, J. (eds) Numerical Analysis and Its Applications. NAA 2000. Lecture Notes in Computer Science, vol 1988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45262-1_68
Download citation
DOI: https://doi.org/10.1007/3-540-45262-1_68
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41814-6
Online ISBN: 978-3-540-45262-1
eBook Packages: Springer Book Archive