TU Darmstadt / ULB / TUbiblio

Efficient GPU Data Structures and Methods to Solve Sparse Linear Systems in Dynamics Applications

Weber, Daniel ; Bender, Jan ; Schnös, Markus ; Stork, André ; Fellner, Dieter W. (2013)
Efficient GPU Data Structures and Methods to Solve Sparse Linear Systems in Dynamics Applications.
In: Computer Graphics Forum, 32 (1)
doi: 10.1111/j.1467-8659.2012.03227.x
Artikel, Bibliographie

Kurzbeschreibung (Abstract)

We present graphics processing unit (GPU) data structures and algorithms to efficiently solve sparse linear systems that are typically required in simulations of multi-body systems and deformable bodies. Thereby, we introduce an efficient sparse matrix data structure that can handle arbitrary sparsity patterns and outperforms current state-of-the-art implementations for sparse matrix vector multiplication. Moreover, an efficient method to construct global matrices on the GPU is presented where hundreds of thousands of individual element contributions are assembled in a few milliseconds. A finite-element-based method for the simulation of deformable solids as well as an impulse-based method for rigid bodies are introduced in order to demonstrate the advantages of the novel data structures and algorithms. These applications share the characteristic that a major computational effort consists of building and solving systems of linear equations in every time step. Our solving method results in a speed-up factor of up to 13 in comparison to other GPU methods.

Typ des Eintrags: Artikel
Erschienen: 2013
Autor(en): Weber, Daniel ; Bender, Jan ; Schnös, Markus ; Stork, André ; Fellner, Dieter W.
Art des Eintrags: Bibliographie
Titel: Efficient GPU Data Structures and Methods to Solve Sparse Linear Systems in Dynamics Applications
Sprache: Englisch
Publikationsjahr: 2013
Titel der Zeitschrift, Zeitung oder Schriftenreihe: Computer Graphics Forum
Jahrgang/Volume einer Zeitschrift: 32
(Heft-)Nummer: 1
DOI: 10.1111/j.1467-8659.2012.03227.x
Kurzbeschreibung (Abstract):

We present graphics processing unit (GPU) data structures and algorithms to efficiently solve sparse linear systems that are typically required in simulations of multi-body systems and deformable bodies. Thereby, we introduce an efficient sparse matrix data structure that can handle arbitrary sparsity patterns and outperforms current state-of-the-art implementations for sparse matrix vector multiplication. Moreover, an efficient method to construct global matrices on the GPU is presented where hundreds of thousands of individual element contributions are assembled in a few milliseconds. A finite-element-based method for the simulation of deformable solids as well as an impulse-based method for rigid bodies are introduced in order to demonstrate the advantages of the novel data structures and algorithms. These applications share the characteristic that a major computational effort consists of building and solving systems of linear equations in every time step. Our solving method results in a speed-up factor of up to 13 in comparison to other GPU methods.

Freie Schlagworte: Business Field: Virtual engineering, Research Area: Confluence of graphics and vision, Interactive simulation, GPU computing, Physically based modeling, Linear systems
Fachbereich(e)/-gebiet(e): 20 Fachbereich Informatik
20 Fachbereich Informatik > Graphisch-Interaktive Systeme
Hinterlegungsdatum: 12 Nov 2018 11:16
Letzte Änderung: 04 Feb 2022 12:40
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen