Multiblock multigrid grid generation algorithms: Overcoming multigrid anisotropy (Q1368929)
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: Multiblock multigrid grid generation algorithms: Overcoming multigrid anisotropy |
scientific article; zbMATH DE number 1071581
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multiblock multigrid grid generation algorithms: Overcoming multigrid anisotropy |
scientific article; zbMATH DE number 1071581 |
Statements
Multiblock multigrid grid generation algorithms: Overcoming multigrid anisotropy (English)
0 references
3 February 1998
0 references
Multiblock multigrid algorithms for the generation of boundary-fitted grids (BFGs) are presented which avoid undesired multigrid anisotropy. The algorithms combine a domain decomposition technique, the elliptic grid generation and the multigrid computation to provide fast convergence. Anisotropy is identified as an undesirable multigrid effect and is overcome by investigation over coefficients of the generating systems. They can provide information to select appropriate relaxation algorithms. Visualizations of 2D and 3D computed grids and displays of convergence histories are shown.
0 references
multiblock multigrid grid generation algorithms
0 references
multigrid anisotropy
0 references
domain decomposition
0 references
relaxation algorithms
0 references
convergence
0 references
0 references
0 references