E-mail a Wiley Online Library Link

Daniel Weber, Jan Bender, Markus Schnoes, André Stork and Dieter Fellner Efficient GPU Data Structures and Methods to Solve Sparse Linear Systems in Dynamics Applications Computer Graphics Forum 32

Article first published online: 12 OCT 2012 | DOI: 10.1111/j.1467-8659.2012.03227.x

Thumbnail image of graphical abstract

We present GPU data structures and algorithms to efficiently solve sparse linear systems which are typically required in simulations of multibody 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.

Complete the form below and we will send an e-mail message containing a link to the selected article on your behalf

Required = Required Field

Choose captcha format: Image or Audio. Click here if you need help.