A new sparse matrix vector multiplication graphics processing unit algorithm designed for finite element problems
From MaRDI portal
Publication:2952748
DOI10.1002/nme.4865zbMath1352.65134arXiv1501.00324OpenAlexW2111542840MaRDI QIDQ2952748
Jonathan Wong, Ellen Kuhl, Eric Darve
Publication date: 30 December 2016
Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.00324
Computational methods for sparse matrices (65F50) Numerical algorithms for specific classes of architectures (65Y10)
Related Items (2)
GPU-based matrix-free finite element solver exploiting symmetry of elemental matrices ⋮ Accelerating implicit integration in multi-body dynamics using GPU computing
Uses Software
Cites Work
- Accelerated finite element elastodynamic simulations using the GPU
- Real-time nonlinear finite element computations on GPU - application to neurosurgical simulation
- Computational modeling of electrochemical coupling: a novel finite element approach towards ionic models for cardiac electrophysiology
- Nodal discontinuous Galerkin methods on graphics processors
- A framework for finite strain elastoplasticity based on maximum plastic dissipation and the multiplicative decomposition. II: Computational aspects
- Large calculation of the flow over a hypersonic vehicle using a GPU
- High-order finite-element seismic wave propagation modeling with MPI on a large GPU cluster
- A Unified Sparse Matrix Data Format for Efficient General Sparse Matrix-Vector Multiplication on Modern Processors with Wide SIMD Units
- Assembly of finite element methods on graphics processors
- Computational modeling of cardiac electrophysiology: A novel finite element approach
This page was built for publication: A new sparse matrix vector multiplication graphics processing unit algorithm designed for finite element problems
