A fast implementation for GMRES method

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.