基于插值的紧致二元似然函数的快速求解
Rapidly evaluating the compact binary likelihood function via interpolation
摘要:
对来自紧密双星聚结(CBC)的引力波进行贝叶斯参数估计通常需要在描述双星的不同参数值下进行数百万次模板波形计算。抽样技术,如马尔可夫链蒙特卡罗和嵌套抽样评估的可能性,并因此计算模板波形,串行,因此,分析的总计算时间与模板生成的线性比例。在这里,我们解决的问题,快速计算的似然函数的CBC来源与非旋转组件。我们展示了如何有效地计算连续似然函数的三维子空间上的参数,它有一个非平凡的依赖(啁啾质量,对称质量比和聚结时间)通过插值。随后,对该插值似然函数进行采样是一个比直接评估似然性便宜得多的计算过程;我们报告了两到三个数量级的计算时间改进,同时保持似然性准确度<0.025%。在CBC质量空间的很大一部分上生成似然函数的插值在计算上是昂贵的,但高度并行化,因此壁时间相对于完整参数估计分析的时间可以非常小。
英文摘要:
Bayesian parameter estimation on gravitational waves from compact binary coalescences (CBCs) typically requires millions of template waveform computations at different values of the parameters describing the binary. Sampling techniques such as Markov chain Monte Carlo and nested sampling evaluate likelihoods, and hence compute template waveforms, serially; thus, the total computational time of the analysis scales linearly with that of template generation. Here we address the issue of rapidly computing the likelihood function of CBC sources with non-spinning components. We show how to efficiently compute the continuous likelihood function on the three-dimensional subspace of parameters on which it has a non-trivial dependence (the chirp mass, symmetric mass ratio and coalescence time) via interpolation. Subsequently, sampling this interpolated likelihood function is a significantly cheaper computational process than directly evaluating the likelihood; we report improvements in computational time of two to three orders of magnitude while keeping likelihoods accurate to < 0.025 %. Generating the interpolant of the likelihood function over a significant portion of the CBC mass space is computationally expensive but highly parallelizable, so the wall time can be very small relative to the time of a full parameter-estimation analysis.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。