Advertisement

Relating Computed and Exact Entities in Methods Based on Lanczos Tridiagonalization

  • Tomáš Gergelits
  • Iveta Hnětynková
  • Marie KubínováEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11087)

Abstract

Krylov subspace methods based on short recurrences such as CGL or MINRES represent an attractive way of solving large and sparse systems of linear algebraic equations. Loss of orthogonality in the underlying Lanczos process delays significantly their convergence in finite-precision computation, whose connection to exact computation is still not fully understood. In this paper, we exploit the idea of simultaneous comparison of finite-precision and exact computations for CGL and MINRES, by taking advantage of their relationship valid also in finite-precision arithmetic. In particular, we show that finite-precision CGL residuals and Lanczos vectors have to be aggregated over the intermediate iterations to form a counterpart to vectors from the exact computation. Influence of stagnation in exact MINRES computation is also discussed. Obtained results are supported by numerical experiments.

Keywords

Krylov subspace CGL MINRES Finite-precision computations Loss of orthogonality Delay of convergence Lanczos vectors 

Notes

Acknowledgment

Research supported by the Grant Agency of Charles University (GAUK 196216) and by the Grant Agency of the Czech Republic (17-04150J).

References

  1. 1.
    Carpraux, J.F., Godunov, S.K., Kuznetsov, S.V.: Condition number of the Krylov bases and subspaces. Linear Algebra Appl. 248, 137–160 (1996)MathSciNetCrossRefGoogle Scholar
  2. 2.
    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)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Duff, I.S., Grimes, R.G., Lewis, J.G.: Users’ guide for the Harwell-Boeing sparse matrix collection (1992)Google Scholar
  4. 4.
    Fong, D.C.L., Saunders, M.A.: CG versus MINRES: an empirical comparison. SQU J. Sci. 17(1), 44–62 (2012)CrossRefGoogle Scholar
  5. 5.
    Gergelits, T.: Analysis of Krylov subspace methods. Master’s thesis, Charles University in Prague (2013)Google Scholar
  6. 6.
    Greenbaum, A.: Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences. Linear Algebra Appl. 113, 7–63 (1989)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Greenbaum, A., Strakoš, Z.: Predicting the behavior of finite precision Lanczos and conjugate gradient computations. SIAM J. Matrix Anal. Appl. 13(1), 121–137 (1992)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Hansen, P.C.: Rank-Deficient and Discrete Ill-Posed Problems. Society for Industrial and Applied Mathematics (1998)Google Scholar
  9. 9.
    Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stand. 49, 409–436 (1952)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Kuznetsov, S.V.: Perturbation bounds of the Krylov bases and associated Hessenberg forms. Linear Algebra Appl. 265, 1–28 (1997)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Lanczos, C.: An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Natl. Bureau Stand. 45, 255–282 (1950)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Liesen, J., Strakoš, Z.: Krylov Subspace Methods: Principles and Analysis. Numerical Mathematics and Scientific Computation. Oxford University Press, Oxford (2013)zbMATHGoogle Scholar
  13. 13.
    Meurant, G., Strakoš, Z.: The Lanczos and conjugate gradient algorithms in finite precision arithmetic. Acta Numerica 15, 471–542 (2006)MathSciNetCrossRefGoogle Scholar
  14. 14.
    O’Leary, D.P., Strakoš, Z., Tichý, P.: On sensitivity of Gauss-Christoffel quadrature. Numer. Math. 107(1), 147–174 (2007)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Paige, C.C.: The computation of eigenvalues and eigenvectors of very large sparse matrices. Ph.D. thesis, London University (1971)Google Scholar
  16. 16.
    Paige, C.C.: Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem. Linear Algebra Appl. 34, 235–258 (1980)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Paige, C.C., Saunders, M.A.: Solutions of sparse indefinite systems of linear equations. SIAM J. Numer. Anal. 12(4), 617–629 (1975)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Paige, C.C.: Error analysis of the Lanczos algorithm for tridiagonalizing a symmetric matrix. IMA J. Appl. Math. 18(3), 341–349 (1976)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Paige, C.C.: An augmented stability result for the Lanczos Hermitian matrix tridiagonalization process. SIAM J. Matrix Anal. Appl. 31(5), 2347–2359 (2010)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Paige, C.C., Van Dooren, P.: Sensitivity analysis of the Lanczos reduction. Numer. Linear Algebra Appl. 6(1), 29–50 (1999)MathSciNetCrossRefGoogle Scholar
  21. 21.
    Parlett, B.N., Scott, D.S.: The Lanczos algorithm with selective orthogonalization. Math. Comput. 33(145), 217–238 (1979)MathSciNetCrossRefGoogle Scholar
  22. 22.
    Simon, H.D.: Analysis of the symmetric Lanczos algorithm with reorthogonalization methods. Linear Algebra Appl. 61, 101–131 (1984)MathSciNetCrossRefGoogle Scholar
  23. 23.
    Strakoš, Z.: On the real convergence rate of the conjugate gradient method. Linear Algebra Appl. 154–156, 535–549 (1991)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Tomáš Gergelits
    • 1
    • 2
  • Iveta Hnětynková
    • 1
  • Marie Kubínová
    • 1
    • 2
    Email author
  1. 1.Faculty of Mathematics and PhysicsCharles UniversityPragueCzech Republic
  2. 2.Institute of Computer ScienceThe Czech Academy of SciencesPragueCzech Republic

Personalised recommendations