Optimizing the multipole-to-local operator in the fast multipole method for graphical processing units
From MaRDI portal
Publication:2894886
DOI10.1002/nme.3240zbMath1242.68364MaRDI QIDQ2894886
William Fong, Cris Cecka, Toru Takahashi, Eric Darve
Publication date: 2 July 2012
Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nme.3240
high performance computing (HPC); graphical processing units (GPUs); fast multipole method (FMM); nvidia CUDA
68U10: Computing methodologies for image processing
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Algorithm 967, FMMTL: FMM Template Library A Generalized Framework for Kernel Matrices, An efficient blocking M2L translation for low-frequency fast multipole method in three dimensions, Generation of large finite-element matrices on multiple graphics processors
Uses Software
Cites Work
- Unnamed Item
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- A parallel version of the fast multipole method
- Fast multipole methods on graphics processors
- High performance BLAS formulation of the adaptive fast multipole method
- The black-box fast multipole method
- Rapid solution of integral equations of classical potential theory
- A fast adaptive multipole algorithm in three dimensions
- High performance BLAS formulation of the multipole-to-local operator in the fast multipole method
- PetFMM-A dynamically load-balancing parallel fast multipole library
- The Parallel Multipole Method on the Connection Machine
- An Accelerated Kernel-Independent Fast Multipole Method in One Dimension
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- A Generalized Fast Multipole Method for Nonoscillatory Kernels
- Multipole Translation Theory for the Three-Dimensional Laplace and Helmholtz Equations
- A fast algorithm for particle simulations
