arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0811.4228astro-ph
收藏

The Adaptive TreePM:一个用于宇宙学N体模拟的自适应分辨率程序

The Adaptive TreePM: An Adaptive Resolution Code for Cosmological N-body Simulations

J. S. Bagla, Nishikanta Khandai

摘要:

宇宙学N体模拟用于各种应用。事实上,如果没有这种工具,大尺度结构和星系形成的研究进展将非常有限。近20年来,计算能力的限制迫使模拟器忽略了模拟引力不稳定性的一些基本要求。大多数宇宙学代码的局限性之一是使用了比典型的粒子间分离小得多的力软化长度。这导致偏离这些模拟中所期望的无碰撞演化。我们提出了一种基于粒子的方法,具有自适应分辨率,其中在高密度区域中减小力软化长度,同时确保其保持远高于局部粒子间分离。该方法称为自适应TreePM,基于TreePM代码。我们提出的数学模型和实现这个代码,并证明了结果收敛在一系列的参数选项中引入的代码从TreePM代码概括。我们明确地证明了无碰撞演化的斜平面波的崩溃。我们比较代码与固定分辨率TreePM代码,也模仿自适应网格细化方法和评论的协议,并在结果中的分歧的实现。我们发现,在大多数方面的ATreePM代码执行至少以及固定分辨率TreePM在高度过密的区域,从集群和数量密度的晕,晕的内部动态。我们还表明,自适应代码比相应的高分辨率TreePM代码更快。

英文摘要:

Cosmological N-Body simulations are used for a variety of applications. Indeed progress in the study of large scale structures and galaxy formation would have been very limited without this tool. For nearly twenty years the limitations imposed by computing power forced simulators to ignore some of the basic requirements for modeling gravitational instability. One of the limitations of most cosmological codes has been the use of a force softening length that is much smaller than the typical inter-particle separation. This leads to departures from collisionless evolution that is desired in these simulations. We propose a particle based method with an adaptive resolution where the force softening length is reduced in high density regions while ensuring that it remains well above the local inter-particle separation. The method, called the Adaptive TreePM, is based on the TreePM code. We present the mathematical model and an implementation of this code, and demonstrate that the results converge over a range of options for parameters introduced in generalizing the code from the TreePM code. We explicitly demonstrate collisionless evolution in collapse of an oblique plane wave. We compare the code with the fixed resolution TreePM code and also an implementation that mimics adaptive mesh refinement methods and comment on the agreement, and disagreements in the results. We find that in most respects the ATreePM code performs at least as well as the fixed resolution TreePM in highly over-dense regions, from clustering and number density of haloes, to internal dynamics of haloes. We also show that the adaptive code is faster than the corresponding high resolution TreePM code.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑