A grid-independent particle pairing strategy for DSMC
Introduction
The coupling of a Direct Simulation Monte Carlo (DSMC) particle code with other simulation methods (e.g. Particle in Cell (PIC), Low Diffusion) often leads to conflicting requirements for the simulation grid. For example, in a coupled PIC-DSMC code for the simulation of rarefied and partially charged gases, the individual requirements for the grid lead to a cell size in the range of the Debye length for the PIC method [1], whereas the DSMC method needs cells of the size of the mean free path [2]. These two values can differ by several orders of magnitude depending on the gas conditions. Hence, the optimal grid for the PIC method can vary significantly from the optimal grid for the DSMC method. The use of different grids for each method, assisted by a subsequent coupling of these grids is one possible solution. However, the additional effort of applying two, sometimes adaptive, grids and the additional computational costs are problematic. This strategy also leads to higher complexity, which is unfavourable for an efficient parallelization. Finally, a grid for every coupled method is unfeasible, if more than two methods are coupled.
A strategy is suggested here as a step towards a grid independent DSMC method. A Quad Tree Sort method [3] in combination with a Nearest Neighbour algorithm [4] is discussed in section two. This combination is used in order to achieve a DSMC method largely independent of the grid. In section three, the Green–Kubo theory [5], [6], [7] is reviewed and extended to the NN algorithm. Finally, the grid independence and the Green–Kubo theory are verified by a Couette flow simulation [8] in section four.
Section snippets
Nearest Neighbour (NN)
The basic idea of the DSMC is to simulate gas flows as a particle stream. Simulating each real particle is impossible due to the vast particle number . Thus, a weighting factor Wis used leading to a number of simulated particles representing a number of real particles . These particles move without intermolecular interactions through the computational domain for a certain time and perform collisions with each other after , for which collision pairs have to be
Cell size dependence of transport coefficients
Specific constraints of the DSMC method are the required time and space discretization. It is assumed that the time step , so the error in time discretization can be neglected. For the spatial discretization, the Green–Kubo theory may be used to estimate the cell size effects on the transport coefficients. In the following, the calculation of the viscosity coefficient as a function of the cell size of the regular DSMC pairing method is reviewed and afterwards extended to the case of the
Results
Before discussing the cell size effect, the NN and the QTS algorithms are verified. Additionally, the benefit of the QTS is demonstrated. For the discussion of the cell size effects on viscosity, the simulation of a plane Couette flow is chosen for both the classical and the new DSMC method. Here, a stationary gas between two plane surfaces moving in opposite x directions with the constant velocity is simulated. Both walls are defined as diffuse reflecting surfaces at a temperature
Conclusion and outlook
This article describes a method that allows physically correct pairing of particles for collisions in DSMC simulations, independent of the simulation grid. For this, a combination of methods is used, comprising a Nearest Neighbour (NN) search and a Quad Tree Sort (QTS) algorithm. The NN algorithm leads to results almost independent of the grid, while the QTS is used to reduce the computational costs to a more practicable level. The NN algorithm and its consequences for the calculation of the
Acknowledgments
The authors gratefully thank the Deutsche Forschungsgemeinschaft (DFG) for funding this research within the project “Kinetic Algorithms for the Maxwell–Boltzmann System and the Simulation of Magnetospheric Propulsion Systems”.
References (12)
- et al.
Gridless DSMC
Journal of Computational Physics
(2008) - et al.
Plasma Physics via Computer Simulation
(1991) Molecular Gas Dynamics and the Direct Simulation of Gas Flows
(1994)- G.J. LeBeau, K.A. Boyles, F.E. Lumpkin, Virtual sub-cells for the direct simulation monte carlo method, in: 41st...
Calculation of hard-sphere viscosity by means of correlation functions
Journal of Chemical Physics
(1964)- et al.
Cell size dependence of transport coefficients in stochastic particle algorithms
Physics of Fluids
(1998)
Cited by (24)
Hybrid parallelization of Euler–Lagrange simulations based on MPI-3 shared memory
2022, Advances in Engineering SoftwareAn optimal O(N) scheme for simulations of colliding, particle-laden flows on unstructured grids
2020, Journal of Computational PhysicsCitation Excerpt :In tree-based methods, data is stored as successive branches stemming from one root node. For example, in the case of oct- or quadtrees as in [26], a single bounding box may be placed around the domain of interest, acting as the root node into which all particles fall. This box could then be divided into 8 smaller boxes, each containing only a fraction of the particles, which could then be further subdivided and so on.
A particle localization algorithm on unstructured curvilinear polynomial meshes
2019, Computer Physics CommunicationsTree code for collision detection of large numbers of particles applied to the Breit–Wheeler process
2018, Journal of Computational PhysicsCitation Excerpt :Only particles, that are in partitions close to each other, interact. Other octree-based codes exist [2], [3], that deal with the interaction of particles in a mesh-less simulation codes, usually focusing on Monte-Carlo algorithms for computing collisions. In plasma physics Particle-in-Cell (PIC) codes [4][5] are regularly used.
Three-dimensional implementation of the Low Diffusion method for continuum flow simulations
2017, Computer Physics CommunicationsCitation Excerpt :Further application areas of PICLas include the simulation of electric propulsion systems and atmospheric entry maneuvers [16,17]. Both parts of PICLas are continuously further developed, resulting for example in advanced field solvers [18] as well as in innovative particle treatment models [19,13,20,21]. The focal point is always a modular design of PICLas in order to ensure a high level of flexibility.