采用高阶间断Galerkin格式和自适应网格加密的天体物理流体动力学
Astrophysical hydrodynamics with a high-order discontinuous Galerkin scheme and adaptive mesh refinement
摘要:
在许多天体物理模拟中,尽可能精确和有效地求解理想流体力学的欧拉方程是一个关键的要求。因此,重要的是不断推进目前天体物理学代码中采用的数值方法,特别是考虑到计算机技术的不断发展,计算机技术对某些计算方法的支持超过了其他方法。在这里,我们介绍了新的自适应网格加密(AMR)代码TENET,它采用了高阶间断伽辽金(DG)计划的流体动力学。该方法通过显式龙格-库塔时间积分和Gauss-Legendre积分,将欧拉方程组转化为多项式基的弱形式。这种方法提供了显着的优势,通常采用的二阶有限体积(FV)求解器。特别地,高阶能力使其在计算上更有效,在这个意义上,可以以显著更少的计算成本获得相同的精度。此外,DG方案固有地在没有限制发生的区域中保持角动量,并且它通常产生比FV方法小得多的数值扩散和平流误差。另一个优点在于AMR细化边界的更自然的处理,其中可以避免回退到一阶。最后,DG在高阶不需要宽的扩展,并且提供了改进的数据局部性和对局部计算的关注,这对于当前和即将到来的高度并行的超级计算机是有利的。我们描述了我们的新代码的制定和实施细节,并展示了它的性能和准确性与一组二维和三维的测试问题。结果证实,DG计划有很高的潜力,天体物理应用。
英文摘要:
Solving the Euler equations of ideal hydrodynamics as accurately and efficiently as possible is a key requirement in many astrophysical simulations. It is therefore important to continuously advance the numerical methods implemented in current astrophysical codes, especially also in light of evolving computer technology, which favours certain computational approaches over others. Here we introduce the new adaptive mesh refinement (AMR) code TENET, which employs a high order discontinuous Galerkin (DG) scheme for hydrodynamics. The Euler equations in this method are solved in a weak formulation with a polynomial basis by means of explicit Runge-Kutta time integration and Gauss-Legendre quadrature. This approach offers significant advantages over commonly employed second order finite volume (FV) solvers. In particular, the higher order capability renders it computationally more efficient, in the sense that the same precision can be obtained at significantly less computational cost. Also, the DG scheme inherently conserves angular momentum in regions where no limiting takes place, and it typically produces much smaller numerical diffusion and advection errors than a FV approach. A further advantage lies in a more natural handling of AMR refinement boundaries, where a fall-back to first order can be avoided. Finally, DG requires no wide stencils at high order, and offers an improved data locality and a focus on local computations, which is favourable for current and upcoming highly parallel supercomputers. We describe the formulation and implementation details of our new code, and demonstrate its performance and accuracy with a set of two- and three-dimensional test problems. The results confirm that DG schemes have a high potential for astrophysical applications.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。