Domain Decomposition Approach for Automatic Parallel Generation of 3D Unstructured Grids

Domain Decomposition Approach for Automatic Parallel Generation of 3D Unstructured Grids

Ivanov, E.G.
Andrä, H.
Kudryavtsev, A.N.

2006-09-06

The desire to simulate more and more geometrical and physical features of technical structures and the availability of parallel computers and parallel numerical solvers which can exploit the power of these machines have lead to a steady increase in the number of grid elements used. Memory requirements and computational time are too large for usual serial PCs. An a priori partitioning algorithm for the parallel generation of 3D nonoverlapping compatible unstructured meshes based on a CAD surface description is presented in this paper. Emphasis is given to practical issues and implementation rather than to theoretical complexity. To achieve robustness of the algorithm with respect to the geometrical shape of the structure authors propose to have several or many but relatively simple algorithmic steps. The geometrical domain decomposition approach has been applied. It allows us to use classic 2D and 3D high-quality Delaunay mesh generators for independent and simultaneous volume meshing. Different aspects of load balancing methods are also explored in the paper. The MPI library and SPMD model are used for parallel grid generator implementation. Several 3D examples are shown.

grid generation
unstructured grid
Delaunay triangulation
parallel programming
domain decomposition
load balancing

http://resolver.tudelft.nl/uuid:076b639d-2296-4d4e-91e7-ac7069951eed

Conference proceedings

conference paper

(c) 2006 Ivanov, E.G.; Andrä, H.; Kudryavtsev, A.N.