TY - GEN
T1 - An adaptive particle tracking algorithm for lagrangian-eulerian simulations of dispersed multiphase flows
AU - Ge, Wenjun
AU - Sankaran, Ramanan
N1 - Publisher Copyright:
© 2019 by German Aerospace Center (DLR). Published by the American Institute of Aeronautics and Astronautics, Inc.
PY - 2019
Y1 - 2019
N2 - The Lagrangian-Eulerian method is broadly used for simulations of dispersed multiphase flows by solving the continuous phase in the Eulerian framework while treating the dispersed phase as point particles in a Lagrangian framework. The accuracy of the Lagrangian-Eulerian method largely depends on the number of computational particles tracked for the Lagrangian phase. In this study, an adaptive Lagrangian particle tracking algorithm is proposed to bal-ance the statistical error and the computational cost by dividing and merging the particles according to the local particle statistics in the computational domain. The computational particles are considered as weighted sampling points of the particle probability density functions (PDF) which represents a statistical equivalence of the Lagrangian phase. The algorithm is implemented as a part of a C++ library for Lagrangian particles, Grit, with performance portability to multi-core or many-core CPUs and Graphic Processing Unit (GPU) architectures. The accuracy of the proposed algorithm with two different schemes are studied through a test problem with analytical solutions for both the particle number density and momentum source term. The results are used to evaluate the proposed algorithm as well as to validate the parallel implementation.
AB - The Lagrangian-Eulerian method is broadly used for simulations of dispersed multiphase flows by solving the continuous phase in the Eulerian framework while treating the dispersed phase as point particles in a Lagrangian framework. The accuracy of the Lagrangian-Eulerian method largely depends on the number of computational particles tracked for the Lagrangian phase. In this study, an adaptive Lagrangian particle tracking algorithm is proposed to bal-ance the statistical error and the computational cost by dividing and merging the particles according to the local particle statistics in the computational domain. The computational particles are considered as weighted sampling points of the particle probability density functions (PDF) which represents a statistical equivalence of the Lagrangian phase. The algorithm is implemented as a part of a C++ library for Lagrangian particles, Grit, with performance portability to multi-core or many-core CPUs and Graphic Processing Unit (GPU) architectures. The accuracy of the proposed algorithm with two different schemes are studied through a test problem with analytical solutions for both the particle number density and momentum source term. The results are used to evaluate the proposed algorithm as well as to validate the parallel implementation.
UR - http://www.scopus.com/inward/record.url?scp=85083942246&partnerID=8YFLogxK
U2 - 10.2514/6.2019-0728
DO - 10.2514/6.2019-0728
M3 - Conference contribution
AN - SCOPUS:85083942246
SN - 9781624105784
T3 - AIAA Scitech 2019 Forum
BT - AIAA Scitech 2019 Forum
PB - American Institute of Aeronautics and Astronautics Inc, AIAA
T2 - AIAA Scitech Forum, 2019
Y2 - 7 January 2019 through 11 January 2019
ER -