Least Squares Methods in Krylov Subspaces
- Authors: Il’in V.P.1
-
Affiliations:
- Institute of Computational Mathematics and Mathematical Geophysics, SB RAS and Novosibirsk State University
- Issue: Vol 224, No 6 (2017)
- Pages: 900-910
- Section: Article
- URL: https://journals.rcsi.science/1072-3374/article/view/239713
- DOI: https://doi.org/10.1007/s10958-017-3460-y
- ID: 239713
Cite item
Abstract
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.
About the authors
V. P. Il’in
Institute of Computational Mathematics and Mathematical Geophysics, SB RAS and Novosibirsk State University
Author for correspondence.
Email: ilin@sscc.ru
Russian Federation, Novosibirsk