Skip to main content
SpringerLink
Log in

Least Squares Methods in Krylov Subspaces

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

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.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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).

    Article  MathSciNet  MATH  Google Scholar 

  2. Y. Saad. Iterative Methods for Sparse Linear Systems, PWS Publ, New York (2002).

    Google Scholar 

  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. D. G. Anderson, “Iterative procedures for nonlinear integral equations,” J. Assoc. Comput. Mach., 12, 547–560 (1965).

    Article  MathSciNet  MATH  Google Scholar 

  5. V. P. Il’in, “Methods of semiconjugate directions,” Russ. J. Numer. Anal. Math. Model., 23, No. 4, 369–387 (2008).

    MathSciNet  MATH  Google Scholar 

  6. C. L. Lawson and R. Z Hanson, Solving Least Squares Problems [Russian translation], Nauka, Moscow (1986).

    Google Scholar 

  7. A. A. Samarskii and E. S. Nikolaev, Methods for Solving Grid Equations [in Russian], Nauka, Moscow (1978).

    Google Scholar 

  8. D. P. O’Leary, “Yet another polynomial preconditioner for the conjugate gradient algorithm,” Linear Algebra Appl., 154, 377–388 (1991).

    Article  MathSciNet  MATH  Google Scholar 

  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.

  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).

    MATH  Google Scholar 

  11. V. P. Il’in, “On exponential finite volume approximations,” Russ. J. Numer Anal. Math. Model., 18, No. 6, 479–506 (2003).

    Article  MathSciNet  MATH  Google Scholar 

  12. Intel Mathematical Kernel Library from Intel http://software.intel.com/en-us/intel-mkl.

Download references

Author information

Authors and Affiliations

  1. Institute of Computational Mathematics and Mathematical Geophysics, SB RAS and Novosibirsk State University, Novosibirsk, Russia

    V. P. Il’in

Authors
  1. V. P. Il’in
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. P. Il’in.

Additional information

Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 453, 2016, pp. 131–147.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Il’in, V.P. Least Squares Methods in Krylov Subspaces. J Math Sci 224, 900–910 (2017). https://doi.org/10.1007/s10958-017-3460-y

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-017-3460-y

Search

Navigation