Block Arnoldi-based methods for large scale discrete-time algebraic Riccati equations

https://doi.org/10.1016/j.cam.2011.09.017Get rights and content
Under an Elsevier user license
open archive

Abstract

In the present paper, we present block Arnoldi-based methods for the computation of low rank approximate solutions of large discrete-time algebraic Riccati equations (DARE). The proposed methods are projection methods onto block or extended block Krylov subspaces. We give new upper bounds for the norm of the error obtained by applying these block Arnoldi-based processes. We also introduce the Newton method combined with the block Arnoldi algorithm and present some numerical experiments with comparisons between these methods.

Keywords

Block Arnoldi
Block Krylov
Discrete Riccati equations
Extended
Low rank
Newton

Cited by (0)