EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A scalable fast multipole method Poisson solver for the ramses code – I. Unigrid algorithm

Jun-Young Lee, Romain Teyssier

Monthly Notices of the Royal Astronomical Society · 03.07.2026 · 550 (2)

DOI: 10.1093/mnras/stag1241 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Monthly Notices of the Royal Astronomical Society, online erschienen am 27.06.2026. Verfasst von Jun-Young Lee und 1 weiteren Autor:innen. Die Arbeit nennt 29 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Science Foundation, United States - Israel Binational Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We present a scalable Poisson solver with $\mathcal {O}(N)$ complexity based on the fast multipole method (FMM) implemented in ramses. Our FMM constructs a hierarchy of FMM grids on top of the pre-existing Cartesian grid, which is used to compute the force for hydrodynamics or particle-mesh simulations. In contrast to the $\mathcal {O}(N)$ multigrid (MG) solver – an iterative method that requires multiple V-cycles through a multiresolution hierarchy of Cartesian grids – the FMM algorithm performs just one upward pass through the same hierarchy, during which multipole expansions are accumulated and shifted, followed by a single downward pass, in which local expansions are propagated. Numerical tests indicate that FMM attains accuracy comparable to that of MG for smooth potentials and is particularly well-suited for problems with isolated boundary conditions, since it avoids the approximate Dirichlet boundary conditions required by MG schemes. Although in theory FMM requires about 30 times more floating-point operations than MG, its higher arithmetic intensity leads to comparable performance and better scalability relative to MG.

Förderung

  • National Science Foundation
  • United States - Israel Binational Science Foundation

Zitieren

APA

Lee, J., & Teyssier, R. (2026). A scalable fast multipole method Poisson solver for the ramses code – I. Unigrid algorithm. Monthly Notices of the Royal Astronomical Society, 550(2). https://doi.org/10.1093/mnras/stag1241

Vancouver

Lee J, Teyssier R. A scalable fast multipole method Poisson solver for the ramses code – I. Unigrid algorithm. Monthly Notices of the Royal Astronomical Society. 2026;550(2). doi:10.1093/mnras/stag1241

BibTeX
@article{Lee2026,
  author = {Lee, Jun-Young and Teyssier, Romain},
  title = {A scalable fast multipole method Poisson solver for the ramses code – I. Unigrid algorithm},
  journal = {Monthly Notices of the Royal Astronomical Society},
  year = {2026},
  volume = {550},
  number = {2},
  doi = {10.1093/mnras/stag1241}
}
Kostenlos starten →