A GPU-accelerated fast multipole method based on barycentric Lagrange interpolation and dual tree traversal

DOI10.1016/j.cpc.2021.108017arXiv2012.06925MaRDI QIDQ6156394

Nathan Vaughn, Leighton Wilson, Robert Krasny

Publication date: 13 June 2023

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.06925

zbMATH Keywords

fast summationGPUbarycentric Lagrange interpolationdual tree traversalMPI remote memory access

Mathematics Subject Classification ID

Numerical analysis (65-XX) Classical thermodynamics, heat transfer (80-XX)

Related Items (4)

A treecode based on barycentric Hermite interpolation for electrostatic particle interactions ⋮ A GPU-parallelized interpolation-based fast multipole method for the relativistic space-charge field calculation ⋮ Relativistic space-charge field calculation by interpolation-based treecode ⋮ Optimal Birkhoff interpolation and Birkhoff numbers in some function spaces

Cites Work

• Unnamed Item
• A treecode-accelerated boundary integral Poisson-Boltzmann solver for electrostatics of solvated biomolecules
• A sparse octree gravitational \(N\)-body code that runs entirely on the GPU processor
• A GPU-accelerated direct-sum boundary integral Poisson-Boltzmann solver
• A kernel-independent adaptive fast multipole algorithm in two and three dimensions
• A hierarchical \({\mathcal O}(N)\) force calculation algorithm
• Fast multipole methods on graphics processors
• A new version of the fast multipole method for screened Coulomb interactions in three dimensions
• A Cartesian treecode for screened Coulomb interactions
• The black-box fast multipole method
• On the fast matrix multiplication in the boundary element method by panel clustering
• The order of Appel's algorithm
• Yet another fast multipole method without multipoles -- pseudoparticle multipole method
• A portable parallel particle program
• Rapid solution of first kind boundary integral equations in \(\mathbb R^3\).
• Approximation of integral operators by variable-order interpolation
• A fast adaptive multipole algorithm in three dimensions
• Biomolecular electrostatics using a fast multipole BEM on up to 512 GPUs and a billion unknowns
• Treecode-accelerated Green iteration for Kohn-Sham density functional theory
• A treecode based on barycentric Hermite interpolation for electrostatic particle interactions
• Accelerated Cartesian expansions -- a fast method for computing of potentials of the form \(R^{ - \nu }\) for all real \(\nu \)
• Hierarchical Matrices: Algorithms and Analysis
• A completely analytical family of anisotropic Plummer models
• An Implementation of the Fast Multipole Method without Multipoles
• Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation
• Barycentric Lagrange Interpolation
• A Kernel-Independent Treecode Based on Barycentric Lagrange Interpolation
• Interpolative Decomposition via Proxy Points for Kernel Matrices
• Randomized GPU Algorithms for the Construction of Hierarchical Matrices from Matrix-Vector Operations
• Hierarchical Matrix Operations on GPUs
• Algorithm 967
• PVFMM: A Parallel Kernel Independent FMM for Particle and Volume Potentials
• Task-Based FMM for Multicore Architectures
• Lagrangian Interpolation at the Chebyshev Points xn,     cos (  /n),   = 0(1)n; some Unnoted Advantages
• A fast algorithm for particle simulations
• A particle method and adaptive treecode for vortex sheet motion in three-dimensional flow

This page was built for publication: A GPU-accelerated fast multipole method based on barycentric Lagrange interpolation and dual tree traversal