Abstract

Microkinetic modeling has drawn increasing attention for quantitatively analyzing catalytic networks in recent decades, in which the speed and stability of the solver play a crucial role. However, for the multi-step complex systems with a wide variation of rate constants, the often encountered stiff problem leads to the low success rate and high computational cost in the numerical solution. Here, we report a new efficient sensitivity-supervised interlock algorithm (SSIA), which enables us to solve the steady state of heterogeneous catalytic systems in the microkinetic modeling with a 100% success rate. In SSIA, we introduce the coverage sensitivity of surface intermediates to monitor the low-precision time-integration of ordinary differential equations, through which a quasi-steady-state is located. Further optimized by the high-precision damped Newton's method, this quasi-steady-state can converge with a low computational cost. Besides, to simulate the large differences (usually by orders of magnitude) among the practical coverages of different intermediates, we propose the initial coverages in SSIA to be generated in exponential space, which allows a larger and more realistic search scope. On examining three representative catalytic models, we demonstrate that SSIA is superior in both speed and robustness compared with its traditional counterparts. This efficient algorithm can be promisingly applied in existing microkinetic solvers to achieve large-scale modeling of stiff catalytic networks.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.