A fast, low-memory, and stable algorithm for implementing multicomponent transport in direct numerical simulations
Aaron J. Fillo, Jason Schlup, Guillaume Beardsell, Guillaume, Blanquart, and Kyle E. Niemeyer

TL;DR
This paper introduces a fast, low-memory algorithm for multicomponent diffusion in reacting-flow simulations, demonstrating its accuracy and impact on turbulent flame speed predictions in three-dimensional simulations.
Contribution
The paper presents a novel semi-implicit, efficient algorithm for multicomponent diffusion, verified against 1D flames and applied to 3D turbulent flames, highlighting differences from mixture-averaged models.
Findings
The algorithm is stable and scales with the square of species number.
Mixture-averaged diffusion underpredicts turbulent flame speed by 15%.
The method enables more accurate DNS of reacting flows with multiple species.
Abstract
Implementing multicomponent diffusion models in reacting-flow simulations is computationally expensive due to the challenges involved in calculating diffusion coefficients. Instead, mixture-averaged diffusion treatments are typically used to avoid these costs. However, to our knowledge, the accuracy and appropriateness of the mixture-averaged diffusion models has not been verified for three-dimensional turbulent premixed flames. In this study we propose a fast,efficient, low-memory algorithm and use that to evaluate the role of multicomponent mass diffusion in reacting-flow simulations. Direct numerical simulation of these flames is performed by implementing the Stefan-Maxwell equations in NGA. A semi-implicit algorithm decreases the computational expense of inverting the full multicomponent ordinary diffusion array while maintaining accuracy and fidelity. We first verify the method by…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
