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.
|Publication status||Published - 1998|
|Event||36th AIAA Aerospace Sciences Meeting and Exhibit, 1998 - Reno, United States|
Duration: 1998 Jan 12 → 1998 Jan 15
|Other||36th AIAA Aerospace Sciences Meeting and Exhibit, 1998|
|Period||98/1/12 → 98/1/15|
ASJC Scopus subject areas
- Space and Planetary Science