Solving shifted linear systems with restarted GMRES augmented with error approximations

In this paper, we investigate a variant of the restarted GMRES method for solving a series of large sparse linear systems. Restarting is carried out by augmenting Krylov subspaces with some recently generated error approximations from the seed system. The method can preserve a nice property that all...

Full description

Saved in:
Bibliographic Details
Published in:Computers & mathematics with applications (1987) 2019-09, Vol.78 (6), p.1910-1918
Main Authors: Wang, Rui-Rui, Niu, Qiang, Tang, Xiao-Bin, Wang, Xiang
Format: Article
Language:English
Subjects:
Acceleration
Added linear systems
Error analysis
Iterative methods
Krylov subspace methods
Linear systems
Mathematical analysis
Matrix algebra
Matrix methods
Multiplication
Restarted GMRES
Restarting
Subspaces
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we investigate a variant of the restarted GMRES method for solving a series of large sparse linear systems. Restarting is carried out by augmenting Krylov subspaces with some recently generated error approximations from the seed system. The method can preserve a nice property that allows solving the seed and the added linear systems at the cost of only one matrix–vector multiplication per iteration. Compared with solving each added linear system separately, the advantage of the new scheme is to lower down the overall cost of solving all added linear systems. Numerical experiments illustrate the efficiency of the acceleration strategy.
ISSN:0898-1221
1873-7668
DOI:10.1016/j.camwa.2019.03.037