Parallel Algorithms and Domain Decomposition Techniques for Solving Three-Dimensional Boundary Value Problems on Quasi-Structured Grids

摘要

A new approach to the decomposition of a three-dimensional computational domain into subdomains matched without overlapping is proposed. It is based on direct approximation of the Poincare–Steklov equation at the interface. Parallel algorithms and techniques for solving threedimensional boundary value problems on quasi-structured grids are presented. Experimental evaluation of parallel efficiency is done by solving a model problem with quasi-structured parallelepipedal matching and non-matching grids as an example.