Optimizing the Adaptive Fast Multipole Method for Fractal Sets

DOI10.1137/140962681zbMath1316.28010arXiv1508.02666OpenAlexW2090857092MaRDI QIDQ5254482

Hadi Pouransari, Eric Darve

Publication date: 9 June 2015

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

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

zbMATH Keywords

linear complexityfractal setoctreeadaptive fast multipole method

Mathematics Subject Classification ID

Fractals (28A80) (n)-body problems (70F10) Numerical linear algebra (65F99)

Related Items (5)

Optimization of fast algorithms for global quadrature by expansion using target-specific expansions ⋮ The Inverse Fast Multipole Method: Using a Fast Approximate Direct Solver as a Preconditioner for Dense Linear Systems ⋮ Fast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank Approximation ⋮ Efficient mesh deformation based on radial basis function interpolation by means of the inverse fast multipole method ⋮ A fast algorithm with error bounds for quadrature by expansion

Uses Software

• CUDA
• FMM-Yukawa

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The fast multipole method on parallel clusters, multicore processors, and graphics processing units
• A kernel-independent adaptive fast multipole algorithm in two and three dimensions
• FMM-Yukawa: an adaptive fast multipole method for screened Coulomb interactions
• The black-box fast multipole method
• The fractal structure of the universe: Correlations of galaxies and clusters and the average mass density
• A fast adaptive multipole algorithm for calculating screened Coulomb (Yukawa) interactions
• A fast adaptive multipole algorithm in three dimensions
• Load balancing and data locality in adaptive hierarchical \(N\)-body methods: Barnes-Hut, fast multipole, and radiosity
• The fast multipole method: Numerical implementation
• A Fast Adaptive Multipole Algorithm for Particle Simulations
• Preconditioned, Adaptive, Multipole-Accelerated Iterative Methods for Three-Dimensional First-Kind Integral Equations of Potential Theory
• The Fast Multipole Method I: Error Analysis and Asymptotic Complexity
• On the equality of Hausdorff and box counting dimensions
• Greengard’s N-Body Algorithm is not Order N
• Hausdorff Dimension, Its Properties, and Its Surprises
• A fast algorithm for particle simulations

This page was built for publication: Optimizing the Adaptive Fast Multipole Method for Fractal Sets