An adaptive fast multipole method in Cartesian basis, enabled by algorithmic differentiation
From MaRDI portal
Publication:2207366
DOI10.1016/J.CNSNS.2019.01.001zbMath1464.65263OpenAlexW2908129382WikidataQ128651232 ScholiaQ128651232MaRDI QIDQ2207366
S. Abeyratne, Alice Gee, Bela Erdelyi
Publication date: 22 October 2020
Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cnsns.2019.01.001
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- A new version of the fast multipole method for screened Coulomb interactions in three dimensions
- Molecular modeling and simulation. An interdisciplinary guide.
- Algorithmic challenges in computational molecular biophysics
- A fast adaptive multipole algorithm in three dimensions
- A regular fast multipole method for geometric numerical integrations of Hamiltonian systems
- High performance BLAS formulation of the multipole-to-local operator in the fast multipole method
- Dynamic Autotuning of Adaptive Fast Multipole Methods on Hybrid Multicore CPU and GPU Systems
- Fast multipole methods for particle dynamics
- An Accelerated Kernel-Independent Fast Multipole Method in One Dimension
- Recursions for the Computation of Multipole Translation and Rotation Coefficients for the 3-D Helmholtz Equation
- A Generalized Fast Multipole Method for Nonoscillatory Kernels
- Comparison of Integral-Equation Formulations for the Fast and Accurate Solution of Scattering Problems Involving Dielectric Objects with the Multilevel Fast Multipole Algorithm
- The Fast Gauss Transform
- A fast algorithm for particle simulations
This page was built for publication: An adaptive fast multipole method in Cartesian basis, enabled by algorithmic differentiation
