Sparse, iterative simulation methods for one-dimensional laminar flames

Sparse, iterative simulation methods for one-dimensional laminar flames are proposed. The resulting steady and unsteady flame solvers exploit approximate Jacobians to greatly reduce the computational cost associated with matrix operations. The constant, non-unity Lewis number assumption is introduce...

Full description

Saved in:
Bibliographic Details
Published in:Combustion and flame 2019-06, Vol.204 (C), p.23-32
Main Authors: Lapointe, Simon, Whitesides, Russell A., McNenly, Matthew J.
Format: Article
Language:English
Subjects:
Approximate factorization
Chemical kinetics
Computational efficiency
Computer simulation
Convergence
Distributed memory
ENGINEERING
Flame speed
Flames
Iterative methods
Jacobians
Laminar flame speed
Organic chemistry
Parallel processing
Preconditioner
Solvers
Steady state
Tolerances
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Sparse, iterative simulation methods for one-dimensional laminar flames are proposed. The resulting steady and unsteady flame solvers exploit approximate Jacobians to greatly reduce the computational cost associated with matrix operations. The constant, non-unity Lewis number assumption is introduced to further reduce the computational cost. The solvers are also parallelized to reduce time-to-solution on distributed memory computer systems. Computed laminar flame speeds and species profiles for a range of chemical mechanisms (from 10 to 2878 species) are compared against a well-validated commercial code and are found to be consistent within solver tolerances. The computation times of both the unsteady and steady solutions increase only linearly with the number of species, which is a significant improvement over the quadratic or cubic scaling of existing steady-state flame solvers. For the largest mechanism tested, the steady-state flame solver is two orders of magnitude faster than commonly-used codes. The use of an approximate Jacobian is shown to reduce the rate of convergence for the steady-state solver, but does not significantly affect the domain of convergence. The steady-state solver with approximate Jacobian is thus well suited for computationally efficient laminar flame speed sweeps with large kinetic mechanisms.
ISSN:0010-2180
1556-2921
DOI:10.1016/j.combustflame.2019.02.030