In this paper, a new method based on the generalized Purcell method is proposed to solve the usual least-squares problem arising in the GMRES method. The theoretical aspects and computational results of the method are provided. For the popular iterative method GMRES, the decomposition matrices of the Hessenberg matrix is obtained by using a simple recursive relation instead of Givens rotations. The other advantages of the proposed method are low computational cost and no need for orthogonal decomposition of the Hessenberg matrix or pivoting. The comparisons for ill-conditioned sparse standard matrices are made. They show a good agreement with available literature.
Rahmani, Morteza and Momeni-Masuleh, Sayed H.
A New Implementation of GMRES Using Generalized Purcell Method,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 8,
1, Article 15.
Available at: https://digitalcommons.pvamu.edu/aam/vol8/iss1/15