On acceleration technologies of parallel decomposition methods
Ya. L. Gur'eva, V. P. Il'in
Institute of Computational Mathematics and Mathematical Geophysics of Siberian Branch of Russian Academy of Sciences, Novosibirsk
One of the main obstacles to the scalable parallelization of the algebraic decomposition methods for solving large sparse systems of linear algebraic equations consists in slowing the convergence rate of the additive iterative Schwarz algorithm in the Krylov subspaces when the number of subdomains increases. The aim of this paper is a comparative experimental analysis of various ways to accelerate the iterations: a parametrized intersection of subdomains, the usage of interface conditions at the boundaries of adjacent subdomains, and the application of a coarse grid correction (aggregation, or reduction) for the original linear system to build an additional preconditioner. The parallelization of algorithms is performed on two levels by programming tools for the distributed and shared memory. The benchmark linear systems under study are formed using the finite difference approximations of the Dirichlet problem for the diffusion-convection equation with various values of the convection coefficients and on a sequence of condensing grids.
domain decomposition, additive Schwarz method, reduction algorithms, preconditioned Krylov processes, scalable parallelization, distributed and shared memory, numerical experiments.
PDF file (558 kB)
Ya. L. Gur'eva, V. P. Il'in, “On acceleration technologies of parallel decomposition methods”, Num. Meth. Prog., 16:1 (2015), 146–154
Citation in format AMSBIB
\by Ya.~L.~Gur'eva, V.~P.~Il'in
\paper On acceleration technologies of parallel decomposition methods
\jour Num. Meth. Prog.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|