Abstract
We consider different parallel versions of the least squares methods in the Krylov subspaces which are based on computing various basis vectors. These algorithms are used for solving very large real, non-symmetric, in gerenal, sparse systems of linear algebraic equations (SLAEs) which arise in grid approximations of multi-dimensional boundary value problems. In particular, the Chebyshev acceleration approach, steepest descent and minimal residual, conjugate gradient and conjugate residual are applied as preliminary iterative processes. The resulting minimization of residuals is provided by the block, or implicit, orthogonalization procedures. The properties of the Krylov approaches proposed are analysed in the “pure form”, i.e. without preconditioning. The main criteria of parallelezation are estimated. The convergence rate and stability of the algorithms are demonstated on the results of numerical experiments for the model SLAEs which present the exponential fitting approximation of diffusion-convection equations on the meshes with various steps and with different coefficients.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Saad, Y.: Iterative Methods for Sparse Linear Systems. PWS Publ., New York (2002)
Il’in, V.P.: Problems of parallel solution of large systems of linear algebraic equations. J. Mathem. Sci. 216(6), 795–804 (2016)
Pratara, P.P., Suryanarayana, P., Pask, J.E.: 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)
Anderson, D.G.: Itaerative procedures for nonlinear integral equations. J. Assoc. Comput. Mach 12, 547–560 (1965)
Il’in, V.P.: Methods and Technologies of Finite Elements. ICM&MG SB RAS Publ., Novosibirsk (2007). (in Russian)
Il’in, V.P.: Methods of semiconjugate directions. Russ. J. Numer. Anal. Math. Model. 23(4), 369–387 (2008)
Lawson, C.L., Hanson, R.Z.: Solving Least Squares Problems. Prentice-Hall Inc., Englewood Cliffs (1974)
Samarskii, A.A., Nikolaev, E.S.: Mehtod for Solving Grid Equations. Nauka, Moscow (1978)
Montgomery, P.L.: A block Lanczos algorithm for finding dependencies over GF(2). In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 106–120. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-49264-X_9
Zamarashkin, N., Zheltkov, D.: Block Lanczos–Montgomery method with reduced data exchanges. In: Voevodin, V., Sobolev, S. (eds.) RuSCDays 2016. CCIS, vol. 687, pp. 15–26. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-55669-7_2
Gurieva, Y.L., Il’in, V.P.: Parallel approaches and technologies of domain decomposition methods. J. Math. Sci. 207(5), 724–735 (2015)
Il’in, V.P.: On exponential finite volume approximations. Rus. J. Num. Anal. Math. Model. 18(6), 479–506 (2003)
Intel®Mathematical Kernel Library from Intel. http://www.software.intel.com/en-us/intel-mkl
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Il’in, V.P. (2017). On the Parallel Least Square Approaches in the Krylov Subspaces. In: Voevodin, V., Sobolev, S. (eds) Supercomputing. RuSCDays 2017. Communications in Computer and Information Science, vol 793. Springer, Cham. https://doi.org/10.1007/978-3-319-71255-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-71255-0_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-71254-3
Online ISBN: 978-3-319-71255-0
eBook Packages: Computer ScienceComputer Science (R0)