An extended block Arnoldi algorithm for large-scale solutions of the continuous-time algebraic Riccati equation

We present a new iterative method for the computation of approximate solutions to large-scale continuous-time algebraic Riccati equations. The proposed method is a projection method onto an extended block Krylov subspace, which can be seen as a sum of two block Krylov subspaces in A and [A.sup.-1]....

Full description

Saved in:
Bibliographic Details
Published inElectronic transactions on numerical analysis Vol. 33; p. 53
Main Authors Heyouni, M, Jbilou, K
Format Journal Article
LanguageEnglish
Published Institute of Computational Mathematics 01.08.2008
Subjects
Online AccessGet full text
ISSN1068-9613
1097-4067

Cover

Loading…
More Information
Summary:We present a new iterative method for the computation of approximate solutions to large-scale continuous-time algebraic Riccati equations. The proposed method is a projection method onto an extended block Krylov subspace, which can be seen as a sum of two block Krylov subspaces in A and [A.sup.-1]. We give some theoretical results and present numerical experiments for large and sparse problems. These numerical tests show the efficiency of the proposed scheme as compared to the block Arnoldi and Newton-ADI methods. Key words. Block Arnoldi; Extended block Krylov; Low rank; Riccati equations. AMS subject classifications. 65F10, 65F30
ISSN:1068-9613
1097-4067