Abstract
A new agglomeration algorithm to generate coarse grids for multigrid methods on unstructured and hybrid grids is proposed in this paper. The algorithm, which we call a global coarsening algorithm, is based on the edge coloring of the grids so that it can agglomerate any type of grids. The agglomeration procedure is automatic and generates a globally optimum shape in contrast to the conventional greedy-type frontal algorithm. The method is applied to compute the 2D/3D Euler and 2D Navier-Stokes equations on triangular, tetrahedral and hybrid meshes, respectively. The present agglomeration multigrid method shows better convergence than the existing method owing to the better quality of the coarse grids.
| Original language | English |
|---|---|
| DOIs | |
| Publication status | Published - 1998 |
| Event | 36th AIAA Aerospace Sciences Meeting and Exhibit, 1998 - Reno, United States Duration: 1998 Jan 12 → 1998 Jan 15 |
Other
| Other | 36th AIAA Aerospace Sciences Meeting and Exhibit, 1998 |
|---|---|
| Country | United States |
| City | Reno |
| Period | 98/1/12 → 98/1/15 |
ASJC Scopus subject areas
- Engineering(all)
- Space and Planetary Science
Fingerprint Dive into the research topics of 'A coarse grid generation algorithm for agglomeration multigrid method on unstructured grids'. Together they form a unique fingerprint.
Cite this
Okamoto, N., Nakahashit, K., & Obayashi, S. (1998). A coarse grid generation algorithm for agglomeration multigrid method on unstructured grids. Paper presented at 36th AIAA Aerospace Sciences Meeting and Exhibit, 1998, Reno, United States. https://doi.org/10.2514/6.1998-615