Block Krylov Subspace Methods for Solving Large Sylvester Equations
- Cite this article as:
- El Guennouni, A., Jbilou, K. & Riquet, A. Numerical Algorithms (2002) 29: 75. doi:10.1023/A:1014807923223
- 250 Downloads
In the present paper, we propose block Krylov subspace methods for solving the Sylvester matrix equation AX−XB=C. We first consider the case when A is large and B is of small size. We use block Krylov subspace methods such as the block Arnoldi and the block Lanczos algorithms to compute approximations to the solution of the Sylvester matrix equation. When both matrices are large and the right-hand side matrix is of small rank, we will show how to extract low-rank approximations. We give some theoretical results such as perturbation results and bounds of the norm of the error. Numerical experiments will also be given to show the effectiveness of these block methods.