A Simpler GMRES

The generalized minimal residual (GMRES) method is widely used for solving very large, nonsymmetric linear systems, particularly those that arise through discretization of continuous mathematical models in science and engineering. By shifting the Arnoldi process to begin with Ar-0 instead of r(0), we obtain simpler Gram-Schmidt and Householder implementations of the GMRES method that do not require upper Hessenberg factorization. The Gram-Schmidt implementation also maintains the residual vector at each iteration, which allows cheaper restarts of GMRES(m) and may otherwise be useful.