Log-time algorithms for exact stochastic simulation of fully connected reaction networks using low-rank decomposition...

Area of Science:

• Computational Chemistry
• Materials Science
• Chemical Kinetics

Background:

• Simulating large chemical reaction networks is computationally intensive.
• Existing stochastic simulation algorithms (SSA) face challenges with scalability and memory usage.
• Accurate simulation is crucial for understanding complex phenomena like alloy precipitation.

Purpose of the Study:

• To develop an efficient and scalable stochastic simulation algorithm for large chemical reaction networks.
• To reduce the time and memory complexity of simulating chemical kinetics.
• To enable simulations of previously inaccessible physical systems and timescales.

Main Methods:

• Adaptation and improvement of the stochastic simulation algorithm (SSA), also known as the Lanore-Gillespie algorithm.
• Integration of low-rank decomposition of propensity matrix upper bounds with rejection sampling.
• Development of algorithms with logarithmic time and linear space complexity relative to the number of chemical species.

Main Results:

• The enhanced SSA significantly reduces computational time and memory requirements.
• Achieved logarithmic time and linear space complexity, outperforming existing methods.
• Successfully simulated solute precipitation in a FeCu alloy, reaching unprecedented physical times and system sizes.
• Simulated precipitate evolution closely matched experimental data from small-angle neutron scattering.

Conclusions:

• The improved SSA offers a more efficient and scalable approach for simulating complex chemical reaction systems.
• This advancement allows for the investigation of larger and longer-timescale phenomena in materials science and chemistry.
• The method's accuracy is validated by its agreement with experimental observations in alloy precipitation studies.