REVIEW 1 cited by
Natively Periodic Fast Multipole Method: Approximating the Optimal Green Function
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Natively Periodic Fast Multipole Method: Approximating the Optimal Green Function
read the original abstract
The Fast Multipole Method (FMM) obeys periodic boundary conditions "natively" if it uses a periodic Green function for computing the multipole expansion in the interaction zone of each FMM oct-tree node. One can define the "optimal" Green function for such a method that results in the numerical solution that converges to the equivalent Particle-Mesh solution in the limit of sufficiently high order of multipoles. A discrete functional equation for the optimal Green function can be derived, but is not practically useful as methods for its solution are not known. Instead, this paper presents an approximation for the optimal Green function that is accurate to better than 1e-3 in LMAX norm and 1e-4 in L2 norm for practically useful multipole counts. Such an approximately optimal Green function offers a practical way for implementing FMM with periodic boundary conditions "natively", without the need to compute lattice sums or to rely on hybrid FMM-PM approaches.
Forward citations
Cited by 1 Pith paper
-
A Scalable Fast Multipole Method Poisson Solver for the RAMSES code: II. Adaptive Mesh Refinement and Adaptive Time Stepping
An FMM Poisson solver for RAMSES is extended to adaptive mesh refinement and adaptive time stepping, matching multigrid accuracy while conserving momentum better across coarse-fine interfaces and scaling better in parallel.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.