Efficient computation methods for combustion reaction kinetics

This research presents multiple strategies to improve the computation efficiency of solving combustion reaction kinetics. All strategies in this work are error-free compared to other methods based on result tabulation, dynamic mechanism reduction, and stiffness removal with quasi-equilibrium assumption and lower-dimensional manifold attraction. In the presented methods, the Jacobian matrix are solved by either direct linear solver or preconditioned Krylov subspace method. Different Jacobian matrix construction methods are designed with exploiting the characteristics of reaction network. The methods are systematically tested using reaction mechanisms of different size, and with different initial conditions. The performance of the presented methods are also compared with existing codes. The results shows that each specific method has higher performance for certain mechanisms. The reason for the performance differences are analyzed and a guideline for selecting method is provided. The presented methods are implemented into CFD code to efficiently simulate the reaction flow without dealing with the heterogeneity caused by dynamic mechanism reduction, quasiequilibrium assumption, etc. It is also possible to combine the presented methods with problem-reducingmethods to further optimize the reaction kinetics computation.