Abstract
In this paper, two efficient iterative algorithms based on the Simpler GMRES method are proposed for solving shifted linear systems. To make full use of the shifted structure, the proposed algorithms utilizing the deflated restarting strategy and flexible preconditioning can significantly reduce the number of matrix vector products and the elapsed CPU time. Numerical experiments are reported to illustrate the performance and effectiveness of the proposed algorithms. (C) 2019 Elsevier Ltd. All rights reserved.
Original language | English |
---|---|
Pages (from-to) | 997-1007 |
Number of pages | 11 |
Journal | Computers & Mathematics with Applications |
Volume | 78 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1-Aug-2019 |
Keywords
- Shifted linear system
- Adaptive Simpler GMRES
- Flexible preconditioning
- Deflated restarting
- BLOCK-GMRES
- ALGORITHM
- FAMILIES