Dynamically adapted mesh refinement for combustion front tracking |
| |
| Affiliation: | 1. Department of Aerospace Engineering, Korea Advanced Institute of Science and Technology, 291 Daehak-ro, Yuseong-gu, Daejeon 34141, Republic of Korea;2. GE Global Research Center, One Research Circle, Niskayuna, NY 12309, United States;1. School of Aerospace, Mechanical and Mechatronics Engineering, The University of Sydney, Australia;2. School of Engineering, Macquarie University, Australia;3. Institut für Technische Verbrennung, Universität Stuttgart, Germany;4. School of Mechanical Engineering, The University of New South Wales, Australia;5. School of Mechanical and Mining Engineering, The University of Queensland, Australia;6. Institut für Thermodynamik, Universität der Bundeswehr München, Germany;1. School of Aeronautics and Astronautics, Purdue University, 701 W. Stadium Ave., West Lafayette, IN 47907-2045, United States;2. German Aerospace Center (DLR), Institute of Combustion Technology, Pfaffenwaldring 38-40, Stuttgart, 70569 Germany;1. Institute for Simulation of Reactive Thermo-Fluid Systems, TU Darmstadt, Otto-Berndt Str. 2, Darmstadt 64287, Germany;2. Institute of Energy and Power Plant Technology, TU Darmstadt, Otto-Berndt Str. 3, Darmstadt 64287, Germany;1. Department of Aerospace Engineering, Korea Advanced Institute of Science and Technology, 291 Daehak-ro, Yuseong-gu, Daejeon 34141, Republic of Korea;2. GE Global Research Center, One Research Circle, Niskayuna, NY 12309, United States |
| |
| Abstract: | A strategy of self-adaptive mesh refinement is developed to perform a multi-resolution approach for combustion problems. The objective is to track and resolve the small length scales arising in the thickness of a flame front. The discretisation is based on a series of nested grids of increasing accuracy. Every nested grid can slide on the grid immediately coarser, as far as certain mesh constraints are satisfied. We implement a finite volume formulation which considers a set of non-overlapping sub-domains and three different procedures for solution reconnection are compared: the two first ones envisage a multi-domain approach and the third one builds the composite grid assembling. The three methods have recourse to multi-grid technique in the sense that they exploit grids of coarser levels—actually unused in the formulation—in order to compute solution on each sub-domain. Efficiency of methods is discussed.A test of accuracy versus the exact solution of a stiff elliptic problem is presented: precision in reconnection, refinement consistency, gain in accuracy and CPU time feasibility are checked. Finally, we present qualitative results of feasibility with respect to the tracking of a premixed flame subjected to diffusive-thermal instability which wrinkles the combustion front. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
