Dustin Ruda
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Dustin Ruda has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Dirk Ribbrock
TU Dortmund University
2 shared publications Peter Zajac
Institute for Applied Mathematics (LS III), TU Dortmund University, Dortmund, Germany
2 shared publications- Stefan Turek
TU Dortmund University
2 shared publications Dirk Ribbrock
Institute for Applied Mathematics (LS III), TU Dortmund University, Dortmund, Germany
1 shared publicationStefan Turek
Institute for Applied Mathematics (LS III), TU Dortmund University, Dortmund, Germany
1 shared publication
Latest Publications
- 28 April 2025
- Published by Springer Nature
- p. 320-330
Fast Semi-iterative Finite Element Poisson Solvers for Tensor Core GPUs Based on Prehandling
- 28 April 2025
- Published by Springer Nature
- p. 320-330
Fast Semi-iterative Finite Element Poisson Solvers for Tensor Core GPUs Based on Prehandling
- Open Access
- 6 May 2022
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 36 (4) , 459-474
Very fast finite element Poisson solvers on lower precision accelerator hardware: A proof of concept study for Nvidia Tesla V100
Recently, accelerator hardware in the form of graphics cards including Tensor Cores, specialized for AI, has significantly gained importance in the domain of high-performance computing. For example, NVIDIA’s Tesla V100 promises a computing power of up to 125 TFLOP/s achieved by Tensor Cores, but only if half precision floating point format is used. We describe the difficulties and discrepancy between theoretical and actual computing power if one seeks to use such hardware for numerical simulations, that is, solving partial differential equations with a matrix-based finite element method, with numerical examples. If certain requirements, namely low condition numbers and many dense matrix operations, are met, the indicated high performance can be reached without an excessive loss of accuracy. A new method to solve linear systems arising from Poisson’s equation in 2D that meets these requirements, based on “prehandling” by means of hier-archical finite elements and an additional Schur complement approach, is presented and analyzed. We provide numerical results illustrating the computational performance of this method and compare it to a commonly used (geometric) multigrid solver on standard hardware. It turns out that we can exploit nearly the full computational power of Tensor Cores and achieve a significant speed-up compared to the standard methodology without losing accuracy.
- 6 May 2022
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 36 (4) , 459-474
Open AccessVery fast finite element Poisson solvers on lower precision accelerator hardware: A proof of concept study for Nvidia Tesla V100
Recently, accelerator hardware in the form of graphics cards including Tensor Cores, specialized for AI, has significantly gained importance in the domain of high-performance computing. For example, NVIDIA’s Tesla V100 promises a computing power of up to 125 TFLOP/s achieved by Tensor Cores, but only if half precision floating point format is used. We describe the difficulties and discrepancy between theoretical and actual computing power if one seeks to use such hardware for numerical simulations, that is, solving partial differential equations with a matrix-based finite element method, with numerical examples. If certain requirements, namely low condition numbers and many dense matrix operations, are met, the indicated high performance can be reached without an excessive loss of accuracy. A new method to solve linear systems arising from Poisson’s equation in 2D that meets these requirements, based on “prehandling” by means of hier-archical finite elements and an additional Schur complement approach, is presented and analyzed. We provide numerical results illustrating the computational performance of this method and compare it to a commonly used (geometric) multigrid solver on standard hardware. It turns out that we can exploit nearly the full computational power of Tensor Cores and achieve a significant speed-up compared to the standard methodology without losing accuracy.
- Open Access
- 14 December 2021
- Published by Wiley in Proceedings in Applied Mathematics and Mechanics
- Vol. 21 (1) , e202100091
A Proof of Concept for Very Fast Finite Element Poisson Solvers on Accelerator Hardware
It is demonstrated that modern accelerator hardware specialized in AI, e.g., “next gen GPUs” equipped with Tensor Cores, can be profitably used in finite element simulations by means of a new hardware‐oriented method to solve linear systems arising from Poisson's equation in 2D. We consider the NVIDIA Tesla V100 Tensor Core GPU with a peak performance of 125 TFLOP/s, that is only achievable in half precision and if operations with high arithmetic intensity, such as dense matrix multiplications, are executed, though. Its computing power can be exploited to a great extent by the new method based on “prehandling” without loss of accuracy. We obtain a significant reduction of computing time compared to a standard geometric multigrid solver on standard x64 hardware.
- 14 December 2021
- Published by Wiley in Proceedings in Applied Mathematics and Mechanics
- Vol. 21 (1) , e202100091
Open AccessA Proof of Concept for Very Fast Finite Element Poisson Solvers on Accelerator Hardware
It is demonstrated that modern accelerator hardware specialized in AI, e.g., “next gen GPUs” equipped with Tensor Cores, can be profitably used in finite element simulations by means of a new hardware‐oriented method to solve linear systems arising from Poisson's equation in 2D. We consider the NVIDIA Tesla V100 Tensor Core GPU with a peak performance of 125 TFLOP/s, that is only achievable in half precision and if operations with high arithmetic intensity, such as dense matrix multiplications, are executed, though. Its computing power can be exploited to a great extent by the new method based on “prehandling” without loss of accuracy. We obtain a significant reduction of computing time compared to a standard geometric multigrid solver on standard x64 hardware.