Show simple item record

dc.contributor.authorMueller-Roemer, Johannes Sebastianen_US
dc.contributor.authorStork, Andréen_US
dc.contributor.editorFu, Hongbo and Ghosh, Abhijeet and Kopf, Johannesen_US
dc.date.accessioned2018-10-07T15:00:36Z
dc.date.available2018-10-07T15:00:36Z
dc.date.issued2018
dc.identifier.issn1467-8659
dc.identifier.urihttps://doi.org/10.1111/cgf.13581
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf13581
dc.description.abstractIn 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.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subjectComputing methodologies
dc.subjectMassively parallel and high performance simulations
dc.subjectMassively parallel algorithms
dc.subjectPhysical simulation
dc.subjectGraphics processors
dc.subjectMathematics of computing
dc.subjectCombinatoric problems
dc.titleGPU-based Polynomial Finite Element Matrix Assembly for Simplex Meshesen_US
dc.description.seriesinformationComputer Graphics Forum
dc.description.sectionheadersVisualization and GPU
dc.description.volume37
dc.description.number7
dc.identifier.doi10.1111/cgf.13581
dc.identifier.pages443-454


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

  • 37-Issue 7
    Pacific Graphics 2018 - Symposium Proceedings

Show simple item record