Linear Time Reduction of Large Kinetic Mechanisms With Directed Relation Graph: N-Heptane and Iso-Octane
Linear Time Reduction of Large Kinetic Mechanisms With Directed Relation Graph: N-Heptane and Iso-Octane
Linear Time Reduction of Large Kinetic Mechanisms With Directed Relation Graph: N-Heptane and Iso-Octane
www.elsevier.com/locate/combustflame
Abstract
The algorithm of directed relation graph recently developed for skeletal mechanism reduction was extended to
overall linear time operation, thereby greatly facilitating the computational effort in mechanism reduction, partic-
ularly for those involving large mechanisms. Together with a two-stage reduction strategy and using the kinetic
responses of autoignition and perfectly stirred reactor (PSR) with extensive parametric variations as the crite-
ria in eliminating unimportant species, a detailed 561-species n-heptane mechanism and a detailed 857-species
iso-octane mechanism were successfully reduced to skeletal mechanisms consisting of 188 and 233 species,
respectively. These skeletal mechanisms were demonstrated to mimic well the performance of the detailed mech-
anisms, not only for the autoignition and PSR systems based on which the reduced mechanisms were developed
but also for the independent system of jet-stirred reactor. It was further observed that the accuracy of calculated
species concentrations was equivalently bounded by the user-specified error threshold value and that the reduction
time for a single reaction state is only about 50 ms for the large iso-octane mechanism.
2005 The Combustion Institute. Published by Elsevier Inc. All rights reserved.
ishes quickly. The frequently reused reaction condi- species is formulated with the entries of the Jaco-
tions are handled with the method of in situ adap- bian matrix and the species that are strongly cou-
tive tabulation to reduce the overall simulation cost pled with the major species are identified iteratively.
[10,11]. The theory of computational singular pertur- This method is practically faster than those based
bation (CSP) considers the time dependence of the on sensitivity analysis, although formulation of the
Jacobian matrix, and higher-order accuracy can be ob- species coupling using Jacobian matrix is nontrivial
tained [1216]. and system-dependent knowledge is frequently re-
While time scale analyses can reduce the num- quired.
ber of species and the stiffness by eliminating species In a recent work [24], the method of directed re-
or reactions with short time scales, significant over- lation graph (DRG) was developed to identify unim-
head in central processing unit (CPU) cost is typically portant species by resolving species coupling with
involved in solving the algebraic equations obtained high efficiency and minimal requirement of system-
by assuming that the fast species or reactions are ex- dependent knowledge. In the present investigation
hausted, particularly when the size of the mechanism this method was extended to the reduction of large
is large. Therefore, it is frequently necessary to iden- mechanisms with hundreds of species, namely those
tify and eliminate the unimportant species and reac- for n-heptane and iso-octane [25,26], and the effi-
tions, i.e., to perform the skeletal reduction, before ciency and accuracy of this extended method were
reduction based on time scale analysis is conducted. demonstrated and analyzed.
Various methods for skeletal reduction have been
developed. One of the earliest developed methods
for skeletal reduction is sensitivity analysis [1719], 2. Methodology
which is simple to apply. However, it does not di-
rectly provide decoupled information about the reac- 2.1. DRG method
tions and species, and further postprocessing is re-
quired. The method of principal component analysis The skeletal reduction is to identify and elimi-
(PCA), based on sensitivity analysis, operates on the nate unimportant reactions or species. Typically, the
sensitivity matrices and systematically identifies the identification of unimportant species is more involved
redundant reactions [20]. A major restriction of algo- than that of reactions due to the complex coupling of
rithms based on sensitivity analysis is that they are the species. The method of DRG was developed to
time consuming to compute the sensitivity matrices resolve species coupling efficiently, by starting with
for large mechanisms. direct species coupling, which indicates that the re-
Reaction elimination can also be performed using moval of one species B from the mechanism induces
optimization approaches, such as integer program- immediate error to the production rate of another
ming, aiming to obtain an optimal set of reactions for species A. Such immediate error, noted as rAB , can
given constraints [21]. While the optimal set of re- be expressed as
actions can be identified, the optimal solution strictly
depends on the selection of constraints, which is fre- i=1,I |A,i i Bi |
quently quite involved. Furthermore, the optimiza- rAB ,
i=1,I |A,i i |
tion approach is asymptotically slower than sensitiv- 1, if the ith reaction involves
ity analysis, since integer programming is in general
Bi = species B, (1)
an NP-hard problem. Another method, the detailed re-
0, otherwise,
duction [22], provides a fast way for the identification
of unimportant reactions by directly comparing the where the subscripts A and B indicate the species
reaction rates with a preselected critical value. The identity, i is the ith reaction, A,i the stoichiomet-
restriction of this method is the lack of consideration ric coefficient of species A in the ith reaction, and
of species or reaction coupling, because of which a the reaction rate. The terms in the denominator are the
slower reaction is not always unimportant, particu- contributions of the reactions to the production rate of
larly when it involves crucial radicals. Consequently, species A, and the terms in the numerator are those in
significant human interaction and extensive validation the denominator that involve species B. If the relative
may be required. error rAB is not small compared to a threshold value
While skeletal reduction based on reaction elim- , the removal of species B from the skeletal mecha-
ination has been extensively studied, those methods nism immediately induces a nonnegligible error in A.
involving direct species elimination are less estab- Consequently species B should be kept in the skele-
lished. A method was developed for the identification tal mechanism if species A is to be retained. Such an
of unimportant species by resolving species coupling immediate requirement of species A to species B is
using Jacobian analysis [23]. The coupling among denoted as A B.
26 T. Lu, C.K. Law / Combustion and Flame 144 (2006) 2436
tion. A local DRG reduction can be performed for each elementary reaction is bounded by a small con-
each of these reaction states, and the union of the stant number Smax , say 68. Thus graph construction
species sets of all the local skeletal mechanisms yields can be performed in a more efficient way by evaluat-
the species set of the global skeletal mechanism. ing only the contributions of each reaction to the re-
It is to be noted that since the comprehensive lated edges. Since each reaction involves at most Smax
skeletal mechanism developed here is the union of a species, the maximum number of edges in the graph
set of local skeletal mechanisms each developed for a is bounded by a linear function of I and so is the
reaction state, many partially comprehensive skeletal time complexity of the graph construction step. The
mechanisms can be developed through the union of detailed procedure for graph construction is shown in
any number of these local skeletal mechanisms, with the coarse-grain pseudo code in Fig. 2.
different sizes, different parametric ranges, and dif- In the second step, each edge in the graph can
ferent extents of computational cost reduction. The be compared with the threshold value for trunca-
methodology is therefore applicable to the develop- tion. The resulting graph with a smaller number of
ment of mechanisms of various degrees of compre- edges can be searched with DFS to obtain the final
hensiveness. Indeed, each of the local skeletal mecha- species set of the skeletal mechanism. Since the num-
nisms being applicable to a given reaction state allows ber of edges is bounded by a linear function of I ,
the ultimate potential of transition between different and DFS features a linear searching time proportional
skeletal mechanisms during a simulation, from state to the number of edges in the graph, the time com-
to statea promising prospect that is worth further plexity of the second step is also O(I ). While this
pursuing. standard graph searching method is fast for reduction
with given accuracy requirement, it is not sufficient
2.2. Extended DRG algorithm for linear time if the number of species, instead of the accuracy, is
reduction given for the reduction. In such cases, the DFS algo-
rithm can be revised such that species can be sorted
The major advantage of DRG reduction is that the by the critical value of .
entire reduction can be completed in a time that is The revised DFS (RDFS) method first sorts the
linearly proportional to the number of reactions in edges by their respective values r. Then the edges
the mechanism. Linear time reduction is crucial for are inserted into the initially empty graph in decreas-
applications requiring real time or case-specific re- ing order of r, such that the strongly coupled species
duction. In CFD simulations using explicit integration groups, or kernels, can be formed first. The kernels
schemes, real time reduction based on Jacobian or grow larger as more edges are inserted into the graph,
sensitivity matrix analysis requires significant over- until a bridging edge is inserted and an otherwise iso-
head, which consequently diminishes the efficiency lated kernel becomes reachable from the starting ver-
of the reduction. In such cases, a reduction algorithm tices. The r value of this bridging edge then becomes
with linear reduction time is required to minimize the the critical value for each species in this kernel. The
overhead and provide the highest efficiency. DRG is procedure continues until all the edges are inserted,
such an algorithm in that the entire reduction time is as described in Fig. 2. While general purpose sort-
linearly proportional to the number of reactions in the ing algorithms take O(I log I ) time to sort the edges,
mechanism, as will be shown in the following sec- a simple linear time bucket sorting algorithm can be
tion. applied in the RDFS algorithm, considering that the
There are three major steps in DRG reduction, possible value of an edge is between 0 and 1, and
namely the graph construction step using Eq. (1), the the r value needs to be accurate only to 103 104 .
graph searching step to identify the skeletal species, The graph searching time for the RDFS algorithm is
and the skeletal mechanism generation step to create therefore still a linear function of I by the argument
the final mechanism files. that the total number of edges is O(I ) and no edge
The graph construction step involves evaluation needs to be searched more than once. Compared with
of the relative errors for each pair of species ac- the regular DRG reduction, the extended DRG pro-
cording to Eq. (1). There are totally K 2 terms to be vides the sorted species list in a single linear time
evaluated, where K is the number of species, and RDFS search. Therefore the skeletal mechanism of
each term contains O(I ) multiplications. Therefore any given accuracy or number of species can be gen-
a brute-force approach in graph construction would erated using this list.
require O(K 2 I ) evaluations, which can be asymp- Finally, the third step of the DRG reduction is
totically more expensive than the evaluation of the to eliminate the reactions that involve any removed
Jacobian matrix. However, the stoichiometric coeffi- species and subsequently generate the final skeletal
cient matrices for the detailed mechanisms are sparse mechanism. This step is straightforward and it is triv-
in general; i.e., the number of species involved in ial to show that the time complexity is also O(I ),
28 T. Lu, C.K. Law / Combustion and Flame 144 (2006) 2436
Fig. 2. Coarse-grain pseudo code of the extended DRG method with linear time graph construction and revised depth first search
(RDFS) algorithm.
provided that the number of species in each reaction formed on the skeletal mechanism. In such cases,
is bounded by a constant value, Smax . a two-stage DRG reduction can produce a skeletal
Since each of the three steps in DRG reduction can mechanism slightly smaller than that from a single-
be performed in linear time, the overall reduction time stage DRG reduction. The first stage of DRG reduc-
for DRG is O(I ), i.e., a linear function of the number tion is the major reduction stage, in which a signif-
of reactions in the detailed mechanism. icant number of species are eliminated from the de-
tailed mechanism, and the second stage is a minor
2.3. Two-stage DRG for reduction of large stage whose execution is optional.
mechanisms While it might be argued that more than two
DRG stages are needed to obtain a converged skele-
When the number of species is large in the de- tal species set for extremely large mechanisms, it is
tailed mechanism, the number of species eliminated reasonable to expect, and indeed was found for the
by a DRG reduction is expected to be correspondingly reduction of the largest mechanisms currently avail-
large. Consequently, the r value for each pair of the able such as those of n-heptane and iso-octane [25,
retained species can be changed due to the elimina- 26], that a two-stage DRG reduction is quite adequate.
tion of the unimportant species. Although the change It is further noted that, since the second stage of DRG
in the r values is a second-order effect, it is still pos- reduction can also be performed in linear time and
sible that some species in the skeletal mechanism can since the number of reactions in the skeletal mecha-
be further eliminated if a second-stage DRG is per- nism determined from the first DRG reduction stage is
T. Lu, C.K. Law / Combustion and Flame 144 (2006) 2436 29
Fig. 10. Comparison of calculated temperature rise in JSR Fig. 11. Comparison of calculated temperature rise in JSR
as a function of the initial temperature for 0.1% n-heptane as a function of the initial temperature for 0.1% iso-octane
with the detailed and the 188-species skeletal mechanisms, with the detailed and the 233-species skeletal mechanisms,
for equivalence ratio from 0.5 to 1.5, pressure from 10 to 40 for equivalence ratio from 0.5 to 1.5, pressure from 10 to
atm, and residence time = 1 s. 40 atm, and residence time = 1 s.
Fig. 14. Calculated relative error in temperature rise for 0.1% iso-octane, as function of the user-specified error threshold value ,
in a flow reactor with = 1.0, p = 1 atm, initial temperature 1080 K, and residence time = 0.2 s, for both local and global
reduction.
We close this exposition by emphasizing the high [15] T.F. Lu, Y. Ju, C.K. Law, Combust. Flame 126 (12)
efficiency of the present linear time algorithm, which (2001) 14451455.
is responsible for the extremely short time in mech- [16] M. Valorani, H.N. Najm, D.A. Goussis, Combust.
anism generation, as for the case of 50 ms for iso- Flame 134 (12) (2003) 3553.
[17] H. Rabitz, M. Kramer, D. Dacol, Annu. Rev. Phys.
octane.
Chem. 1134 (1983) 419461.
[18] T. Turanyi, J. Math. Chem. 5 (1990) 203248.
[19] A.S. Tomlin, T. Turanyi, M.J. Pilling, Comprehensive
Acknowledgment Chemical Kinetics, Elsevier, 1997, pp. 293437.
[20] S. Vajada, P. Valko, T. Turanyi, Int. J. Chem. Kinet. 17
This work was supported by the Air Force Office (1985) 5581.
of Scientific Research under the technical monitoring [21] B. Bhattacharjee, D.A. Schwer, P.I. Barton, W.H.
of Dr. Julian M. Tishkoff. Green, Combust. Flame 135 (2003) 191208.
[22] H. Wang, M. Frenklach, Combust. Flame 87 (34)
(1991) 365370.
[23] T. Turanyi, New J. Chem. 14 (1990) 795803.
References [24] T.F. Lu, C.K. Law, Proc. Combust. Inst. 30 (2005)
13331341.
[1] N. Peters, F.A. Williams, Combust. Flame 68 (2) (1987) [25] H.J. Curran, P. Gaffuri, W.J. Pitz, C.K. Westbrook,
185207. Combust. Flame 114 (12) (1998) 149177.
[2] K. Seshadri, N. Peters, Combust. Flame 73 (1) (1988) [26] H.J. Curran, P. Gaffuri, W.J. Pitz, C.K. Westbrook,
2344. Combust. Flame 129 (3) (2002) 253280.
[3] T. Turanyi, A.S. Tomlin, M.J. Pilling, J. Phys. Chem. 97 [27] http://www-cms.llnl.gov/combustion/combustion2.
(1993) 163172. html#n-C7H16, August 2004.
[4] J.Y. Chen, Combust. Sci. Technol. 57 (1988) 8994. [28] J.D. Blouch, C.K. Law, Proc. Combust. Inst. 28 (2000)
[5] C.J. Sung, C.K. Law, J.Y. Chen, Proc. Combust. 16791686.
Inst. 27 (1998) 295304. [29] A. Chakir, M. Belliman, J.C. Boettner, M. Cathonnet,
[6] C.J. Sung, C.K. Law, J.Y. Chen, Combust. Flame 125 Int. J. Chem. Kinet. 24 (1992) 385410.
(2001) 906919. [30] R.P. Lindstedt, L.Q. Maurice, Combust. Sci. Tech-
[7] T. Turanyi, J. Toth, Acta Chim. Hung. 129 (1992) 903 nol. 107 (1995) 317353.
914. [31] T.J. Held, A.J. Marchese, F.L. Dryer, Combust. Sci.
[8] H.S. Soyhan, F. Mauss, C. Sorusbay, Combust. Sci. Technol. 123 (1997) 107146.
Technol. 174 (1112) (2002) 7391. [32] N. Peters, G. Paczko, R. Seiser, K. Seshadri, Combust.
[9] U. Maas, S.B. Pope, Combust. Flame 88 (34) (1992) Flame 128 (12) (2002) 3859.
239264. [33] M. Bollig, H. Pitsch, J. Hewson, K. Seshadri, Proc.
[10] S.B. Pope, Combust. Theory Modeling 1 (1997) 4163. Combust. Inst. 26 (1996) 729737.
[11] B. Yang, S.B. Pope, Combust. Flame 112 (1998) 85 [34] R. Seiser, H. Pitsch, K. Seshadri, W.J. Pitz, H.J. Curran,
112. Proc. Combust. Inst. 28 (2000) 20292037.
[12] S.H. Lam, D.A. Goussis, Proc. Combust. Inst. 22 [35] S.L. Liu, J.C. Hewson, J.H. Chen, H. Pitsch, Combust.
(1988) 931941. Flame 137 (3) (2004) 320339.
[13] S.H. Lam, D.A. Goussis, Int. J. Chem. Kinet. 26 (1994) [36] http://www-cms.llnl.gov/combustion/combustion2.
461486. html#i-C8H18, August 2004.
[14] A. Massias, D. Diamantis, E. Mastorakos, D.A. Gous- [37] H. Pitsch, N. Peters, Proc. Combust. Inst. 26 (1996)
sis, Combust. Flame 117 (4) (1999) 685708. 763771.