Skip to main content
Log in

New Algorithms for Solving Singular Linear System

  • Published:
Computational Mathematics and Modeling Aims and scope Submit manuscript

The DFOM method is an iterative method for computing the Drazin-inverse solution of consistent or inconsistent linear systems of the form Ax = b, where A ϵ ℂn × 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 DFOM often stagnates. We show that adding some approximate error vectors or approximate eigenvectors (corresponding to a few of the smallest eigenvalues) to the Krylov subspace can improve the convergence just like the method proposed by R. Morgan in [8]. We derive the implementation of these methods and present some numerical examples to show the advantages of these methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. H. Baker, E. R. Jessup, and T. Manteuffel, “A technique for accelarating the convergence of restarted GMRES,” SIAM J. Matrix Anal. Appl., No. 26, 962–984 (2005).

  2. A. Ben-Israel and T. N. E. Grevile, “Generalized Inverses: Theory and Applications,” Wiley, New York (2003).

    Google Scholar 

  3. P. N. Brown and H. F. Walker, “GMRES on (Nearly) singular systems,” SIAM J. Matrix Anal. Appl., No. 18, 37–51 (1997).

  4. S. L. Campell and C. D. Meyer Jr, Generalized Inverses of Linear Transformations, Pitman, London (1979).

    Google Scholar 

  5. J. J. Climent, M. Neumann, and A. Sidi, “A semi-iterative method for real spectrum singular linear systems with an arbitrary index,” J. Comput. Appl. Math., No. 87, 21–38 (1997).

  6. M. Hanke and M. Hochbruck, “A Chebyshev-like semiiteration for inconsistent linear systems,” Electron. Trans. Numer. Anal., No. 1, 89–103 (1993).

  7. E. F. Kaaschieter, “Preconditioned conjugate gradients for solving singular systems,” J. Comput. Appl. Math., No. 24, 265–275 (1988).

  8. R. Morgan, “A restarted GMRES method augmented with eigenvectors,” SIAM J. Matrix Anal. Appl., No. 16, 1154–1171 (1995).

  9. A. Sidi, “A unified approach to Krylov subspace methods for the Drazin-inverse solution of singular non-symmetric linear systems,” Linear Algebra Appl., No. 298, 99–113 (1999).

  10. A. Sidi, “DGMRES: a GMRES-type algorithm for Drazin-inverse solution of singular nonsymmetric linear systems,” Linear Algebra Appl., No. 335, 189–204 (2001).

  11. J. Zhou and Y. Wei, “DFOM algorithm and error analysis for projection methods for solving singular linear system,” Appl. Math. Comput., No. 157, 313–329 (2004).

  12. J. Zhou and Y. Wei, “Stagnation analysis of DGMRES,” Appl. Math. Comput., No. 151, 27–39 (2004).

  13. J. Zhou and Y.Wei, “The analysis of restart DGMRES for solving singular linear systems,” Appl. Math. Comput., No. 176, 293–301 (2006).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to R. Buzhabadi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Buzhabadi, R. New Algorithms for Solving Singular Linear System. Comput Math Model 29, 71–82 (2018). https://doi.org/10.1007/s10598-018-9389-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10598-018-9389-2

Keywords

Navigation