Efficient finite element geometric multigrid solvers for unstructured grids on graphics processing units

0Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

Abstract

We consider geometric multigrid solvers for linear systems stemming from the finite element discretisation of partial differential equations on unstructured grids. Our implementation technique reduces the complete solver to sequences of sparse matrixvector multiplications and is thus well-suited for both GPUs and multicore CPUs. In particular, our implementation can handle several low- And high-order finite element spaces in 2D and 3D, while only the sparse matrix-vector kernel needs to receive significant tuning. For several benchmark problems, we achieve close to an order of magnitude speedup of a single GPU over multithreaded CPU code. © Civil-Comp Press, 2011.

Cite

CITATION STYLE

APA

Geveler, M., Ribbrock, D., Göddeke, D., Zajac, P., & Turek, S. (2011). Efficient finite element geometric multigrid solvers for unstructured grids on graphics processing units. In Civil-Comp Proceedings (Vol. 95). Civil-Comp Press. https://doi.org/10.4203/ccp.95.22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free