BIT Numerical Mathematics

, Volume 56, Issue 1, pp 77–97 | Cite as

On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems

Article

Abstract

This paper addresses the convergence behavior of Krylov methods for nonsymmetric linear systems which can be classified as quasi-orthogonal (Q-OR) or quasi-minimum residual (Q-MR) methods. It explores, more precisely, whether the influence of eigenvalues is the same when using non-orthonormal bases as it is for the FOM and GMRES methods. It presents parametrizations of the classes of matrices with a given spectrum and right-hand sides generating prescribed Q-OR/Q-MR (quasi) residual norms and discusses non-admissible residual norm sequences. It also gives closed-form expressions of the Q-OR/Q-MR (quasi) residual norms as functions of the eigenvalues and eigenvectors of the matrix of the linear system.

Keywords

Krylov method Q-OR method Q-MR method BiCG   QMR CMRH Eigenvalue influence Prescribed convergence 

Mathematics Subject Classification

65F10 

References

  1. 1.
    Arioli, M., Pták, V., Strakoš, Z.: Krylov sequences of maximal length and convergence of GMRES. BIT 38(4), 636–643 (1998)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Arnoldi, W.E.: The principle of minimized iteration in the solution of the matrix eigenvalue problem. Q. Appl. Math. 9, 17–29 (1951)MathSciNetMATHGoogle Scholar
  3. 3.
    Brown, P.N.: A theoretical comparison of the Arnoldi and GMRES algorithms. SIAM J. Sci. Stat. Comput. 12(1), 58–78 (1991)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Brown, P.N., Hindmarsh, A.C.: Reduced storage matrix methods in stiff ODE systems. Appl. Math. Comput. 31, 40–91 (1989)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Choi, S.-C.T., Paige, C.C., Saunders, M.A.: MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems. SIAM J. Sci. Comput. 33(4), 1810–1836 (2011)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Cullum, J.: Iterative methods for solving \(Ax=b\), GMRES/FOM versus QMR/BiCG. Adv. Comput. Math. 6, 1–24 (1996)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Cullum, J., Greenbaum, A.: Relations between Galerkin and norm-minimizing iterative methods for solving linear systems. SIAM J. Matrix Anal. Appl. 17(2), 223–247 (1996)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Duintjer Tebbens, J., Meurant, G.: Any Ritz value behavior is possible for Arnoldi and for GMRES. SIAM J. Matrix Anal. Appl. 33(3), 958–978 (2012)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Duintjer Tebbens, J., Meurant, G.: Prescribing the behavior of early terminating GMRES and Arnoldi iterations. NumER. Algorithm 65(1), 69–90 (2014)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Duintjer Tebbens, J., Meurant, G.: On the admissible convergence curves for restarted GMRES. submitted (2015)Google Scholar
  11. 11.
    Duintjer Tebbens, J., Meurant, G., Sadok, H., Strakoš, Z.: On investigating GMRES convergence using unitary matrices. Lin. Alg. Appl. 450, 83–107 (2014)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Eiermann, M., Ernst, O.G.: Geometric aspects of the theory of Krylov subspace methods. Acta Numer. 10, 251–312 (2001)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Fletcher, R.: Conjugate gradient methods for indefinite systems. In: Numerical analysis of Proceedings of 6th Biennial Dundee Conference, University of Dundee, Dundee, 1975, Lecture Notes in Mathematics, vol. 506, pp. 73–89. Springer, Berlin (1976)Google Scholar
  14. 14.
    Freund, R.W., Nachtigal, N.M.: QMR: a quasi-minimal residual method for non-Hermitian linear systems. Numer. Math. 60(3), 315–339 (1991)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Freund, R.W., Nachtigal, N.M.: An implementation of the QMR method based on coupled two-term recurrences. SIAM J. Sci. Comput. 15(2), 313–337 (1994)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Freund, R.W., Nachtigal, N.M.: Software for simplified Lanczos and QMR algorithms. Appl. Numer. Math. 19(3), 319–341 (1995)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Greenbaum, A.: Iterative Methods for Solving Linear Systems, vol. 17 of Frontiers in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (1997)Google Scholar
  18. 18.
    Greenbaum, A., Pták, V., Strakoš, Z.: Any nonincreasing convergence curve is possible for GMRES. SIAM J. Matrix Anal. Appl. 17(3), 465–469 (1996)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Greenbaum, A., Strakoš, Z.: Matrices that generate the same Krylov residual spaces. In: Golub, G.H., Luskin, M., Greenbaum, A. (eds.) Recent Advances in Iterative Methods, vol. 60 of IMA Vol. Mathematics Application, pp. 95–118. Springer, New York (1994)Google Scholar
  20. 20.
    Heyouni, M., Sadok, H.: On a variable smoothing procedure for Krylov subspace methods. Linear Algebra Appl. 268, 131–149 (1998)MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    Jea, K.C., Young, D.M.: On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems. Linear Algebra Appl. 52(53), 399–417 (1983)MathSciNetCrossRefMATHGoogle Scholar
  22. 22.
    Jia, Z.: On IGMRES: an incomplete generalized minimal residual method for large unsymmetric linear systems. Sci. China Ser. A 41(12), 1278–1288 (1998)MathSciNetCrossRefMATHGoogle Scholar
  23. 23.
    Joubert, W.: Lanczos methods for the solution of nonsymmetric systems of linear equations. SIAM J. Matrix Anal. Appl. 13(3), 926–943 (1992)MathSciNetCrossRefMATHGoogle Scholar
  24. 24.
    Lanczos, C.: Solution of systems of linear equations by minimized iterations. J. Res. Nat. Bur. Stand. 49, 33–53 (1952)MathSciNetCrossRefGoogle Scholar
  25. 25.
    Liesen, J., Strakoš, Z.: Krylov Subspace Methods, Principles and Analysis. Oxford University Press, Oxford (2012)CrossRefMATHGoogle Scholar
  26. 26.
    Meurant, G.: GMRES and the Arioli, Pták, and Strakoš parametrization. BIT 52(3), 687–702 (2012)MathSciNetCrossRefMATHGoogle Scholar
  27. 27.
    Meurant, G., Tebbens, J.D.: The role eigenvalues play in forming GMRES residual norms with non-normal matrices. Numer. Algorithms 68, 143–165 (2015)MathSciNetCrossRefMATHGoogle Scholar
  28. 28.
    Saad, Y.: Krylov subspace methods for solving large unsymmetric linear systems. Math. Comput. 37(155), 105–126 (1981)MathSciNetCrossRefMATHGoogle Scholar
  29. 29.
    Saad, Y.: The Lanczos biorthogonalization algorithm and other oblique projection methods for solving large unsymmetric systems. SIAM J. Numer. Anal. 19(3), 485–506 (1982)MathSciNetCrossRefMATHGoogle Scholar
  30. 30.
    Saad, Y., Schultz, M.H.: GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 7(3), 856–869 (1986)MathSciNetCrossRefMATHGoogle Scholar
  31. 31.
    Sadok, H.: CMRH: a new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm. Numer. Algorithms 20(4), 303–321 (1999)MathSciNetCrossRefMATHGoogle Scholar
  32. 32.
    Sadok, H., Szyld, D.B.: A new look at CMRH and its relation to GMRES. BIT 52(2), 485–501 (2012)MathSciNetCrossRefMATHGoogle Scholar
  33. 33.
    Schweitzer, M.: Any cycle-convergence curve is possible for restarted FOM. Preprint BUW-IMACM 14/19, Bergische Universität Wuppertal (2014)Google Scholar
  34. 34.
    Simoncini, V.: On the convergence of restarted Krylov subspace methods. SIAM J. Matrix Anal. Appl. 22(2), 430–452 (2000)MathSciNetCrossRefMATHGoogle Scholar
  35. 35.
    Simoncini, V., Szyld, D.B.: The effect of non-optimal bases on the convergence of Krylov subspace methods. Numer. Math. 100(4), 711–733 (2005)MathSciNetCrossRefMATHGoogle Scholar
  36. 36.
    Sonneveld, P.: CGS, a fast Lanczos-type solver for nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 10(1), 36–52 (1989)MathSciNetCrossRefMATHGoogle Scholar
  37. 37.
    Tichý, P.: O některých otevřených problémech v krylovovských metodách. PhD thesis (in Czech). Charles University, Prague (2002)Google Scholar
  38. 38.
    van der Vorst, H.A.: Bi-CGSTAB: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 13(2), 631–644 (1992)MathSciNetCrossRefMATHGoogle Scholar
  39. 39.
    van der Vorst, H.A.: Iterative Krylov Methods for Large Linear Systems, vol. 13 of Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press, Cambridge (2003)CrossRefGoogle Scholar
  40. 40.
    Vecharynski, E., Langou, J.: Any admissible cycle-convergence behavior is possible for restarted GMRES at its initial cycles. Numer. Lin. Algebra Appl. 18, 499–511 (2011)MathSciNetCrossRefMATHGoogle Scholar
  41. 41.
    Vinsome, P.K.W.: Orthomin, an iterative method for solving sparse sets of simultaneous linear equations. In Proceedings of the Fourth Symposium on Reservoir Simulation, pp. 149–159. SPE (1976)Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2015

Authors and Affiliations

  1. 1.Institute of Computer ScienceAcademy of Sciences of the Czech RepublicPraha 8Czech Republic
  2. 2.Faculty of Pharmacy in Hradec KrálovéLibeň and Charles University in PragueHradec KrálovéCzech Republic
  3. 3.ParisFrance

Personalised recommendations