Journal of Mathematical Sciences

, Volume 224, Issue 6, pp 900–910 | Cite as

Least Squares Methods in Krylov Subspaces


The paper considers iterative algorithms for solving large systems of linear algebraic equations with sparse nonsymmetric matrices based on solving least squares problems in Krylov subspaces and generalizing the alternating Anderson–Jacobi method. The approaches suggested are compared with the classical Krylov methods, represented by the method of semiconjugate residuals. The efficiency of parallel implementation and speedup are estimated and illustrated with numerical results obtained for a series of linear systems resulting from discretization of convection-diffusion boundary-value problems.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    P. P. Pratara, P. Suryanarayana, and J. E. Pask, “Anderson acceleration of the Jacobi iterative method. An efficient alternative to Krylov methods for large, sparse linear systems,” J. Comput. Phys., 306, 43–54 (2016).MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Y. Saad. Iterative Methods for Sparse Linear Systems, PWS Publ, New York (2002).Google Scholar
  3. 3.
    V. P. Il’in, “Problems of parallel solution of large systems of linear algebraic equations,” Zap. Nauchn. Semin. POMI, 439, 112–127 (2015).Google Scholar
  4. 4.
    D. G. Anderson, “Iterative procedures for nonlinear integral equations,” J. Assoc. Comput. Mach., 12, 547–560 (1965).MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    V. P. Il’in, “Methods of semiconjugate directions,” Russ. J. Numer. Anal. Math. Model., 23, No. 4, 369–387 (2008).MathSciNetMATHGoogle Scholar
  6. 6.
    C. L. Lawson and R. Z Hanson, Solving Least Squares Problems [Russian translation], Nauka, Moscow (1986).Google Scholar
  7. 7.
    A. A. Samarskii and E. S. Nikolaev, Methods for Solving Grid Equations [in Russian], Nauka, Moscow (1978).Google Scholar
  8. 8.
    D. P. O’Leary, “Yet another polynomial preconditioner for the conjugate gradient algorithm,” Linear Algebra Appl., 154, 377–388 (1991).MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    P. L. Montgomery, “A block Lonczos algorithm for finding dependences over GF(2),” Advances in Cryptology, EUROCRYPT 95 (Lect. Notes Comp. Sci., 921), Springer–Verlag (1995), pp. 106–120.Google Scholar
  10. 10.
    Y. L. Gurieva and V. P. Il’in, “Some parallel methods and technologies of domain decomposition,” Zap. Nauchn. Semin. POMI, 428, 89–106 (2014).MATHGoogle Scholar
  11. 11.
    V. P. Il’in, “On exponential finite volume approximations,” Russ. J. Numer Anal. Math. Model., 18, No. 6, 479–506 (2003).MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Intel Mathematical Kernel Library from Intel

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.Institute of Computational Mathematics and Mathematical GeophysicsSB RAS and Novosibirsk State UniversityNovosibirskRussia

Personalised recommendations