Iterative and doubling algorithms for Riccati‐type matrix equations: A comparative introduction

From MaRDI portal
Publication:6144046



Abstract: We review a family of algorithms for Lyapunov- and Riccati-type equations which are all related to each other by the idea of emph{doubling}: they construct the iterate Qk=X2k of another naturally-arising fixed-point iteration (Xh) via a sort of repeated squaring. The equations we consider are Stein equations X−A∗XA=Q, Lyapunov equations A∗X+XA+Q=0, discrete-time algebraic Riccati equations X=Q+A∗X(I+GX)−1A, continuous-time algebraic Riccati equations Q+A∗X+XA−XGX=0, palindromic quadratic matrix equations A+QY+A∗Y2=0, and nonlinear matrix equations X+A∗X−1A=Q. We draw comparisons among these algorithms, highlight the connections between them and to other algorithms such as subspace iteration, and discuss open issues in their theory.




Cites work









This page was built for publication: Iterative and doubling algorithms for Riccati‐type matrix equations: A comparative introduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6144046)