arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1504.07609gr-qc
收藏

数值相对论中高阶网格加密格式的一致性框架

Toward a Consistent Framework for High Order Mesh Refinement Schemes in Numerical Relativity

Bishop Mongwane

摘要:

在数值相对论领域中,将高阶差分格式与网格加密算法相结合已成为一种习惯。为此,不同的修改标准的Berger-Oliger自适应网格细化算法已被提出。在这项工作中,我们提出了一个四阶稳定的网格加密方案与子循环的时间数值相对论。我们不使用缓冲区来处理细化边界,但明确指定细化网格的边界数据。我们认为,不兼容的标准网格细化算法与高阶龙格库塔方法是一种降阶现象的表现,所造成的不一致的应用边界数据在细化网格。我们的方案还解决了传播波穿过网格细化边界时产生的伪反射问题。我们引入了一个过渡区内的传播模式的相速度允许减速,以顺利地匹配粗网格的相速度细化水平。我们应用该方法来测试问题,涉及传播波,并显示出显着减少虚假反射。

英文摘要:

It has now become customary in the field of numerical relativity to couple high order finite difference schemes to mesh refinement algorithms. To this end, different modifications to the standard Berger-Oliger adaptive mesh refinement algorithm have been proposed. In this work we present a fourth order stable mesh refinement scheme with sub-cycling in time for numerical relativity. We do not use buffer zones to deal with refinement boundaries but explicitly specify boundary data for refined grids. We argue that the incompatibility of the standard mesh refinement algorithm with higher order Runge Kutta methods is a manifestation of order reduction phenomena, caused by inconsistent application of boundary data in the refined grids. Our scheme also addresses the problem of spurious reflections that are generated when propagating waves cross mesh refinement boundaries. We introduce a transition zone on refined levels within which the phase velocity of propagating modes is allowed to decelerate in order to smoothly match the phase velocity of coarser grids. We apply the method to test problems involving propagating waves and show a significant reduction in spurious reflections.

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

↑