RUS  ENG
Full version
JOURNALS // Sibirskii Zhurnal Vychislitel'noi Matematiki // Archive

Sib. Zh. Vychisl. Mat., 2016 Volume 19, Number 2, Pages 183–194 (Mi sjvm611)

This article is cited in 6 papers

Parallel algorithms and domain decomposition technologies for solving three-dimensional boundary value problems on quasi-structured grids

V. D. Korneevab, V. M. Sveshnikovab

a Institute of Computational Mathematics and Mathematical Geophysics SB RAS, 6 Lavrentiev pr., Novosibirsk, 630090, Russia
b Novosibirsk State University, 2 Pirogova str., Novosibirsk, 630090, Russia

Abstract: A new approach to the decomposition method of a three-dimensional computational domain into subdomains, adjoint without overlapping, which is based on a direct approximation of the Poincare-Steklov equation at the conjugation interface, is proposed. With the use of this approach, parallel algorithms and technologies for three-dimensional boundary value problems on quasi-structured grids are presented. The experimental evaluation of the parallelization efficiency on the solution of the model problem on quasi-structured parallelepipedal coordinated and uncoordinated grids is given.

Key words: boundary value problems, domain decomposition methods, Poincare-Steklov equation, quasistructured grids, algorithms and technologies of parallelization.

UDC: 519.63

Received: 08.04.2015

DOI: 10.15372/SJNM20160205


 English version:
Numerical Analysis and Applications, 2016, 9:2, 141–149

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026