RUS  ENG
Full version
JOURNALS // Numerical methods and programming // Archive

Num. Meth. Prog., 2016 Volume 17, Issue 2, Pages 132–146 (Mi vmp822)

Algebraic-geometric and information structures of domain decomposition methods

Ya. L. Gur'eva, V. P. Il'in, D. V. Perevozkin

Institute of Computational Mathematics and Mathematical Geophysics of Siberian Branch of Russian Academy of Sciences, Novosibirsk

Abstract: Algebraic, geometric, and informational aspects of parallel decomposition methods are considered to solve large systems of linear equations with sparse matrices arising after approximation of multidimensional boundary value problems on unstructured grids. Algorithms are based on partitioning a grid computational domain into its subdomains with a parameterized value of overlapping and various interface conditions on the adjacent boundaries. Some questions arising in algebraic decomposition of the original matrix are discussed. Various two-level iterative processes are used. They include both preconditioned Krylov methods with a coarse grid correction and the parallel solution of auxiliary subsystems in subdomains by direct or iterative algorithms. Parallelization of algorithms is implemented by means of hybrid programming with separate MPI processes for each subdomain and by multithreaded computations over shared memory in each of the subdomains. Communications between adjacent subdomains are performed on each external iteration via the preliminary creation of some exchange buffers and using non-blocking operations, which makes it possible to combine both the arithmetic operations and data transfer.

Keywords: domain decomposition, large linear systems, sparse matrices, data structures, hybrid programming, parallel programming.

UDC: 519.6; 519.67; 519.683

Received: 25.03.2016



© Steklov Math. Inst. of RAS, 2024