Abstract
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 108 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.
Highlights
Centrifugal pump has strong rotation and large curvature, which usually requires a large-scale mesh of hundreds of millions of scales to reveal the complex turbulent flow
E mesh diagram of the centrifugal pump impeller water body of 108 grid elements is generated in parallel by the algorithm under 24 processor cores at one node, which can be finished in 5 minutes. erefore, in general, the proposed parallel mesh generation algorithm can effectively break through the limitation of existing serial programs on grid scale compared with existing serial mesh generation programs. e proposed parallel mesh generation algorithm can play a good acceleration effect and greatly reduces the generation time of large-scale mesh with the same number of meshes
A large-scale parallel mesh generation algorithm is proposed based on continuous domain decomposition, and the largescale meshing and numerical calculation of the centrifugal pump in the Tianhe-2 supercomputer is carried out to illustrate the efficiency and quality of the generated mesh. e conclusion is as follows: (1) e proposed algorithm is based on continuous domain decomposition. e mesh on the bounding surface with the same node data is obtained, and different subregions are divided through the S-H polygon clipping algorithm. e problem of sharp angle and long and narrow face, which are generated when complex geometry is decomposed into discrete region, can be solved by the proposed algorithm
Summary
Centrifugal pump has strong rotation and large curvature, which usually requires a large-scale mesh of hundreds of millions of scales to reveal the complex turbulent flow. (1) e triangulated mesh of the model surface is input (2) e internal description of the subregion is obtained by polygon clipping algorithm (3) e triangular faces of each face are clipped to obtain a geometric description of the interior of the subregion ere are four situations (see Figure 1) to consider for cropping the edges of a polygon with clipping boundaries, and the processing method is as follows:. Chew et al [26] proposed a parallel constrained meshing algorithm based on the constrained Delaunay triangulation (CDT), which used the method of splitting data on the transmission edge of the adjacent subregion to ensure the consistency of the interface mesh and ensure parallel efficiency. In order to solve the problem, a parallel constrained Delaunay mesh generation algorithm based on region numbering is proposed in this paper. Rough the parallel constrained Delaunay mesh generation algorithm based on region numbering, and the parallel mesh generation guarantees the consistency of the mesh near the interface. e algorithm can avoid the boundary mesh intersection overlap error, which can reduce the operation of grid repair or interface redivision when the mesh quality does not meet the requirements. e quality and efficiency of parallel mesh generation algorithm can be guaranteed by this algorithm
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
