Some observations on weighted GMRES

Citation data:

Numerical Algorithms, ISSN: 1017-1398, Vol: 67, Issue: 4, Page: 733-752

Publication Year:
2014
Usage 19
Abstract Views 19
Captures 9
Readers 8
Exports-Saves 1
Citations 5
Citation Indexes 5
Repository URL:
http://hdl.handle.net/10754/599675
DOI:
10.1007/s11075-013-9820-x
Author(s):
Güttel, Stefan; Pestana, Jennifer
Publisher(s):
Springer Nature
Tags:
Mathematics; Harmonic Ritz values; Krylov subspace method; Linear systems; Weighted GMRES
article description
We investigate the convergence of the weighted GMRES method for solving linear systems. Two different weighting variants are compared with unweighted GMRES for three model problems, giving a phenomenological explanation of cases where weighting improves convergence, and a case where weighting has no effect on the convergence. We also present a new alternative implementation of the weighted Arnoldi algorithm which under known circumstances will be favourable in terms of computational complexity. These implementations of weighted GMRES are compared for a large number of examples. We find that weighted GMRES may outperform unweighted GMRES for some problems, but more often this method is not competitive with other Krylov subspace methods like GMRES with deflated restarting or BICGSTAB, in particular when a preconditioner is used.