GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
SIAM Journal on Scientific and Statistical Computing
ACM Transactions on Mathematical Software (TOMS)
A Restarted GMRES Method Augmented with Eigenvectors
SIAM Journal on Matrix Analysis and Applications
Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
SIAM Journal on Matrix Analysis and Applications
Matrix computations (3rd ed.)
Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
SIAM Journal on Matrix Analysis and Applications
GMRES with Deflated Restarting
SIAM Journal on Scientific Computing
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Restarted simpler GMRES augmented with harmonic Ritz vectors
Future Generation Computer Systems - Special issue: Selected numerical algorithms
How to Make Simpler GMRES and GCR More Stable
SIAM Journal on Matrix Analysis and Applications
Hi-index | 0.00 |
In this paper we consider the simpler GMRES method augmented by approximate eigenvectors for solving nonsymmetric linear systems. We modify the augmented restarted simpler GMRES proposed by Boojhawon and Bhuruth to obtain a simpler GMRES with deflated restarting. Moreover, we also propose a residual-based simpler GMRES with deflated restarting, which is numerically more stable. The main advantage over the augmented version is that the simpler GMRES with deflated restarting requires less matrix-vector products per restart cycle. Some details of implementation are also considered. Numerical experiments show that the residual-based simpler GMRES with deflated restarting is effective.