Abstract

For the thermal–fluid–structure interaction (TFSI) problems with moving boundaries, the original implicit boundary condition-enforced immersed boundary method (IBM) by Wang et al. [1] has to generate a large correlation matrix and compute its inversion at each iteration, implying that the virtual memory requirement and computational cost would grow exponentially with the number of Lagrangian points. In this work, we proposed an efficient explicit boundary condition-enforced immersed boundary method for Neumann boundary condition (NBC) to achieve high computational efficiency and maintain similar accuracy as the original implicit IBM [1], which circumvents the needs to assemble a large correlation matrix and inverse it in the original implicit IBM [1] through second-order approximation based on the error analysis using Taylor series expansion. Most importantly, the proposed explicit IBM can efficiently solve practical physics problems with a tremendous amount of Lagrangian points involving Neumann boundary condition. The comparisons of the virtual memory and computational cost between the explicit and implicit IBMs demonstrate that the explicit boundary condition-enforced IBM is not only computational efficient, but also has memory saving performance. The proposed explicit IBM integrated with the reconstructed thermal lattice Boltzmann flux solver (RTLBFS) is validated with some classical benchmarks, and the results show that the proposed explicit IBM can successfully resolve TFSI problems with Neumann boundary condition.

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.