A parallel algorithm for optimal grid generation

MaRDI QIDQ2729338zbMATH OpenFDO

Authors N. A. Artemova, A. F. Khajrullin, O. B. Khajrullina

Publication date 22 July 2001

Published in Vychislitel'nye Tekhnologii (Search for Journal in Brave)

Full work available at URL http://www-sbras.nsc.ru/win/mathpub/comp-tech/eng

zbMATH Keywords

grid generationiterative algorithmoptimal algorithmparallelizationtwo-dimensional block regular grid

Mathematics Subject Classification ID

Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Review text

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.

Recommendations

• Automatic parallel generation of tetrahedral grids by using a domain decomposition approach
• Parallel grid generation/optimization using block-domain decomposition
• A parallel advancing front grid generation scheme
• Three‐dimensional parallel unstructured grid generation
• Generic parallel adaptive-grid Navier-Stokes algorithm

Cited in

(13)

• A scheme for generating unstructured grids on spheres with application to parallel computation
• A generalized length strategy for direct optimization in planar grid generation
• Massively parallel grid generation on HPC systems
• A practical guide to direct optimization for planar grid-generation
• On the generation of bipartite grids in 2 and 3 dimensional regions
• A Greedy Strategy for Coarse-Grid Selection
• On Nonconservative Algorithms for Grid Interfaces
• scientific article; zbMATH DE number 1822177 (Why is no real title available?)
• scientific article; zbMATH DE number 820536 (Why is no real title available?)
• scientific article; zbMATH DE number 2226864 (Why is no real title available?)
• Computational Science – ICCS 2005
• Optimised grid-partitioning for block structured grids in parallel computation
• A new grid-associated algorithm in the distributed hydrological model simulations

This page was built for publication: A parallel algorithm for optimal grid generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2729338)