A parallel algorithm for optimal grid generation (Q2729338)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A parallel algorithm for optimal grid generation |
scientific article; zbMATH DE number 1622437
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel algorithm for optimal grid generation |
scientific article; zbMATH DE number 1622437 |
Statements
22 July 2001
0 references
grid generation
0 references
optimal algorithm
0 references
parallelization
0 references
two-dimensional block regular grid
0 references
iterative algorithm
0 references
A parallel algorithm for optimal grid generation (English)
0 references
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.
0 references
