| JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS | 卷:390 |
| A comparison of element agglomeration algorithms for unstructured geometric multigrid | |
| Article | |
| Dargaville, S.1  Buchan, A. G.2  Smedley-Stevenson, R. P.1,3  Smith, P. N.1,4  Pain, C. C.1  | |
| [1] Imperial Coll London, Appl Modelling & Computat Grp, London SW7 2AZ, England | |
| [2] Queen Mary Univ London, Sch Engn & Mat Sci, London E14 NS, England | |
| [3] AWE, Reading RG7 4PR, Berks, England | |
| [4] ANSWERS Software Serv, Kimmeridge House,Dorset Green Technol Pk, Dorchester DT2 8ZB, England | |
| 关键词: Multigrid; Boltzmann transport; Radiation transport; Coarsening; Agglomeration; Matrix-free; | |
| DOI : 10.1016/j.cam.2020.113379 | |
| 来源: Elsevier | |
PDF
|
|
【 摘 要 】
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. (C) 2021 Elsevier B.V. All rights reserved.
【 授权许可】
Free
【 预 览 】
| Files | Size | Format | View |
|---|---|---|---|
| 10_1016_j_cam_2020_113379.pdf | 2700KB |
PDF