Low Mach number lattice Boltzmann model for turbulent combustion: flow in confined geometries
Authors: S. A. Hosseini, N. Darabiha, D. Thevenin
Abstract: A hybrid lattice Boltzmann/finite-difference solver for low Mach thermo-compressible flows developed in earlier works is extended to more realistic and challenging configurations involving turbulence and complex geometries in the present article. The major novelty here as compared to previous contributions is the application of a more robust collision operator, considerably extending the stability of the original single relaxation time model and facilitating larger Reynolds number flow simulations. Additionally, a subgrid model and the thickened flame approach have also been added allowing for efficient large eddy simulations of turbulent reactive flows in complex geometries. This robust solver, in combination with appropriate treatment of boundary conditions, is used to simulate combustion in two configurations: flame front propagation in a 2-D combustion chamber with several obstacles, and the 3-D PRECCINSTA swirl burner. Time evolution of the flame surface in the 2-D configuration shows very good agreement compared to direct numerical and large eddy simulation results available in the literature. The simulation of the PRECCINSTA burner is first performed in the case of cold flow using two different grid resolutions. Comparisons with experimental data reveal very good agreement even at lower resolution. The model is then used, with a 2-step chemistry and multi-component transport/thermodynamics, to simulate the combustor at operating conditions similar to previously reported experimental/numerical studies for $\phi$=0.83. Results are again in very good agreement compared with available large eddy simulation results as well as experimental data, demonstrating the excellent performance of the hybrid solver.
Explore the paper tree
Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant
Look for similar papers (in beta version)
By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.