A flexible, parallel, adaptive geometric multigrid method for FEM
We present the design and implementation details of a geometric multigrid method on adaptively refined meshes for massively parallel computations. The method uses local smoothing on the refined part of the mesh. Partitioning is achieved by using a space filling curve for the leaf mesh and distributi...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Dokumenttyp: | Article (Journal) |
| Sprache: | Englisch |
| Veröffentlicht: |
December 2020
|
| In: |
ACM transactions on mathematical software
Year: 2020, Jahrgang: 47, Heft: 1, Pages: 1-27 |
| ISSN: | 1557-7295 |
| DOI: | 10.1145/3425193 |
| Online-Zugang: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1145/3425193
|
| Verfasserangaben: | Thomas C. Clevenger and Timo Heister, Guido Kanschat, Martin Kronbichler |
| Zusammenfassung: | We present the design and implementation details of a geometric multigrid method on adaptively refined meshes for massively parallel computations. The method uses local smoothing on the refined part of the mesh. Partitioning is achieved by using a space filling curve for the leaf mesh and distributing ancestors in the hierarchy based on the leaves. We present a model of the efficiency of mesh hierarchy distribution and compare its predictions to runtime measurements. The algorithm is implemented as part of the deal.II finite-element library and as such available to the public. |
|---|---|
| Beschreibung: | Gesehen am 26.02.2022 |
| Beschreibung: | Online Resource |
| ISSN: | 1557-7295 |
| DOI: | 10.1145/3425193 |