Xu Lei, Chen Rongliang, Cai Xiao-Chuan
Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen 518055, China.
Shenzhen Key Laboratory for Exascale Engineering and Scientific Computing, Shenzhen 518055, China.
Phys Rev E. 2021 Feb;103(2-1):023306. doi: 10.1103/PhysRevE.103.023306.
In this paper, a finite-volume discrete Boltzmann method based on a cell-centered scheme for inviscid compressible flows on unstructured grids is presented. In the new method, the equilibrium distribution functions are obtained from the circle function in two-dimensions (2D) and the spherical function in three-dimensions (3D). Moreover, the advective fluxes are evaluated by Roe's flux-difference splitting scheme, the gradients of the density and total energy distribution functions are computed with a least-squares method, and the Venkatakrishnan limiter is employed to prevent oscillations. To parallelize the method we use a graph-based partitioning approach that also guarantees the load balancing. The method is validated by seven benchmark problems: (a) a 2D flow pasting a bump, (b) a 2D Riemann problem, (c) a 2D flow passing the RAE2822 airfoil, (d) flows passing the NACA0012 airfoil, (e) 2D supersonic flows around a cylinder, (f) an explosion in a 3D box, and (g) a 3D flow around the ONERA M6 wing. The benchmark tests show that the results obtained by the proposed method match well with the published results, and the parallel numerical experiments show that the proposed parallel implementation has close to linear strong scalability, and parallel efficiencies of 95.31% and 94.56% are achieved for 2D and 3D problems on a supercomputer with up to 4800 processor cores, respectively.
本文提出了一种基于单元中心格式的有限体积离散玻尔兹曼方法,用于求解非结构网格上的无粘可压缩流。在新方法中,二维(2D)的平衡分布函数由圆函数得到,三维(3D)的平衡分布函数由球函数得到。此外,对流通量通过Roe通量差分裂格式进行评估,密度和总能分布函数的梯度采用最小二乘法计算,并采用Venkatakrishnan限制器来防止振荡。为了使该方法并行化,我们使用了一种基于图的分区方法,该方法也保证了负载平衡。该方法通过七个基准问题进行了验证:(a)二维绕凸起流动,(b)二维黎曼问题,(c)二维绕RAE2822翼型流动,(d)绕NACA0012翼型流动,(e)二维圆柱绕流,(f)三维箱体内爆炸,(g)三维绕ONERA M6机翼流动。基准测试表明,该方法得到的结果与已发表的结果吻合良好,并行数值实验表明,所提出的并行实现具有接近线性的强扩展性,在一台拥有多达4800个处理器核心的超级计算机上,二维和三维问题的并行效率分别达到了95.31%和94.56%。