An adaptive multigrid solver for high-resolution cosmological simulations
An adaptive multigrid solver for high-resolution cosmological simulations
复制标题
用于高分辨率宇宙学模拟的自适应多重网格求解器
DOI：
--
复制
发表时间：
1994
期刊：
影响因子：
--
通讯作者：
E. Saar
中科院分区：
文献类型：
--
作者：
I. Suisalu;E. Saar
我们已经开发了一个自适应多重网格代码求解泊松方程的引力模拟。在密度超过局部水平依赖阈值的位置自适应地创建更精细的矩形子网格。我们描述的代码，测试它在宇宙学模拟，并将其应用到一个典型的煎饼奇点的诞生和演化的研究。煎饼的初始条件的基础上产生的拉格朗日奇点理论，我们遵循其演变的几个崩溃的时间，找到一个丰富的子结构在最终的对象。我们实现了1/1024的空间分辨率的整体计算立方体的中心部分的煎饼的大小，计算时间与FFT求解器。
We have developed an adaptive multigrid code for solving the Poisson equation in gravitational simulations. Finer rectangular subgrids are adaptively created in locations where the density exceeds a local level-dependent threshold. We describe the code, test it in cosmological simulations, and apply it to the study of the birth and evolution of a typical pancake singularity. The initial conditions for the pancake are generated on the basis of the theory of Lagrangian singularities; we follow its evolution for a few collapse times, finding a rich substructure in the final object. We achieve a spatial resolution of 1/1024 of the size of the overall computational cube in the central parts of the pancake, with computing time comparable to that of the FFT-solvers.