Least Squares Methods in Krylov Subspaces
- Авторы: Il’in V.1
-
Учреждения:
- Institute of Computational Mathematics and Mathematical Geophysics, SB RAS and Novosibirsk State University
- Выпуск: Том 224, № 6 (2017)
- Страницы: 900-910
- Раздел: Article
- URL: https://journals.rcsi.science/1072-3374/article/view/239713
- DOI: https://doi.org/10.1007/s10958-017-3460-y
- ID: 239713
Цитировать
Аннотация
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.
Об авторах
V. Il’in
Institute of Computational Mathematics and Mathematical Geophysics, SB RAS and Novosibirsk State University
Автор, ответственный за переписку.
Email: ilin@sscc.ru
Россия, Novosibirsk