Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “multiple time stepping”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Optimizing lane reversals in transportation networks to reduce traffic congestion: A global optimization approach

This paper studies how to reduce the overall travel time of commuters in a transportation network by reversing the direction of some lanes in the network using a macroscopic network-wide perspective. Similar to the Network Design Problem, the lane reversal problem has been shown to be NP-hard given the dependence of the users’ route selection on the lane direction decision. Herein, we propose and compare three efficient methods to solve the routing and lane reversal problem jointly. First, we introduce an alternating method that decouples the routing and lane assignment problems. Second, we propose a Frank–Wolfe method that jointly takes gradient steps to adjust both the lane assignment and routing decisions. Third, we propose a convex approximation method that uses a threshold-based approach to convexify the joint routing and lane reversal objective. The convex approximation method is advantageous since it finds a global optimum solution for the approximated problem and it enables the possibility to include linear constraints. Using this method, we extend the main formulation to be able to limit a maximum number of reversed lanes, as well as to incorporate multiple origin–destination (OD) patterns. We test the proposed methods in a case study using the transportation network of Eastern Massachusetts where our results indicate an overall reduction in travel times of 4.7% by selecting the best 15 reversals. Moreover, using a small test network, we investigate the performance of the lane reversal strategies as a function of the OD demand symmetry. As expected, we observe that when the OD demand is very asymmetric (e.g., for a single OD pair, evacuations, large events), the reduction in travel times is larger than the symmetric case, reaching travel time reductions of 60%.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2026

Mass Spectrometric Determination of Site-Specific O -Acetylation in Rhamnogalacturonan I Oligomers

O-acetylation, a common modification in rhamnogalacturonan I (RG-I), is critical for various biological processes, including plant growth, stress responses, and pathogen defense. Precise determination of the degree and specific positions of acetylation is therefore essential. To date, nuclear magnetic resonance (NMR) and tandem mass spectrometry have been employed to identify O-acetyl positions in pectin oligosaccharides. Although NMR is effective, it requires pure, high-concentration samples. Tandem mass spectrometry (MS), which uses smaller sample amounts, faces challenges due to O-acetyl migration between monosaccharide positions. The multiple steps in pectin sample analysis can further promote O-acetyl migration, especially near free hydroxyl groups. Moreover, during tandem MS, O-acetyl groups may detach, complicating the accurate tracking. This study presents an approach to lock O-acetyl groups by introducing trideuteroacetyl and propionyl substituents onto free hydroxyls of RG-I or partially acetylated RG-I. By combining matrix-assisted laser desorption/ionization time-of-flight (MALDI-TOF) MS and electrospray ionization (ESI) MS with MS/MS or tandem mass spectrometry (MSn), we devised a way to determine the monosaccharide sequence in the oligomer and the precise positions of O-acetyl groups in partially acetylated RG-I. This method enables the study of the regiospecificity of recombinant pectin O-acetyltransferases and can be applied to other oligosaccharides to determine acyl positions.

O-acetylation↗
DOE OSTI2024

Accurate assessment of land–atmosphere coupling in climate models requires high-frequency data output

Land–atmosphere (L–A) interactions are important for understanding convective processes, climate feedbacks, the development and perpetuation of droughts, heatwaves, pluvials, and other land-centered climate anomalies. Local L–A coupling (LoCo) metrics capture relevant L–A processes, highlighting the impact of soil and vegetation states on surface flux partitioning and the impact of surface fluxes on boundary layer (BL) growth and development and the entrainment of air above the BL. A primary goal of the Climate Process Team in the Coupling Land and Atmospheric Subgrid Parameterizations (CLASP) project is parameterizing and characterizing the impact of subgrid heterogeneity in global and regional Earth system models (ESMs) to improve the connection between land and atmospheric states and processes. A critical step in achieving that aim is the incorporation of L–A metrics, especially LoCo metrics, into climate model diagnostic process streams. However, because land–atmosphere interactions span timescales of minutes (e.g., turbulent fluxes), hours (e.g., BL growth and decay), days (e.g., soil moisture memory), and seasons (e.g., variability in behavioral regimes between soil moisture and latent heat flux), with multiple processes of interest happening in different geographic regions at different times of year, there is not a single metric that captures all the modes, means, and methods of interaction between the land and the atmosphere. And while monthly means of most of the LoCo-relevant variables are routinely saved from ESM simulations, data storage constraints typically preclude routine archival of the hourly data that would enable the calculation of all LoCo metrics. Here, we outline a reasonable data request that would allow for adequate characterization of sub-daily coupling processes between the land and the atmosphere, preserving enough sub-daily output to describe, analyze, and better understand L–A coupling in modern climate models. A secondary request involves embedding calculations within the models to determine mean properties in and above the BL to further improve characterization of model behavior. Higher-frequency model output will (i) allow for more direct comparison with observational field campaigns on process-relevant timescales, (ii) enable demonstration of inter-model spread in L–A coupling processes, and (iii) aid in targeted identification of sources of deficiencies and opportunities for improvement of the models.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Algorithm advances and applications of time‐dependent first‐principles simulations for ultrafast dynamics

Abstract Far from equilibrium phenomenon is a central theme of contemporary material research. Such phenomenon can exhibit itself in atomic structure and dynamics, but very often it also happens as non‐equilibrium phenomenon in the electronic structure. In ab initio material simulation, density functional theory (DFT) has played an essential role in studying electronic ground state problems. For excited states, besides many‐body perturbation theory, another powerful tool is the time dependent DFT (TDDFT) method. In particular, the real‐time TDDFT (rt‐TDDFT) method can be used to simulate many non‐equilibrium phenomena directly. Here we introduce our works on some algorithm advances based on our recently rt‐TDDFT method. This method uses the plane‐wave basis set, and significantly accelerates its efficiency by increasing the time step from 0.1–1 as in traditional methods to 0.2–0.5 fs. The noncollinear magnetic moments and spin–orbit coupling have also been included in our rt‐TDDFT method. Furthermore, a Boltzmann‐TDDFT algorithm has been developed to solve the hot carrier overheating problem in Ehrenfest dynamics, and a natural orbital branching algorithm has been developed to overcome the mean‐field approximation in Ehrenfest dynamics nuclear trajectory, thus allows stochastic multiple paths in chemical reactions. Utilizing these methods, we have studied the photoinduced ultrafast demagnetization, ultrafast phase transition, energy transfer between plasmon and hot carriers, as well as the high‐energy ion implantation and low‐energy atomic diffusion in semiconductors. We believe the tools as the ones introduced here can enable us to study a wide range of phenomena which are of great interest in modern day material research. This article is categorized under: Structure and Mechanism > Computational Materials Science Electronic Structure Theory > Ab Initio Electronic Structure Methods Electronic Structure Theory > Density Functional Theory

Liu, Wen‐Hao↗
DOE OSTI2025

On the numerical sensitivity of cellular automata grain structure predictions to large thermal gradients and cooling rates

Cellular automata (CA) models of as-solidified grain structure, originally developed and applied to casting, have become a common means of predicting grain structure resulting from Additive Manufacturing (AM) processes. The majority of these models are based on the decentered octahedron approach, which attempts to correct for the effect of grid anisotropy on the prediction of competitive solidification of dendritic grains. However, AM solidification occurs under cooling rates ($\dot{T}$) and thermal gradients (G) that are orders of magnitude larger than those encountered in casting, and no systematic investigation on the effect of the CA model cell size (Δx) and time step (Δt) on AM microstructure predictions has been performed. Here, in this study, such an investigation is first performed via simulation of individual grains of various crystallographic orientations with a fixed, unidirectional G, showing that CA prediction of the steady-state undercooling matched the expected values based on the interfacial response function at small G and deviated from the expected values at large G. Simulation of competitive growth of multiple grains showed a weakening of the predicted texture as G and Δx became large. Simulation of solidification under AM conditions, where G and $\dot{T}$ vary spatially across the melt pools, showed that not only does grain selection weaken and deviate from expectations at large Δx, but grains with crystallographic $\langle$100$\rangle$ aligned with the grid directions are more adversely affected by the temperature field discontinuities than grains with other crystallographic orientations. Despite the fact that the exact grain competition results depended on Δt, the overall texture development was notably less sensitive to Δt than Δx, provided that a reasonable value of Δt is selected based on the ratio of Δx to the maximum local solidification velocity in the simulation domain. Finally, from the directional solidification and AM simulation results, an analysis of computational cost compared to simulation resolution is performed based on an equation derived to quantify the relatively inaccuracy in grain selection based on the model and temperature field inputs. From this analysis, it is concluded that there is a need for algorithmic improvements to improve CA grain competition accuracy for large G processing conditions as sufficiently small Δx to resolve the necessary competition is intractable for many AM processing conditions.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Efficient Mixed-Precision Matrix Factorization of the Inverse Overlap Matrix in Electronic Structure Calculations with AI-Hardware and GPUs

In recent years, a new kind of accelerated hardware has gained popularity in the artificial intelligence (AI) community which enables extremely high-performance tensor contractions in reduced precision for deep neural network calculations. In this article, we exploit Nvidia Tensor cores, a prototypical example of such AI-hardware, to develop a mixed precision approach for computing a dense matrix factorization of the inverse overlap matrix in electronic structure theory, S –1 . This factorization of S –1 , written as ZZT = S –1 , is used to transform the general matrix eigenvalue problem into a standard matrix eigenvalue problem. Here we present a mixed precision iterative refinement algorithm where Z is given recursively using matrix–matrix multiplications and can be computed with high performance on Tensor cores. To understand the performance and accuracy of Tensor cores, comparisons are made to GPU-only implementations in single and double precision. Additionally, we propose a nonparametric stopping criteria which is robust in the face of lower precision floating point operations. The algorithm is particularly useful when we have a good initial guess to Z, for example, from previous time steps in quantum-mechanical molecular dynamics simulations or from a previous iteration in a geometry optimization.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Fast and scalable quantum Monte Carlo simulations of electron-phonon models

We introduce methodologies for highly scalable quantum Monte Carlo simulations of electron-phonon models, and report benchmark results for the Holstein model on the square lattice. The determinant quantum Monte Carlo (DQMC) method is a widely used tool for simulating simple electron-phonon models at finite temperatures, but incurs a computational cost that scales cubically with system size. Alternatively, near-linear scaling with system size can be achieved with the hybrid Monte Carlo (HMC) method and an integral representation of the Fermion determinant. Here, we introduce a collection of methodologies that make such simulations even faster. To combat "stiffness" arising from the bosonic action, we review how Fourier acceleration can be combined with time-step splitting. To overcome phonon sampling barriers associated with strongly-bound bipolaron formation, we design global Monte Carlo updates that approximately respect particle-hole symmetry. To accelerate the iterative linear solver, we introduce a preconditioner that becomes exact in the adiabatic limit of infinite atomic mass. Finally, we demonstrate how stochastic measurements can be accelerated using fast Fourier transforms. Here, these methods are all complementary and, combined, may produce multiple orders of magnitude speedup, depending on model details.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. In this article, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. In this paper, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Sensor Fusion: Comprehensive Real-Time, On-Line Monitoring for Process Control via Visible, Near-Infrared, and Raman Spectroscopy

On-line monitoring based on optical spectroscopy provides unprecedented insight into the chemical composition of process streams or batches. Amplifying this approach through utilizing multiple forms of optical spectroscopy in sensor fusion can greatly expand the number and type of chemical species that can be identified and quantified. This is demonstrated herein, on the analysis of used nuclear fuel recycling streams: highly complex processes with multiple target and interfering analytes. The optical techniques of visible absorbance, near infrared absorbance, and Raman spectroscopy were combined to quantify plutonium (III, IV, VI), uranium (IV, VI), neptunium (IV, V, VI), and nitric acid. Chemometric modeling was used to quantify analytes in process streams in real-time and results were successfully used to enable immediate process control and generation of a product stream at a set composition ratio. This represents a significant step forward in the ability to monitor and control complex chemical processes occurring in harsh chemical environments.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

User Role Identification in Software Vulnerability Discussions over Social Networks

Understanding and early awareness of software vulnerabilities is vital for preventing and mitigating potential impacts from cybersecurity events. One step toward early characterization of software vulnerabilities may involve analyzing discussion and spread of information in online social networks. Prior work has used information from such discussions over multiple online forums to develop dynamic networks among users followed by analysis of structure, spread, and information evolution. In this work, we advance the state-of-the-art by focusing on data-driven learning of types, roles, and transition of roles exhibited by users over time. In social networks, users take on particular roles based on their actions and structure of the network. Identifying “meaningful” roles can help separate potential users of interest from the larger community, and identify patterns in a network. We will identify and compare roles found in online forums (e.g., Twitter) using techniques such as feature-based Non-negative Matrix Factorization coupled with topological and influence-based measures of centrality. Since users’ activities change over time, we also analyze role evolution in dynamic networks.

Jones, Rebecca D.↗
DOE OSTI2022

Super-Resolution Approaches in Three-Dimensions for Classification and Screening of Commercial-Off-The-Shelf Components

X-ray computed tomography is generally a primary step in characterization of defective electronic components, but is generally too slow to screen large lots of components. Super-resolution imaging approaches, in which higher-resolution data is inferred from lower-resolution images, have the potential to substantially reduce collection times for data volumes accessible via x-ray computed tomography. Here we seek to advance existing two-dimensional super-resolution approaches directly to three-dimensional computed tomography data. Multiple scan resolutions over a half order of magnitude of resolution were collected for four classes of commercial electronic components to serve as training data for a deep-learning, super-resolution network. A modular python framework for three-dimensional super-resolution of computed tomography data has been developed and trained over multiple classes of electronic components. Initial training and testing demonstrate the vast promise for these approaches, which have the potential for more than an order of magnitude reduction in collection time for electronic component screening.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Dynamics retrieval from stochastically weighted incomplete data by low-pass spectral analysis

Time-resolved serial femtosecond crystallography (TR-SFX) provides access to protein dynamics on sub-picosecond timescales, and with atomic resolution. Due to the nature of the experiment, these datasets are often highly incomplete and the measured diffracted intensities are affected by partiality. To tackle these issues, one established procedure is that of splitting the data into time bins, and averaging the multiple measurements of equivalent reflections within each bin. This binning and averaging often involve a loss of information. Here, we propose an alternative approach, which we call low-pass spectral analysis (LPSA). In this method, the data are projected onto the subspace defined by a set of trigonometric functions, with frequencies up to a certain cutoff. This approach attenuates undesirable high-frequency features and facilitates retrieving the underlying dynamics. A time-lagged embedding step can be included prior to subspace projection to improve the stability of the results with respect to the parameters involved. Subsequent modal decomposition allows to produce a low-rank description of the system's evolution. Using a synthetic time-evolving model with incomplete and partial observations, we analyze the LPSA results in terms of quality of the retrieved signal, as a function of the parameters involved. We compare the performance of LPSA to that of a range of other sophisticated data analysis techniques. We show that LPSA allows to achieve excellent dynamics reconstruction at modest computational cost. Finally, we demonstrate the superiority of dynamics retrieval by LPSA compared to time binning and merging, which is, to date, the most commonly used method to extract dynamical information from TR-SFX data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Dissolution of Mg-enriched defects in implanted GaN and increased p-type dopant activation

Annealing Mg-implanted homoepitaxial GaN at temperatures above 1400 °C eliminates the formation of inversion domains and leads to improved dopant activation efficiency. Extended defects, in the form of inversion domains, contain electrically inactive Mg after post-implantation annealing at temperatures as high as 1300 °C (one GPa N 2 overpressure), which results in a low dopant activation efficiency. Triple-axis x-ray data reveal that implant-induced strain is fully relieved after annealing at 1300 °C for 10 min, indicating that strain-inducing point defects formed during implantation have reconfigured and inversion domains are formed. However, annealing at temperatures of 1400–1500 °C (one GPa N 2 overpressure) eliminates the presence of the inversion domains. While residual defects, such as dislocation loops, still exist after annealing at and above 1400 °C, chemical analysis at multiple dislocation loops shows no sign of Mg segregation. Meanwhile, an overall decreasing trend in the dislocation loop density is observed after annealing at the higher temperatures and longer times. Additionally, once inversion domains are formed and the samples are cooled to room temperature, they are shown to dissolve with subsequent annealing above 1400 °C. While such defects have been observed before, the important finding that such defects can be dissolved with a short, higher temperature step is key. Earlier work [Breckenridge et al., J. Appl. Phys. Lett. 118, 022101 (2021)] addressing electrical measurements of these types of samples showed that annealing at 1400 °C leads to a dopant activation efficiency that is an order of magnitude higher than that observed at 1300 °C. In conclusion, this work complements earlier work by identifying the inversion domains, which incorporate Mg, and points to the benefits, in terms of defect density and p-type dopant activation, of using higher temperature (>1400 °C) annealing cycles to activate Mg in GaN, even if the Mg-containing inversion domains had been formed during lower temperature annealing.

36 MATERIALS SCIENCE↗
DOE OSTI2024

A novel open-source cultivation system helps establish the first full cycle chemosynthetic symbiosis model system involving the giant ciliate Zoothamnium niveum

Symbiotic interactions drive species evolution, with nutritional symbioses playing vital roles across ecosystems. Chemosynthetic symbioses are globally distributed and ecologically significant, yet the lack of model systems has hindered research progress. The giant ciliate Zoothamnium niveum and its sulfur-oxidizing symbionts represent the only known chemosynthetic symbiosis with a short life span that has been transiently cultivated in the laboratory. While it is experimentally tractable and presents a promising model system, it currently lacks an open-source, simple, and standardized cultivation setup. Following the FABricated Ecosystems (EcoFABs) model, we leveraged 3D printing and polydimethylsiloxane (PDMS) casting to develop simple flow-through cultivation chambers that can be produced and adopted by any laboratory. The streamlined manufacturing process reduces production time by 86% and cuts cost by tenfold compared to the previous system. Benchmarking using previously established optimal growth conditions, the new open-source cultivation system proves stable, efficient, more autonomous, and promotes a more prolific growth of the symbiosis. For the first time, starting from single cells, we successfully cultivated the symbiosis in flow-through chambers for 20 days, spanning multiple generations of colonies that remained symbiotic. They were transferred from chamber to chamber enabling long-term cultivation and eliminating the need for continuous field sampling. The chambers, optimized for live imaging, allowed detailed observation of the synchronized growth between the host and symbiont. Highlighting the benefit of this new system, we here describe a new step in the first hours of development where the host pauses growth, expels a coat, before resuming growth, hinting at a putative symbiont selection mechanism early in the colony life cycle. With this simple, open-source, cultivation setup, Z. niveum holds promises for comparative studies, standardization of research and wide adoption by the symbiosis research community.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Exponential time differencing for the tracer equations appearing in primitive equation ocean models

The tracer equations are part of the primitive equations used in ocean modeling and describe the transport of tracers, such as temperature, salinity or chemicals, in the ocean. Depending on the number of tracers considered, several equations may be added to and coupled to the dynamics system. In many relevant situations, the time-step requirements of explicit methods imposed by the transport and mixing in the vertical direction are more restrictive than those for the horizontal, and this may cause the need to use very small time steps if a fully explicit method is employed. To overcome this issue, we propose an exponential time differencing (ETD) solver where the vertical terms (transport and diffusion) are treated with a matrix exponential, whereas the horizontal terms are dealt with in an explicit way. In this work, we investigate numerically the computational speed-ups that can be obtained over other semi-implicit methods, and we analyze the advantages of the method in the case of multiple tracers.

42 ENGINEERING↗
DOE OSTI2020

Restoring Distribution System Under Renewable Uncertainty Using Reinforcement Learning

Distributed energy resources (DERs) in distribution systems, including renewable generation, micro-turbine, and energy storage, can be used to restore critical loads following extreme events to increase grid resiliency. However, properly coordinating multiple DERs in the system for multi-step restoration process under renewable uncertainty and fuel availability is a complicated sequential optimal control problem. Due to its capability to handle system non-linearity and uncertainty, reinforcement learning (RL) stands out as a potentially powerful candidate in solving complex sequential control problems. Moreover, the offline training of RL provides excellent action readiness during online operation, making it suitable to problems such as load restoration, where in-time, correct and coordinated actions are needed. In this study, a distribution system prioritized load restoration based on a simplified single-bus system is studied: with imperfect renewable generation forecast, the performance of an RL controller is compared with that of a deterministic model predictive control (MPC). Our experiment results show that the RL controller is able to learn from experience, adapt to the imperfect forecast information and provide a more reliable restoration process when compared with the baseline controller.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2023

High-Fidelity Energy Deposition Ignition Model Coupled with Flame Propagation Models at Engine-like Flow Conditions

With the heightened pressure on car manufacturers to increase the efficiency and reduce the carbon emissions of their fleets, more challenging engine operation has become a viable option. Highly dilute, boosted, and stratified charge, among others, promise engine efficiency gains and emissions reductions. At such demanding engine conditions, the spark-ignition process is a key factor for the flame initiation propagation and the combustion event. From a computational standpoint, there exist multiple spark-ignition models that perform well under conventional conditions but are not truly predictive under strenuous engine operation modes, where the underlying physics needs to be expanded. In this paper, a hybrid Lagrangian-Eulerian spark-ignition (LESI) model is coupled with different turbulence models, grid sizes, and combustion models. The ignition model, previously developed, relies on coupling Eulerian energy deposition with a Lagrangian particle evolution of the spark channel, at every time-step. The spark channel is attached to the electrodes and allowed to elongate at a speed derived from the flow velocity. The LESI model is used to simulate spark ignition in a nonquiescent crossflow environment at engine-like conditions, using converge commercial computational fluid dynamics (CFD) solver. The results highlight the consistency, robustness, and versatility of the model in a range of engine-like setups, from typical with Reynolds-averaged Navier-Stokes (RANS) and a larger grid size to high fidelity with large-eddy simulation (LES) and a finer grid size. The flame kernel growth is then evaluated against Schlieren images from an optical constant volume ignition chamber with a focus on the performance of flame propagation models, such as G-equation and thickened flame model, versus the baseline well-stirred reactor model. Finally, future development details are discussed.

Advanced ignition modeling↗