Papers › Computing the gravitational potential on nested meshes using the convolution method
Computing the gravitational potential on nested meshes using the convolution method
Eduard Vorobyov, James McKevitt, Igor Kulikov, Vardan Elbakyan
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Aims. Our aim is to derive a fast and accurate method for computing the gravitational potential of astrophysical objects with high contrasts in density, for which nested or adaptive meshes are required. Methods. We present an extension of the convolution method for computing the gravitational potential to the nested Cartesian grids. The method makes use of the convolution theorem to compute the gravitational potential using its integral form. Results. A comparison of our method with the iterative outside-in conjugate gradient and generalized minimal residual methods for solving the Poisson equation using nonspherically symmetric density configurations has shown a comparable performance in terms of the errors relative to the analytic solutions. However, the convolution method is characterized by several advantages and outperforms the considered iterative methods by factors 10--200 in terms of the runtime, especially when graphics processor units are utilized. The convolution method also shows an overall second-order convergence, except for the errors at the grid interfaces where the convergence is linear. Conclusions. High computational speed and ease in implementation can make the convolution method a preferred choice when using a large number of nested grids. The convolution method, however, becomes more computationally costly if the dipole moments of tightly spaced gravitating objects are to be considered at coarser grids.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections