Distributed and adaptive fast multipole method in three dimensions
From MaRDI portal
Publication:5163871
Abstract: We develop a general distributed implementation of an adaptive fast multipole method in three space dimensions. We rely on a balanced type of adaptive space discretisation which supports a highly transparent and fully distributed implementation. A complexity analysis indicates favorable scaling properties and numerical experiments on up to 512 cores and 1 billion source points verify them. The parameters controlling the algorithm are subject to in-depth experiments and the performance response to the input parameters implies that the overall implementation is well-suited to automated tuning.
Recommendations
- A fast adaptive multipole algorithm in three dimensions
- Massively parallel implementation of a fast multipole method for distributed memory machines
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- Optimizing the adaptive fast multipole method for fractal sets
- Adaptive spatial decomposition in fast multipole method
Cites work
- scientific article; zbMATH DE number 1064576 (Why is no real title available?)
- A fast adaptive multipole algorithm in three dimensions
- A fast algorithm for particle simulations
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- Accelerated Cartesian expansions -- a fast method for computing of potentials of the form \(R^{ - \nu }\) for all real \(\nu \)
- An adaptive fast multipole accelerated Poisson solver for complex geometries
- Bottom-Up Construction and 2:1 Balance Refinement of Linear Octrees in Parallel
- DASHMM Accelerated Adaptive Fast Multipole Poisson-Boltzmann Solver on Distributed Memory Architecture
- Dynamic autotuning of adaptive fast multipole methods on hybrid multicore CPU and GPU systems
- Fast multipole methods on graphics processors
- Fast multipole preconditioners for sparse matrices arising from elliptic equations
- On well-separated sets and fast multipole methods
- PVFMM: A parallel kernel independent FMM for particle and volume potentials
- PetFMM -- a dynamically load-balancing parallel fast multipole library
- The inverse fast multipole method: using a fast approximate direct dolver as a preconditioner for dense linear systems
Cited in
(14)- Optimizing the adaptive fast multipole method for fractal sets
- Revision of DASHMM: dynamic adaptive system for hierarchical multipole methods
- scientific article; zbMATH DE number 826880 (Why is no real title available?)
- High performance BLAS formulation of the adaptive fast multipole method
- scientific article; zbMATH DE number 2152987 (Why is no real title available?)
- Algorithm 967
- A fast adaptive multipole algorithm in three dimensions
- An Implementation of the Fast Multipole Method without Multipoles
- A parallel implementation of a fast multipole-based 3-D capacitance extraction program on distributed memory multicomputers
- A free-space adaptive FMM-based PDE solver in three dimensions
- Adaptive spatial decomposition in fast multipole method
- An adaptive fast multipole method in Cartesian basis, enabled by algorithmic differentiation
- DASHMM: dynamic adaptive system for hierarchical multipole methods
- Dynamic autotuning of adaptive fast multipole methods on hybrid multicore CPU and GPU systems
This page was built for publication: Distributed and adaptive fast multipole method in three dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5163871)
