Skip to content
Snippets Groups Projects
Commit 95405b3f authored by Nils Kohl's avatar Nils Kohl :full_moon_with_face:
Browse files

Fixed some own ref

parent 0178d369
Branches
No related tags found
No related merge requests found
...@@ -1225,8 +1225,10 @@ f ...@@ -1225,8 +1225,10 @@ f
pages={1--12}, pages={1--12},
year={2015} year={2015}
} }
@Article{kohl2020textbook, @Article{kohl2020textbook,
author = {Nils Kohl and Ulrich Rüde}, author = {Nils Kohl and Ulrich Rüde},
journal = {arXiv preprint arXiv:2010.13513},
title = {Textbook efficiency: massively parallel matrix-free multigrid for the Stokes system}, title = {Textbook efficiency: massively parallel matrix-free multigrid for the Stokes system},
abstract = {We employ textbook multigrid efficiency (TME), as introduced by Achi Brandt, to construct an asymptotically optimal monolithic multigrid solver for the Stokes system. The geometric multigrid solver builds upon the concept of hierarchical hybrid grids (HHG), which is extended to higher-order finite-element discretizations, and a corresponding matrix-free implementation. The computational cost of the full multigrid (FMG) iteration is quantified, and the solver is applied to multiple benchmark problems. Through a parameter study, we suggest configurations that achieve TME for both, stabilized equal-order, and Taylor-Hood discretizations. The excellent node-level performance of the relevant compute kernels is presented via a roofline analysis. Finally, we demonstrate the weak and strong scalability to up to $147,456$ parallel processes and solve Stokes systems with more than $3.6 \times 10^{12}$ (trillion) unknowns.}, abstract = {We employ textbook multigrid efficiency (TME), as introduced by Achi Brandt, to construct an asymptotically optimal monolithic multigrid solver for the Stokes system. The geometric multigrid solver builds upon the concept of hierarchical hybrid grids (HHG), which is extended to higher-order finite-element discretizations, and a corresponding matrix-free implementation. The computational cost of the full multigrid (FMG) iteration is quantified, and the solver is applied to multiple benchmark problems. Through a parameter study, we suggest configurations that achieve TME for both, stabilized equal-order, and Taylor-Hood discretizations. The excellent node-level performance of the relevant compute kernels is presented via a roofline analysis. Finally, we demonstrate the weak and strong scalability to up to $147,456$ parallel processes and solve Stokes systems with more than $3.6 \times 10^{12}$ (trillion) unknowns.},
date = {2020-10-26}, date = {2020-10-26},
...@@ -1334,20 +1336,6 @@ f ...@@ -1334,20 +1336,6 @@ f
isbn = {978-3-95806-109-5}, isbn = {978-3-95806-109-5},
} }
@Article{kohl2018hyteg,
author = {Nils Kohl and Dominik Thönnes and Daniel Drzisga and Dominik Bartuschat and Ulrich Rüde},
journal = {International Journal of Parallel, Emergent and Distributed Systems},
title = {The HyTeG finite-element software framework for scalable multigrid solvers},
year = {2018},
number = {0},
pages = {1-20},
volume = {0},
doi = {10.1080/17445760.2018.1506453},
eprint = {https://doi.org/10.1080/17445760.2018.1506453},
publisher = {Taylor & Francis},
url = {https://doi.org/10.1080/17445760.2018.1506453},
}
@Article{may2015scalablea, @Article{may2015scalablea,
author = {D.A. May and J. Brown and L. Le Pourhiet}, author = {D.A. May and J. Brown and L. Le Pourhiet},
journal = {Computer Methods in Applied Mechanics and Engineering}, journal = {Computer Methods in Applied Mechanics and Engineering},
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment