An efficient algorithm for the calculation of sub-grid distances for higher-order LBM boundary conditions in a GPU simulation environment. (1st January 2020)

• Record Type: Journal Article
• Authors: Mierke, D.; Janßen, C.F.; Rung, T.
• Is Part Of: Computers & mathematics with applications. Volume 79:issue 1(2020)
• Page Start: 66
• Page End: 87
• Publication Date: 2020-01-01
• Subjects: LBM -- Grid generation -- Sub-grid distances -- Linear-interpolated bounce-back -- Graphics processing unit (GPU); Electronic data processing -- Periodicals; Mathematics -- Data processing -- Periodicals; 510.28541
• DOI: 10.1016/j.camwa.2018.04.022
• Languages: English
• ISSNs: 0898-1221

Abstract

Abstract: This paper presents a new and efficient algorithm for the calculation of sub-grid distances in the context of a lattice Boltzmann method (LBM). LBMs usually operate on equidistant Cartesian grids and represent moving geometries by either using immersed boundary conditions or dynamic fill algorithms in combination with slip or no-slip boundary conditions. In order to obtain sufficiently high geometric accuracy, the sub-grid distances from Eulerian fluid nodes on uniform and structured grids to a tessellated triangular surface mesh have to be calculated. The proposed algorithm extends a previously published grid generation procedure by an efficient calculation of sub-grid distances. The algorithm is optimized for massively parallel execution on graphics processing units (GPUs). Based on a linearized representation of the obstacle surface, surface normal vectors are computed and stored, which then serve to compute the sub-grid distances. This saves GPU memory, re-uses information that is available from the surface voxelization step, and has shown to be very accurate and efficient for the implementation in a state-of-the-art LBM-GPU solver.