From Algebraic Riccati equations to unilateral quadratic matrix equations: old and new algorithms

Abstract

The problem of reducing an algebraic Riccati equation XCX −AX − XD + B = 0 to a unilateral quadratic matrix equation (UQME) of the kind PX + QX + R = 0 is analyzed. New reductions are introduced which enable one to prove some theoretical and computational properties. In particular we show that the structure preserving doubling algorithm of B.D.O. Anderson [Internat. J. Control, 1978] is in fact the cyclic reduction algorithm of Hockney [J. Assoc. Comput. Mach., 1965] and Buzbee, Golub, Nielson [SIAM J. Numer. Anal., 1970], applied to a suitable UQME. A new algorithm obtained by complementing our reductions with the shrink-and-shift technique of Ramaswami is presented. Finally, faster algorithms which require some non-singularity conditions, are designed. The non-singularity restriction is relaxed by introducing a suitable similarity transformation of the Hamiltonian.

Extracted Key Phrases

4 Figures and Tables

Cite this paper

@inproceedings{Bini2007FromAR, title={From Algebraic Riccati equations to unilateral quadratic matrix equations: old and new algorithms}, author={Dario Bini and Beatrice Meini and Federico Poloni}, booktitle={Numerical Methods for Structured Markov Chains}, year={2007} }