Yet another fast multipole method without multipoles -- pseudoparticle multipole method
From MaRDI portal
(Redirected from Publication:1306091)
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.
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
Cites work
- scientific article; zbMATH DE number 4080996 (Why is no real title available?)
- scientific article; zbMATH DE number 1069612 (Why is no real title available?)
- A fast algorithm for particle simulations
- An Implementation of the Fast Multipole Method without Multipoles
- Fast Fourier Transform Accelerated Fast Multipole Algorithm
- McLaren's improved snub cube and other new spherical designs in three dimensions
- Optimal Numerical Integration on a Sphere
Cited in
(23)- A wideband fast multipole algorithm for two-dimensional volume integral equations
- A new version of the fast multipole method for screened Coulomb interactions in three dimensions
- Fast updating multipole coulombic potential calculation
- 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.
- Do-it-yourself computational astronomy. Hardwares, algorithms, softwares, and sciences
- High-performance computing techniques for vortex method calculations
- The block-P\(^{3}\)M algorithm
- Grid-Multipole Calculations
- Analytical low-rank compression via proxy point selection
- Multilevel multipole and local operators for potentials of the form \(r^{-\lambda}\)
- A finite element based P\(^3\)M method for \(N\)-body problems
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- Low-rank approximation of integral operators by using the Green formula and quadrature
- A PPPM fast summation method for fluids and beyond
- A treecode based on barycentric Hermite interpolation for electrostatic particle interactions
- A kernel-independent treecode based on barycentric Lagrange interpolation
- A fast solver for Poisson problems on infinite regular lattices
- Fast vortex method calculation using a special-purpose computer
- A mathematically rigorous formulation of the pseudopotential method
- Accelerated Cartesian expansions -- a fast method for computing of potentials of the form \(R^{ - \nu }\) for all real \(\nu \)
- Efficient random walks in the presence of complex two-dimensional geometries
- A GPU-accelerated fast multipole method based on barycentric Lagrange interpolation and dual tree traversal
- 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)
