Abstract
The DGMRES method is an iterative method for computing the Drazin-inverse solution of consistent or inconsistent linear systems of the form Ax=b, where A∈Cn×n is a singular and in general non-Hermitian matrix that has an arbitrary index. This method is generally used with restarting. But the restarting often slows down the convergence and DGMRES often stagnates. Based on the LGMRES and GMRES-E methods, we present two new techniques for accelerating the convergence of restarted DGMRES by adding some approximate error vectors or approximate eigenvectors (corresponding to a few of the smallest eigenvalues) to the Krylov subspace. We derive the implementation of these methods and present some numerical examples to show the advantages of these methods.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
