arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1802.04207astro-ph.CO
收藏

偏移集方法:Stratonovich近似和Cholesky分解

The Excursion set approach: Stratonovich approximation and Cholesky decomposition

Farnik Nikakhtar, Mohammadreza Ayromlou, Shant Baghram, Sohrab Rahvar, M. Reza Rahimi Tabar, Ravi K. Sheth

摘要:

偏移集方法是一个框架,用于估计宇宙网络中非线性结构的数量密度如何取决于宇宙的膨胀历史和引力的性质。该方法的一个关键部分是通过具有相关步骤的随机行走来估计适当选择的障碍的第一交叉分布:障碍的形状由非线性崩溃的物理学确定,并且步骤之间的相关性由初始密度波动场的性质确定。我们描述了计算这种第一向上交叉分布的分析和数值方法。虽然精确的解决方案可以正式地写为一个无穷级数,我们展示了如何有效地近似使用Stratonovich近似。我们证明了它的准确性使用蒙特卡洛实现的散步,我们使用一种新的Cholesky分解为基础的算法,这是显着快于目前在文献中的算法。

英文摘要:

The excursion set approach is a framework for estimating how the number density of nonlinear structures in the cosmic web depends on the expansion history of the universe and the nature of gravity. A key part of the approach is the estimation of the first crossing distribution of a suitably chosen barrier by random walks having correlated steps: The shape of the barrier is determined by the physics of nonlinear collapse, and the correlations between steps by the nature of the initial density fluctuation field. We describe analytic and numerical methods for calculating such first up-crossing distributions. While the exact solution can be written formally as an infinite series, we show how to approximate it efficiently using the Stratonovich approximation. We demonstrate its accuracy using Monte-Carlo realizations of the walks, which we generate using a novel Cholesky-decomposition based algorithm, which is significantly faster than the algorithm that is currently in the literature.

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

↑