Abstract

The discrete unified gas kinetic scheme (DUGKS) is a recently devised approach to simulate multiscale flows based on the kinetic models, which also shows distinct features for continuum flows. Most of the existing DUGKS are sequential or based on structured grids, thus limiting their scope of application in engineering. In this paper, a parallel DUGKS for inviscid high-speed compressible flows on unstructured grids is proposed. In the framework of the DUGKS, the gradients of the distribution functions are calculated by a least-square method. To parallelize the method, a graph-based partitioning method is employed to guarantee the load balancing and minimize the communication among processors. The method is validated by several benchmark problems, i.e., a two-dimensional (2D) Riemann problem, 2D subsonic flows passing two benchmark airfoils, a 2D regular shock reflection problem, 2D supersonic flows (Mach numbers are 3 and 5) around a cylinder, an explosion in a three-dimensional (3D) box, a 3D subsonic flow around the Office National d'Etudes et de Recherches Aérospatiales M6 wing, a 3D hypersonic flow (Mach number is 10) around a hemisphere, and a supersonic flow over the Northrop YF-17 fighter model. The numerical results show good agreement with the published results, and the present method is robust for a wide range of Mach numbers, from subsonic to hypersonic. The parallel performance results show that the proposed method is highly parallel scalable, where an almost linear scalability with 93% parallel efficiency is achieved for a 3D problem with over 55 × 106 tetrahedrons on a supercomputer with up to 4800 processors.

Full Text
Paper version not known

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 call

Disclaimer: 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.