Yet another fast multipole method without multipoles -- pseudoparticle multipole method
From MaRDI portal
Publication:1306091
DOI10.1006/JCPH.1999.6226zbMATH Open0934.65145arXivastro-ph/9806213OpenAlexW2034268890MaRDI QIDQ1306091FDOQ1306091
Authors: Junichiro Makino 
Publication date: 22 September 1999
Published in: Journal of Computational Physics (Search for Journal in Brave)
Abstract: In this paper we describe a new approach to implement the O(N) fast multipole method and tree method, which uses pseudoparticles to express the potential field. The new method is similar to Anderson's method, which uses the values of potential at discrete points to represent the potential field. However, for the same expansion order the new method is more accurate and computationally efficient.
Full work available at URL: https://arxiv.org/abs/astro-ph/9806213
Recommendations
- An Implementation of the Fast Multipole Method without Multipoles
- Fast multipole methods for particle dynamics
- The fast multipole method: Numerical implementation
- A pedestrian introduction to fast multipole methods
- scientific article; zbMATH DE number 953046
- scientific article; zbMATH DE number 1275858
- scientific article; zbMATH DE number 1064576
- Fast multipole methods and applications
- A parallel version of the fast multipole method
- scientific article; zbMATH DE number 2052773
Galactic and stellar dynamics (85A05) Integro-partial differential equations (45K05) Numerical methods for integral equations (65R20)
Cites Work
- A fast algorithm for particle simulations
- Title not available (Why is that?)
- McLaren's improved snub cube and other new spherical designs in three dimensions
- An Implementation of the Fast Multipole Method without Multipoles
- Title not available (Why is that?)
- Optimal Numerical Integration on a Sphere
- Fast Fourier Transform Accelerated Fast Multipole Algorithm
Cited In (23)
- A fast solver for Poisson problems on infinite regular lattices
- Fast updating multipole coulombic potential calculation
- A kernel-independent treecode based on barycentric Lagrange interpolation
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- High-performance computing techniques for vortex method calculations
- A treecode based on barycentric Hermite interpolation for electrostatic particle interactions
- Fast multipole boundary element method using the binary tree structure with tight bounds: application to a calculation of an electrostatic force for the manipulation of a metal micro particle.
- Efficient random walks in the presence of complex two-dimensional geometries
- A new version of the fast multipole method for screened Coulomb interactions in three dimensions
- A mathematically rigorous formulation of the pseudopotential method
- The block-P\(^{3}\)M algorithm
- Fast vortex method calculation using a special-purpose computer
- Grid-Multipole Calculations
- Analytical low-rank compression via proxy point selection
- A finite element based P\(^3\)M method for \(N\)-body problems
- A GPU-accelerated fast multipole method based on barycentric Lagrange interpolation and dual tree traversal
- Do-it-yourself computational astronomy. Hardwares, algorithms, softwares, and sciences
- A PPPM fast summation method for fluids and beyond
- Accelerated Cartesian expansions -- a fast method for computing of potentials of the form \(R^{ - \nu }\) for all real \(\nu \)
- A wideband fast multipole algorithm for two-dimensional volume integral equations
- Low-rank approximation of integral operators by using the Green formula and quadrature
- Multilevel multipole and local operators for potentials of the form \(r^{-\lambda}\)
- A parallel hierarchical-element method for contour dynamics simulations
This page was built for publication: Yet another fast multipole method without multipoles -- pseudoparticle multipole method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306091)
