Abstract

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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call