zbMATH — the first resource for mathematics

Domain decomposition approach for automatic parallel generation of tetrahedral grids. (English) Zbl 1094.65017
Summary: The desire to simulate even 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 led to a steady increase in the number of the 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 non-overlapping compatible unstructured meshes based on a CAD surface description is presented in this paper. Emphasis is placed on practical issues and implementation rather than on theoretical complexity. In order to achieve robustness of the algorithm with respect to the geometrical shape of the structure, the authors propose that there should be several or many but relatively simple algorithmic steps.
The geometrical domain decomposition approach is applied. It allows us to use standard 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 given.

65D17 Computer-aided design (modeling of curves and surfaces)
65N55 Multigrid methods; domain decomposition for boundary value problems involving PDEs
65Y05 Parallel numerical computation
65N50 Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs
DeWall; TetGen
Full Text: DOI Link