Author:
Vorobyov Eduard I.,McKevitt James,Kulikov Igor,Elbakyan Vardan
Abstract
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.
Subject
Space and Planetary Science,Astronomy and Astrophysics
Reference28 articles.
1. Binney J., Tremaine S., & Ostriker J. 1987, Galactic Dynamics, Princeton series in astrophysics (Princeton: Princeton University Press)
2. Bodenheimer P., Laughlin G. P., Rózyczka M., & Yorke H. W. 2007, Numerical Methods in Astrophysics: An Introduction (Boca Raton: CRC Press)
3. Chandrasekhar S. 1969, Ellipsoidal Figures of Equilibrium (New Haven: Yale University Press)
4. A mass-conservative adaptive FAS multigrid solver for cell-centered finite difference methods on block-structured, locally-cartesian grids
5. Gayatri R., Yang C., Kurth T., & Deslippe J. 2019, in Accelerator Programming Using Directives, eds. Chandrasekaran S., Juckeland G., & Wienke S. (Cham: Springer International Publishing), 75
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献