GPU-based Polynomial Finite Element Matrix Assembly for Simplex Meshes
| dc.contributor.author | Mueller-Roemer, Johannes Sebastian | en_US |
| dc.contributor.author | Stork, André | en_US |
| dc.contributor.editor | Fu, Hongbo and Ghosh, Abhijeet and Kopf, Johannes | en_US |
| dc.date.accessioned | 2018-10-07T15:00:36Z | |
| dc.date.available | 2018-10-07T15:00:36Z | |
| dc.date.issued | 2018 | |
| dc.description.abstract | In this paper, we present a matrix assembly technique for arbitrary polynomial order finite element simulations on simplex meshes for graphics processing units (GPU). Compared to the current state of the art in GPU-based matrix assembly, we avoid the need for an intermediate sparse matrix and perform assembly directly into the final, GPU-optimized data structure. Thereby, we avoid the resulting 180% to 600% memory overhead, depending on polynomial order, and associated allocation time, while simplifying the assembly code and using a more compact mesh representation. We compare our method with existing algorithms and demonstrate significant speedups. | en_US |
| dc.description.number | 7 | |
| dc.description.sectionheaders | Visualization and GPU | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 37 | |
| dc.identifier.doi | 10.1111/cgf.13581 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 443-454 | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.13581 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf13581 | |
| dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.subject | Computing methodologies | |
| dc.subject | Massively parallel and high performance simulations | |
| dc.subject | Massively parallel algorithms | |
| dc.subject | Physical simulation | |
| dc.subject | Graphics processors | |
| dc.subject | Mathematics of computing | |
| dc.subject | Combinatoric problems | |
| dc.title | GPU-based Polynomial Finite Element Matrix Assembly for Simplex Meshes | en_US |