A new subspace iteration method for the algebraic Riccati equation.

From MaRDI portal
Publication:2948089

DOI10.1002/NLA.1936zbMATH Open1363.65076arXiv1307.3843OpenAlexW2137362177MaRDI QIDQ2948089FDOQ2948089


Authors: Yiding Lin, Valeria Simoncini Edit this on Wikidata


Publication date: 29 September 2015

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Abstract: We consider the numerical solution of the continuous algebraic Riccati equation AX+XAXFX+G=0, with F=F,G=G of low rank and A large and sparse. We develop an algorithm for the low rank approximation of X by means of an invariant subspace iteration on a function of the associated Hamiltonian matrix. We show that the sought after approximation can be obtained by a low rank update, in the style of the well known ADI iteration for the linear equation, from which the new method inherits many algebraic properties. Moreover, we establish new insightful matrix relations with emerging projection-type methods, which will help increase our understanding of this latter class of solution strategies.


Full work available at URL: https://arxiv.org/abs/1307.3843




Recommendations




Cites Work


Cited In (32)

Uses Software





This page was built for publication: A new subspace iteration method for the algebraic Riccati equation.

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