首页> 外文期刊>Mathematical Problems in Engineering: Theory, Methods and Applications >Study and Verification of Large-Scale Parallel Mesh Generation Algorithm for Centrifugal Pump
【24h】

Study and Verification of Large-Scale Parallel Mesh Generation Algorithm for Centrifugal Pump

机译:离心泵大规模并行网格生成算法的研究与验证

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

In order to reveal the details of the internal flow in a centrifugal pump, a large-scale mesh is needed. However, the mesh generated by the serial grid algorithm cannot meet the calculation requirements due to the huge amount of time. A large-scale parallel mesh generation algorithm of a centrifugal pump for high-performance computers is presented in this paper. First, a grid point set for the 3D Delaunay triangular mesh on the surface of the centrifugal pump is generated. Then, the S-H (Sutherland-Hodgman) algorithm for cropping and segmenting these grid point sets on the surface is employed. A uniform boundary mesh is generated and is divided into different subregions. In addition, in order to ensure the consistency of the interface mesh and to avoid the boundary mesh intersection overlap error, a parallel constrained Delaunay mesh generation algorithm based on region numbering is proposed, which can improve the quality and efficiency of the generated parallel mesh. Finally, the centrifugal pump is tested for verifying the parallel mesh algorithm in the Tianhe-2 supercomputer. PIV (particle image velocimetry) internal flow experiment is comparatively analyzed with the numerical simulation of large-scale mesh. The results show that the algorithm can generate 10(8) 3D unstructured grid elements in 5 minutes, and the parallel efficiency can achieve 80. The proposed algorithm not only ensures high grid quality with the serial grid algorithm but also accurately simulates the flow law in the centrifugal pump. The double-vortex structure which is obtained by PIV experiment is captured by the large-scale mesh.
机译:为了揭示离心泵内部流动的细节,需要一个大型的网格。然而,由于时间长,串行网格算法生成的网格无法满足计算要求。该文提出了一种用于高性能计算机的离心泵的大规模并行网格生成算法。首先,生成离心泵表面上 3D Delaunay 三角形网格的网格点集;然后,采用S-H(Sutherland-Hodgman)算法对曲面上的这些网格点集进行裁剪和分割。生成一个统一的边界网格,并将其划分为不同的子区域。此外,为了保证界面网格的一致性,避免边界网格交集重叠误差,该文提出一种基于区域编号的并行约束Delaunay网格生成算法,该算法可以提高生成平行网格的质量和效率。最后,对离心泵进行了测试,验证了天河二号超级计算机中的并行网格算法。将PIV(粒子图像测速)内流实验与大尺度网格数值模拟进行了比较分析。结果表明,该算法可在5 min内生成10(8)个3D非结构化网格单元,并行效率可达80%。该算法不仅保证了串联网格算法的高网格质量,而且精确模拟了离心泵中的流动规律。通过PIV实验得到的双涡流结构被大尺度网格捕获。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号