GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
SIAM Journal on Scientific and Statistical Computing
Implementation of the GMRES method using householder transformations
SIAM Journal on Scientific and Statistical Computing - Telecommunication Programs at U.S. Universities
CGS, a fast Lanczos-type solver for nonsymmetric linear systems
SIAM Journal on Scientific and Statistical Computing
A theoretical comparison of the Arnoldi and GMRES algorithms
SIAM Journal on Scientific and Statistical Computing
SIAM Journal on Scientific and Statistical Computing
A flexible inner-outer preconditioned GMRES algorithm
SIAM Journal on Scientific Computing
A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems
SIAM Journal on Scientific Computing
A Restarted GMRES Method Augmented with Eigenvectors
SIAM Journal on Matrix Analysis and Applications
New insights in GMRES-like methods with variable preconditioners
Journal of Computational and Applied Mathematics
GMRES On (Nearly) Singular Systems
SIAM Journal on Matrix Analysis and Applications
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
ACM Transactions on Mathematical Software (TOMS)
Iterative methods for large, sparse, nonsymmetric systems of linear equations
Iterative methods for large, sparse, nonsymmetric systems of linear equations
A look-ahead variant of the lanczos algorithm and its application to the quasi-minimal residual method for non-hermitian linear systems
GMRES implementations and residual smoothing techniques for solving ill-posed linear systems
Computers & Mathematics with Applications
| Hi-index | 7.29 |
For the popular iterative method GMRES, we present a new and simple implementation which has the property of not using Givens rotations. This implementation does not modify the Arnoldi process and has an advantage in both the computational effort and the storage requirements. The corresponding restarted GMRES method is also considered.