# zbMATH — the first resource for mathematics

Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations. (English) Zbl 1420.65040
Summary: The solution of a large-scale Sylvester matrix equation plays an important role in control and large scientific computations. In this paper, we are interested in the large Sylvester matrix equation with large dimension $$A$$ and small dimension $$B$$, and a popular approach is to use the global Krylov subspace method. In this paper, we propose three new algorithms for this problem. We first consider the global GMRES algorithm with weighting strategy, which can be viewed as a precondition method. We present three new schemes to update the weighting matrix during iterations. Due to the growth of memory requirements and computational cost, it is necessary to restart the algorithm effectively. The deflation strategy is efficient for the solution of large linear systems and large eigenvalue problems; to the best of our knowledge, little work is done on applying deflation to the (weighted) global GMRES algorithm for large Sylvester matrix equations. We then consider how to combine the weighting strategy with deflated restarting, and propose a weighted global GMRES algorithm with deflation for solving large Sylvester matrix equations. In particular, we are interested in the global GMRES algorithm with deflation, which can be viewed as a special case when the weighted matrix is chosen as the identity. Theoretical analysis is given to show rationality of the new algorithms. Numerical experiments illustrate the numerical behavior of the proposed algorithms.
##### MSC:
 65F10 Iterative numerical methods for linear systems 65F15 Numerical computation of eigenvalues and eigenvectors of matrices 15A24 Matrix equations and identities 65F30 Other matrix algorithms (MSC2010)
##### Software:
Algorithm 432; eigs; IRAM; SparseMatrix
Full Text: