|
Zapiski Nauchnykh Seminarov POMI, 2015, Volume 439, Pages 112–127
(Mi znsl6205)
|
|
|
|
This article is cited in 24 scientific papers (total in 24 papers)
Problems of parallel solution of large systems of linear algebraic equations
V. P. Il'inab a Institute of Computational Mathematics and Mathematical Geophysics of Siberian Branch of Russian Academy of Sciences, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Abstract:
The paper considers some modern problems arising in developing parallel algorithms for solving large systems of linear algebraic equations with sparse matrices occurring in mathematical modeling of real-life processes and phenomena on a multiprocessor computer system (MCS). Two main requirements to methods and technologies under consideration are fast convergence of iterations and scalable parallelism, which are intrinsically contradictory and need a special investigation. The paper analyzes main trends is developing preconditioned iterative methods in Krylov's subspaces based on algebraic domain decomposition and principles of their program implementation on a geterogeneous MCS with hierarchical memory structure.
Key words and phrases:
system of linear algebraic equation, sparse matrix, iterative algorithm, preconditioning, Krylov subspaces, scalable parallelism, supercomputer, program library, component technologies.
Received: 23.10.2015
Citation:
V. P. Il'in, “Problems of parallel solution of large systems of linear algebraic equations”, Computational methods and algorithms. Part XXVIII, Zap. Nauchn. Sem. POMI, 439, POMI, St. Petersburg, 2015, 112–127; J. Math. Sci. (N. Y.), 216:6 (2016), 795–804
Linking options:
https://www.mathnet.ru/eng/znsl6205 https://www.mathnet.ru/eng/znsl/v439/p112
|
|