Abstract

In a recent work by the author [Linear Algebra Appl. 298 (1999) 99] Krylov subspace methods were derived for Drazin-inverse solution of consistent or inconsistent linear systems of the form Ax=b, where A∈ C N×N is a singular and in general non-hermitian matrix that has arbitrary index. One of these methods, modeled after the Generalized Conjugate Residual method (GCR) and denoted DGCR, is considered in the present work again. It is shown that all of the approximations produced by DGCR exist, and a GMRES like algorithm, denoted DGMRES, for its implementation is derived. Like GMRES, DGMRES too is economical computationally and storagewise.

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