Low Rank Approximate Solutions to the Large Sylvester Matrix Equations by the Block GMRES-Like Iterative Method

In the present paper, we propose a block GMRES-like iterative method for solving large and sparse Sylvester matrix equations with low rank right hand sides. We will show how to extract low-rank approximations via a block Krylov subspace method. We give some theoretical results. Numerical experiments will also be given to show the effectiveness of the proposed method.

کلیدواژه ها:

Arnoldi ، Block Krylov subspaces ، Low rank approximations ، Sylvester equation ، Batch reconstruction ، Filtering ، Image processing