Automatic mesh refinement and parallel load balancing for Fokker-Planck-DSMC algorithm
Automatic mesh refinement and parallel load balancing for Fokker-Planck-DSMC algorithm
复制标题
DOI：
10.1016/j.jcp.2018.02.049
复制
发表时间：
2018-06
期刊：
影响因子：
--
通讯作者：
S. Küchlin;P. Jenny
中科院分区：
文献类型：
--
作者：
S. Küchlin;P. Jenny
最近，作者提出了一种并行Fokker-Planck-DSMC算法，用于计算所有努森数下的稀薄气体流动。Fokker-Planck-DSMC算法(FP-DSMC)是对经典的DSMMC算法的扩展，它在计算量上缓解了纯DSMMC算法接近连续介质的不足。在每个时间步长，基于局部Knudsen数准则，离散的DSMC碰撞算子被动态地切换到Fokker-Planck算子，该算子基于连续随机过程的时间积分，并且具有固定的每粒子计算代价，而不是每次碰撞。在这一贡献中，我们提出了一个扩展的实现，自动局部网格细化和并行负载平衡。特别是，我们展示了空间填充曲线的离散逼近的性质如何能够有效地实现。典型的数值研究突出了新代码的能力。
Recently, a parallel Fokker–Planck-DSMC algorithm for rarefied gas flow simulation in complex domains at all Knudsen numbers was developed by the authors.Fokker–Planck-DSMC (FP-DSMC) is an augmentation of the classical DSMC algorithm, which mitigates the near-continuum deficiencies in terms of computational cost of pure DSMC. At each time step, based on a local Knudsen number criterion, the discrete DSMC collision operator is dynamically switched to the Fokker–Planck operator, which is based on the integration of continuous stochastic processes in time, and has fixed computational cost per particle, rather than per collision. In this contribution, we present an extension of the previous implementation with automatic local mesh refinement and parallel load-balancing. In particular, we show how the properties of discrete approximations to space-filling curves enable an efficient implementation. Exemplary numerical studies highlight the capabilities of the new code.