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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.