arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1105.3269astro-ph.COastro-ph.GA
收藏

ARGOT:基于八叉树的网格加速辐射转移

ARGOT: Accelerated radiative transfer on grids using oct-tree

Takashi Okamoto, Kohji Yoshikawa, Masayuki Umemura

摘要:

我们提出了两种类型的数值处方,加快周围的点源的辐射转移计算在三维笛卡尔网格使用八叉树结构的辐射源的分布。在一个处方中,当远距离辐射源的角度大小$θ_{\rm s}$小于临界值$θ_{\rm crit}$时,远距离辐射源被分组为明亮的扩展源,并且辐射转移在角度大小与源组的角度大小相似的超网格上求解。超网格结构是通过对网格结构进行粗粒化来构造的。该方法的计算时间尺度为$N_{\rm m} \log(N_{\rm m}) \log(N_{\rm s})$,其中$N_{\rm m}$和$N_{\rm s}$分别为网格数和辐射源数。虽然这种方法是非常有效的,它不可避免地高估了光学深度时,一组源作为一个扩展的强大的辐射源,并影响遥远的网格。在另一种方法中,将一组远距离的辐射源视为一个亮点源,忽略该组辐射源的空间范围,并在网格上而不是在超网格上求解辐射转移。该处方只是Hasegawa & Umemura的{ \scriptsize START}的基于网格的版本,并且通常产生更好的结果,而计算成本($\propto N_{\rm m}^{4/3} \log(N_{\rm s})$)略高于超网格处方。我们的方法可以很容易地实现任何基于网格的流体动力学代码,非常适合自适应网格加密方法。

英文摘要:

We present two types of numerical prescriptions that accelerate the radiative transfer calculation around point sources within a three-dimensional Cartesian grid by using the oct-tree structure for the distribution of radiation sources. In one prescription, distant radiation sources are grouped as a bright extended source when the group's angular size, $θ_{\rm s}$, is smaller than a critical value, $θ_{\rm crit}$, and radiative transfer is solved on supermeshes whose angular sizes are similar to that of the group of sources. The supermesh structure is constructed by coarse-graining the mesh structure. With this method, the computational time scales with $N_{\rm m} \log(N_{\rm m}) \log(N_{\rm s})$ where $N_{\rm m}$ and $N_{\rm s}$ are the number of meshes and that of radiation sources, respectively. While this method is very efficient, it inevitably overestimates the optical depth when a group of sources acts as an extended powerful radiation source and affects distant meshes. In the other prescription, a distant group of sources is treated as a bright point source ignoring the spatial extent of the group and the radiative transfer is solved on the meshes rather than the supermeshes. This prescription is simply a grid-based version of {\scriptsize START} by Hasegawa & Umemura and yields better results in general with slightly more computational cost ($\propto N_{\rm m}^{4/3} \log(N_{\rm s})$) than the supermesh prescription. Our methods can easily be implemented to any grid-based hydrodynamic codes and are well-suited to the adaptive mesh refinement methods.

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

↑