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


The problem of reducing an algebraic Riccati equation XCX − AX − XD + B = 0 to a unilateral quadratic matrix equation (UQME) of the kind P X 2 + 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. 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

Showing 1-10 of 28 references

Matrix analytic methods for stochastic uid ows

  • V Ramaswami
  • 1930
Highly Influential
12 Excerpts

Numerical methods for structured Markov chains. Numerical Mathematics and Scientic Computation

  • D A Bini, G Latouche, B Meini
  • 2005
Highly Influential
5 Excerpts

A cyclic reduction method for solving algebraic Riccati equations

  • B Iannazzo, D Bini
  • 2003
Highly Influential
4 Excerpts

A probabilistic interpretation of cyclic reduction and its relationships with logarithmic reduction

  • D Bini, B Meini, V Ramaswami
  • 2008
1 Excerpt

A new class of nonsymmetric algebraic Riccati equations

  • C.-H Guo
  • 2007
2 Excerpts