Least Squares Methods in Krylov Subspaces
- 37 Downloads
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.
- 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
- 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
- 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
- 12.Intel Mathematical Kernel Library from Intel http://software.intel.com/en-us/intel-mkl.