清华大学 航天航空学院,北京,100084
王思元,博士研究生,研究方向:计算流体力学. E-mail:wangsiyuan25@mails.tsinghua.edu.cn
周涵宇,博士研究生,研究方向:计算流体力学. E-mail:zhy22@mails.tsinghua.edu.cn
任玉新*,博士生导师,教授,研究方向:计算流体力学. E-mail:ryx@tsinghua.edu.cn
纸质出版:2026
移动端阅览
王思元, 周涵宇, 任玉新. 基于风雷软件的壁面距离场的快速迭代并行求解方法[J]. 空气动力学学报, 2026, 44(3): 109−122.
Wang Siyuan, Zhou Hanyu, Ren Yuxin. A parallel fast iteration method for wall distance implemented in PHengLEI[J]. 2026, 44(3): 109-122.
王思元, 周涵宇, 任玉新. 基于风雷软件的壁面距离场的快速迭代并行求解方法[J]. 空气动力学学报, 2026, 44(3): 109−122. DOI: 10.7638/kqdlxxb-2025.0260
Wang Siyuan, Zhou Hanyu, Ren Yuxin. A parallel fast iteration method for wall distance implemented in PHengLEI[J]. 2026, 44(3): 109-122. DOI: 10.7638/kqdlxxb-2025.0260.
计算流体力学(computational fluid dynamics
CFD)中,网格的壁面距离场对雷诺平均Navier-Stokes(Reynolds-averaged Navier-Stokes
RANS)模型计算、重叠网格组装、富集函数方法等起到基础性作用。非结构网格上的距离场计算主要分为搜索方法、偏微分方程方法以及迭代方法等。快速迭代方法(fast iteration method
FIM)是一种适用于非结构网格的迭代算法,具有效率高、稳定性好的特点。本文基于国产开源CFD软件风雷平台(PHengLEI),探索并实现了这一算法。为适配风雷软件的数据结构并提高计算效率,本文将FIM方法改造为格心格式,设计了一种基于格心插值的几何对偶控制体算法,充分复用CFD并行数据结构;同时,为加速三维计算,本文将FIM的三维局部优化算法改为解析形式,提升了计算效率。在测试中,本文发现FIM方法与风雷软件原有ADT(alternating digital tree)方法相比,距离场求解误差很小,对基于SA(Spalart-Allmaras)模型模拟的CFD计算结果影响可忽略不计;同时,当网格规模超过千万且壁面网格数量超过数十万时,FIM方法相比ADT方法加速可达4倍。总体而言,FIM方法在保证计算精度的同时,在并行扩展能力与计算效率方面相比风雷软件原有方法具有明显的优势,具备良好的应用前景。本文所用代码与算例已上传至开源平台。
In CFD simulations
the wall-distance field plays a fundamental role in RANS-model computations
overset-grid assembly
enrichment-function methods
and related procedures. On unstructured meshes
distance-field computation typically falls into three categories: search-based methods
partial-differential-equation (PDE) methods
and iterative methods. Within the class of iterative methods
the Fast Iterative Method (FIM) is well suited to unstructured meshes and offers both high efficiency and good robustness. This work therefore presents the implementation of FIM on the domestic open-source CFD platform PHengLei. To accommodate PHengLei’s data structures and improve computational performance
we reformulate FIM into a cell-centered scheme
designing a parallel FIM algorithm that relies solely on the degrees of freedom located at cell centers by introducing a dual control volume based on cell-centered interpolation. In addition
to accelerate three-dimensional computations
we derive a closed-form analytical expression for the local optimization step in 3D FIM
further enhancing efficiency. Tests show that
compared with PHengLei’s original ADT (Alternating Digital Tree)-based method
the present FIM approach yields sufficiently small wall-distance errors and introduces negligible differences in CFD solutions based on the Spalart–Allmaras (SA) model. When the mesh contains more than ten million cells and the wall-cell count exceeds several hundred thousand
FIM achieves up to a fourfold speedup over the ADT method. Overall
the FIM method demonstrates acceptable accuracy while exhibiting substantially better parallel scalability and computational efficiency than PHengLei’s existing approach
showing promising potential for practical application. The source code and test cases used in this work have been made available on an open-source platform.
Spalart P, Allmaras S. A one-equation turbulence model for aerodynamic flows[C]// 30th Aerospace Sciences Meeting and Exhibit, Reston, Virginia: AIAA, 1992.
Menter F. Zonal two equation k-w turbulence models for aerodynamic flows[C ] // 23rd Fluid Dynamics, Plasmadynamics, and Lasers Conference, Reston, Virginia: AIAA, 1993. doi: 10.2514/6.1993-2906
Kang Z L, Yan C, Yu J, et al. A fast and reliable overset unstructured grids approach[J]. Acta Mechanica Sinica, 2013, 29(2): 149−157. doi: 10.1007/s10409-013-0021-6
Xu X R, Ren Y X. Resolving turbulent boundary layer on coarse grid using function enrichment based on variational reconstructions[J]. Physics of Fluids, 2022, 34(12): 125106. doi: 10.1063/5.0124478
Srinark T, Kambhamettu C. A Novel method for 3D surface mesh segmentation[C]//Proceedings of the Computer Graphics and Imaging, 2003.
Wald I. Fast construction of SAH BVHs on the intel many integrated core (MIC) architecture[J]. IEEE Transactions on Visualization and Computer Graphics, 2012, 18(1): 47−57. doi: 10.1109/TVCG.2010.251
Meister D, Bittner J. Parallel locally-ordered clustering for bounding volume hierarchy construction[J]. IEEE Transactions on Visualization and Computer Graphics, 2018, 24(3): 1345−1353. doi: 10.1109/TVCG.2017.2669983
Beckmann N, Kriegel H P, Schneider R, et al. The R*-tree: An efficient and robust access method for points and rectangles[C]// Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, Atlantic City New Jersey USA. ACM, 1990: 322-331. doi: 10.1145/93597.98741
Larsson T, Akenine-Möller T. A dynamic bounding volume hierarchy for generalized collision detection[J]. Computers Graphics, 2006, 30(3): 450−459. doi: 10.1016/j.cag.2006.02.011
Hubbard P M. Collision detection for interactive graphics applications[J]. IEEE Transactions on Visualization and Computer Graphics, 1995, 1(3): 218−230. doi: 10.1109/2945.466717
Palmer I J, Grimsdale R L. Collision detection for animation using sphere-trees[J]. Computer Graphics Forum, 1995, 14(2): 105−116. doi: 10.1111/1467-8659.1420105
Kavan L, Ra J. Fast collision detection for skeletally deformable models[J]. Computer Graphics Forum, 2005, 24(3): 363−372. doi: 10.1111/j.1467-8659.2005.00861.x
Gottschalk S, Lin M C, Manocha D. OBBTree: a hierarchical structure for rapid interference detection[C]// Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques, ACM, 1996: 171-180. doi: 10.1145/237170.237244
Klosowski J T, Held M, Mitchell J S B, et al. Efficient collision detection using bounding volume hierarchies of k-DOPs[J]. IEEE Transactions on Visualization and Computer Graphics, 1998, 4(1): 21−36. doi: 10.1109/2945.675649
Zhang X, Diskin B, Walden A, et al. A wall-distance method for turbulence modeling[C]// Proceedings of the International Conference on Computational Fluid Dynamics (ICCFD12), Japan, 2024.
Roget B, Sitaraman J. Wall distance search algorithm using voxelized marching spheres[J]. Journal of Computational Physics, 2013, 241: 76−94. doi: 10.1016/j.jcp.2013.01.035
Tucker P G, Rumsey C L, Spalart P R, et al. Computations of wall distances based on differential equations[J]. AIAA Journal, 2005, 43(3): 539−549. doi: 10.2514/1.8626
Osher S, Sethian J A. Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations[J]. Journal of Computational Physics, 1988, 79(1): 12−49. doi: 10.1016/0021-9991(88)90002-2
Tucker P G. Differential equation-based wall distance computation for DES and RANS[J]. Journal of Computational Physics, 2003, 190(1): 229-248. doi: 10.1016/S0021-9991(03)00272-9
Spalding D B. Calculation of turbulent heat transfer in cluttered spaces[C]// Proceedings of the Proceedings 10th Int Heat Transfer Conference, Brighton, 1994.
Tucker P G. Hybrid Hamilton–Jacobi–Poisson wall distance function model[J]. Computers Fluids, 2011, 44(1): 130−142. doi: 10.1016/j.compfluid.2010.12.021
Wukie N A, Orkwis P D. A p -Poisson wall distance approach for turbulence modeling[C ] //Proc of the 23rd AIAA Computational Fluid Dynamics Conference, Denver, Colorado. Reston, Virginia: AIAA, 2017: 3945. doi: 10.2514/6.2017-3945
Huang Q M, Ren Y X, Wang Q. High order finite volume schemes for solving the non-conservative convection equations on the unstructured grids[J]. Journal of Scientific Computing, 2021, 88(2): 37. doi: 10.1007/s10915-021-01538-4
Sethian J A. A fast marching level set method for monotonically advancing fronts[J]. Proceedings of the National Academy of Sciences of the United States of America, 1996, 93(4): 1591−1595. doi: 10.1073/pnas.93.4.1591
Jeong W K, Whitaker R T. A fast iterative method for eikonal equations[J]. SIAM Journal on Scientific Computing, 2008, 30(5): 2512-2534. doi: 10.1137/060670298
Zhao H K. A fast sweeping method for Eikonal equations[J]. Mathematics of Computation, 2005, 74(250): 603−627. doi: 10.1090/s0025-5718-04-01678-3
Breuß M, Cristiani E, Gwosdek P, et al. An adaptive domain-decomposition technique for parallelization of the fast marching method[J]. Applied Mathematics and Computation, 2011, 218(1): 32−44. doi: 10.1016/j.amc.2011.05.041
Fu Z S, Jeong W K, Pan Y S, et al. A fast iterative method for solving the eikonal equation on triangulated surfaces[J]. SIAM Journal on Scientific Computing, 2011, 33(5): 2468−2488. doi: 10.1137/100788951
Fu Z S, Kirby R M, Whitaker R T. A fast iterative method for solving the eikonal equation on tetrahedral domains[J]. SIAM Journal on Scientific Computing, 2013, 35(5): C473−C494. doi: 10.1137/120881956
Qian J L, Zhang Y T, Zhao H K. Fast sweeping methods for eikonal equations on triangular meshes[J]. SIAM Journal on Numerical Analysis, 2007, 45(1): 83−107. doi: 10.1137/050627083
Tro S, Mera Evans T, Aslam T D, et al. A second-order distributed memory parallel fast sweeping method for the Eikonal equation[J]. Journal of Computational Physics, 2023, 474: 111785. doi: 10.1016/j.jcp.2022.111785
Zhao H K. Parallel implementations of the fast sweeping method[J]. Journal of Computational Mathematics, 2007, 25(4): 421−429.
Zhao Zhong, He Lei, He Xianyao. Design of general CFD software PHengLEI[J]. Computer Engineering and Science, 2020, 42(2): 210−219(in Chinese). doi: 10.3969/j.issn.1007-130X.2020.02.004
Chen Jianqiang, Ma Yankai, Min Yaobing, et al. Design and development of homogeneous hybrid solvers on National Numerical Windtunnel (NNW) PHengLEI[J]. Acta Aerodynamica Sinica, 2020, 38(6): 1102−1110(in Chinese). doi: 10.7638/kqdlxxb-2020.0177
0
浏览量
0
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621