A parallel algorithm for optimal grid generation (Q2729338)

The authors expose a parallel algorithm for constructing a block regular grid with a tight packing matrix of the coordinates of nodes for a mesh independent cutting of the domain under consideration into a block structure. These high-quality grids are sufficiently smooth, close to homogeneous grids, and have a large number of nodes. The time necessary for constructing a grid of the required quality becomes a significant part of computation results, especially for analyzing new algorithms adjusted to new hardware. The suggested algorithm is based on a parallelization technique and uses significantly the distributed memory of the parallel computer system MVC.