A moving-mesh hydrodynamic solver for ChaNGa
A moving-mesh hydrodynamic solver for ChaNGa
复制标题
ChaNGa 的移动网格流体动力求解器
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
U. Washington
中科院分区：
文献类型：
--
作者：
P. Chang;J. Wadsley;Thomas R. Quinn University of Wisconsin;Mcmaster University;U. Washington
介绍了大型并行程序Charm N体重力解算器(CHAGA)中移动网格流体力学解算器的结构和实现。虽然我们的算法在很大程度上基于Springel(2010)在AREPO中实现的算法，但我们的算法在几个方面有所不同。我们描述了使用Voronoi镶嵌库Voro++直接计算Voronoi镶嵌库。我们还结合了在梯度估计和重建方面的一些最新进展，以最小的计算成本提供了更好的流体动力学解的精度。我们针对Changa中包含的光滑粒子流体动力学解算器，用一小组测试问题来验证此模块。最后，我们研究了一个涉及两个主序星合并的科学问题的例子，并强调了光滑粒子和移动网格流体力学之间的微小定量差异。我们最后讨论了预期的未来改进和进步。
We describe the structure and implementation of a moving-mesh hydrodynamics solver in the large-scale parallel code, Charm N-body GrAvity solver (ChaNGa). While largely based on the algorithm described by Springel (2010) that is implemented in AREPO, our algorithm differs a few aspects. We describe our use of the Voronoi tessellation library, VORO++, to compute the Voronoi tessellation directly. We also incorporate some recent advances in gradient estimation and reconstruction that gives better accuracy in hydrodynamic solutions at minimal computational cost. We validate this module with a small battery of test problems against the smooth particle hydrodynamics solver included in ChaNGa. Finally, we study one example of a scientific problem involving the mergers of two main sequence stars and highlight the small quantitative differences between smooth particle and moving-mesh hydrodynamics. We close with a discussion of anticipated future improvements and advancements.