A comparison of element agglomeration algorithms for unstructured
geometric multigrid
geometric multigrid
File(s)2005.09104v1.pdf (1.11 MB)
Working paper
Author(s)
Dargaville, S
Buchan, AG
Smedley-Stevenson, RP
Smith, PN
Pain, CC
Type
Working Paper
Abstract
This paper compares the performance of seven different element agglomeration
algorithms on unstructured triangular/tetrahedral meshes when used as part of a
geometric multigrid. Five of these algorithms come from the literature on AMGe
multigrid and mesh partitioning methods. The resulting multigrid schemes are
tested matrix-free on two problems in 2D and 3D taken from radiation transport
applications; one of which is in the diffusion limit. In two dimensions all
coarsening algorithms result in multigrid methods which perform similarly, but
in three dimensions aggressive element agglomeration performed by METIS
produces the shortest runtimes and multigrid setup times.
algorithms on unstructured triangular/tetrahedral meshes when used as part of a
geometric multigrid. Five of these algorithms come from the literature on AMGe
multigrid and mesh partitioning methods. The resulting multigrid schemes are
tested matrix-free on two problems in 2D and 3D taken from radiation transport
applications; one of which is in the diffusion limit. In two dimensions all
coarsening algorithms result in multigrid methods which perform similarly, but
in three dimensions aggressive element agglomeration performed by METIS
produces the shortest runtimes and multigrid setup times.
Date Issued
2020-05-18
Citation
2020
Publisher
arXiv
Copyright Statement
© 2020 The Author(s)
Identifier
http://arxiv.org/abs/2005.09104v1
Subjects
math.NA
math.NA
cs.NA
Publication Status
Published