On some extended block Krylov based methods for large scale nonsymmetric Stein matrix equations (Q2359587): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: SparseMatrix / rank | |||
Normal rank |
Revision as of 04:07, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On some extended block Krylov based methods for large scale nonsymmetric Stein matrix equations |
scientific article |
Statements
On some extended block Krylov based methods for large scale nonsymmetric Stein matrix equations (English)
0 references
22 June 2017
0 references
Summary: In the present paper, we consider the large scale Stein matrix equation with a low-rank constant term \(AXB-X+EF^T=0\). These matrix equations appear in many applications in discrete-time control problems, filtering and image restoration and others. The proposed methods are based on projection onto the extended block Krylov subspace with a Galerkin approach (GA) or with the minimization of the norm of the residual. We give some results on the residual and error norms and report some numerical experiments.
0 references
extended block Krylov subspaces
0 references
low-rank approximation
0 references
Stein matrix equation
0 references
Galerkin approach (GA)
0 references
minimal residual (MR) methods
0 references