A flexible and adaptive Simpler GMRES with deflated restarting for shifted linear systems
arXiv:1707.05588 · doi:10.1016/j.camwa.2019.03.017
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.
arXiv comment17 pages. 9 Tables, 1 figure; Newly update: add some new numerical results and correct some typos and syntax errors
References in corpus (8)
- Krylov space solvers for shifted linear systems
- A framework for deflated and augmented Krylov subspace methods
- Deflated GMRES for Systems with Multiple Shifts and Multiple Right-Hand Sides
- Krylov Subspace Recycling for Sequences of Shifted Linear Systems
- A Flexible Krylov Solver for Shifted Systems with Application to Oscillatory Hydraulic Tomography
- Restarted Hessenberg method for solving shifted nonsymmetric linear systems
- Deflation of Eigenvalues for Iterative Methods in Lattice QCD
- Two recursive GMRES-type methods for shifted linear systems with general preconditioning