TY - JOUR
T1 - Explicit integration of extremely stiff reaction networks
T2 - Quasi-steady-state methods
AU - Guidry, M. W.
AU - Harris, J. A.
PY - 2013
Y1 - 2013
N2 - A preceding paper by Guidry et al 2013 Comput. Sci. Disc. 6 015001 demonstrated that explicit asymptotic methods generally work much better for extremely stiff reaction networks than has previously been shown in the literature. There we showed that for systems well removed from equilibrium, explicit asymptotic methods can rival standard implicit codes in speed and accuracy for solving extremely stiff differential equations. In this paper, we continue the investigation of systems well removed from equilibrium by examining quasi-steady-state (QSS) methods as an alternative to asymptotic methods. We show that for systems well removed from equilibrium, QSS methods also can compete with, or even exceed, standard implicit methods in speed, even for extremely stiff networks, and in many cases give a somewhat better integration speed than for asymptotic methods. As for asymptotic methods, we will find that QSS methods give correct results, but with a non-competitive integration speed as equilibrium is approached. Thus, we find that both asymptotic and QSS methods must be supplemented with partial equilibrium methods as equilibrium is approached to remain competitive with implicit methods.
AB - A preceding paper by Guidry et al 2013 Comput. Sci. Disc. 6 015001 demonstrated that explicit asymptotic methods generally work much better for extremely stiff reaction networks than has previously been shown in the literature. There we showed that for systems well removed from equilibrium, explicit asymptotic methods can rival standard implicit codes in speed and accuracy for solving extremely stiff differential equations. In this paper, we continue the investigation of systems well removed from equilibrium by examining quasi-steady-state (QSS) methods as an alternative to asymptotic methods. We show that for systems well removed from equilibrium, QSS methods also can compete with, or even exceed, standard implicit methods in speed, even for extremely stiff networks, and in many cases give a somewhat better integration speed than for asymptotic methods. As for asymptotic methods, we will find that QSS methods give correct results, but with a non-competitive integration speed as equilibrium is approached. Thus, we find that both asymptotic and QSS methods must be supplemented with partial equilibrium methods as equilibrium is approached to remain competitive with implicit methods.
UR - http://www.scopus.com/inward/record.url?scp=84875385024&partnerID=8YFLogxK
U2 - 10.1088/1749-4699/6/1/015002
DO - 10.1088/1749-4699/6/1/015002
M3 - Article
AN - SCOPUS:84875385024
SN - 1749-4680
VL - 6
JO - Computational Science and Discovery
JF - Computational Science and Discovery
IS - 1
M1 - 015002
ER -