A latent variable framework for handling detailed chemistry in reacting flows

Combustion involves multiple scales and intricate physical processes that make its simulation extremely demanding in terms of computational resources. To overcome this challenge, reduced-order models are essential for improving our understanding of the process and speeding up simulations. This work introduces a latent variable (LV) transport framework and demonstrates its compression capabilities through 0D batch reactor simulations. To improve solver efficiency and numerical stability, we introduce projected tolerances, which scale the ODE solver tolerances in the latent space, significantly improving numerical stability and computational efficiency compared to traditional fixed tolerance approaches.The methodology is validated on 0D simulations using methane, propane, and n-heptane combustion with detailed and lumped kinetic mechanisms. Results show that the LV solver achieves substantial computational cost reductions (up to 50%) while preserving solution accuracy. We further analyse the influence of kinetic mechanisms, demonstrating that detailed mechanisms benefit the most from latent space compression due to their higher dimensionality.The proposed LV framework offers a robust and efficient alternative to conventional solvers for detailed kinetics and establishes a foundation for its extension to multidimensional reactive flow simulations.

Publication Details

Journal
Applications in Energy and Combustion Science
Published
2025-11-28
DOI
https://doi.org/10.1016/j.jaecs.2025.100430
Primary Topic
Innovative Microfluidic and Catalytic Techniques Innovation
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A latent variable framework for handling detailed chemistry in reacting flows

Applications in Energy and Combustion Science
Innovative Microfluidic and Catalytic Techniques Innovation
article

A latent variable framework for handling detailed chemistry in reacting flows

article en

Abstract

Combustion involves multiple scales and intricate physical processes that make its simulation extremely demanding in terms of computational resources. To overcome this challenge, reduced-order models are essential for improving our understanding of the process and speeding up simulations. This work introduces a latent variable (LV) transport framework and demonstrates its compression capabilities through 0D batch reactor simulations. To improve solver efficiency and numerical stability, we introduce projected tolerances, which scale the ODE solver tolerances in the latent space, significantly improving numerical stability and computational efficiency compared to traditional fixed tolerance approaches.The methodology is validated on 0D simulations using methane, propane, and n-heptane combustion with detailed and lumped kinetic mechanisms. Results show that the LV solver achieves substantial computational cost reductions (up to 50%) while preserving solution accuracy. We further analyse the influence of kinetic mechanisms, demonstrating that detailed mechanisms benefit the most from latent space compression due to their higher dimensionality.The proposed LV framework offers a robust and efficient alternative to conventional solvers for detailed kinetics and establishes a foundation for its extension to multidimensional reactive flow simulations.

Applications in Energy and Combustion ScienceVol. 25
European Commission, Fonds De La Recherche Scientifique - FNRS, Erasmus+
Climate action
Openalex Percentile: Top 49%
Innovative Microfluidic and Catalytic Techniques Innovation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.