A comparison of element agglomeration algorithms for unstructured geometric multigrid

From MaRDI portal
Publication:2226318

DOI10.1016/J.CAM.2020.113379zbMATH Open1458.76064arXiv2005.09104OpenAlexW3119215677MaRDI QIDQ2226318FDOQ2226318


Authors: S. Dargaville, A. G. Buchan, Richard P. Smedley-Stevenson, Paul N. Smith, C. C. Pain Edit this on Wikidata


Publication date: 12 February 2021

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/2005.09104




Recommendations




Cites Work


Cited In (2)

Uses Software





This page was built for publication: A comparison of element agglomeration algorithms for unstructured geometric multigrid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2226318)