On the convergence rate of DGMRES

The DGMRES algorithm was designed to compute the Drazin inverse solution of consistent or inconsistent linear systems Ax=b, where A is a square singular matrix with arbitrary index. In this paper we compare the convergence rate of DGMRES with that of GMRES applied to the nonsingular part of A.