Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “kernel”

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 901 records · Page 50
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

A high-order computational framework for particle-resolved simulations of disperse multiphase flows

This work presents a high-order numerical approach for particle-resolved simulations of disperse multiphase flows, where the Navier-Stokes equations for fluid flow are solved using a high-order spectral element method in the Eulerian framework, and the particle phase is directly simulated with a discrete element method. The coupling between particles and fluids is explicitly handled using an adapted direct-forcing immersed boundary method. Unlike the conventional schemes, a high-order barycentric Lagrange interpolation method and a Gaussian projection kernel are used to ensure accurate momentum exchange between local boundary points and surrounding fluid nodes in the framework of high-order fluid solver. Benchmark tests of increasing complexity are conducted to demonstrate the accuracy and efficiency of our method. Here, it is found that our approach exhibits an excellent convergence performance, as the fluid element/grid is refined and the number of boundary points increases. Compared to conventional low-order methods, the proposed high-order framework enables the use of substantially larger fluid elements while maintaining high accuracy in modeling fluid-particle interactions, owing to the enhanced resolution of high-order basis functions. Moreover, since the primary unknowns are stored at element or grid nodes, the high-order approach offers improved efficiency in both CPU memory usage and total computational cost.

42 ENGINEERING↗
DOE OSTI2026

Polymer coatings on zirconia microspheres via rotating flow fluid dynamics

Conventional tristructural isotropic (TRISO) coatings for nuclear fuels require multi-step and expensive formation processes; any breakage of the coatings may lead to fission species release. Polymer derived ceramic (PDC) coatings can be a suitable alternative to address these issues. In this study, allylhydridopolycarbosilane (SMP-10) coatings were created on yttria stabilized zirconia (YSZ) microspheres using a Rotating Flow Fluid Dynamics (RFFD) coating method. The effects of curing temperature, rotation speed, and coating cycle/time on the coating were analyzed. Surface functionalization of YSZ microspheres with NaOH resulted in good adhesion between the polymer precursor and the YSZ kernel particles. Spectroscopy analysis revealed complete curing of SMP-10 coated YSZ at 160 °C. Rotation speed and coating time significantly affect the coating characteristics. After 3 cycles at lower rotation speed (50 rpm) for 10 min each, the coating obtained was uniform and homogeneous. In comparison, the coating showed almost 10 times less eccentricity at a high rotation speed of 300 rpm. Compared with the coatings prepared at 300 rpm condition, the coatings have higher sphericity and lower eccentricity at 50 rpm. Overall, this study provides a novel and effective route for fabricating and curing SMP-10 precursor coatings on YSZ microspheres.

Ravi, Nivetha [University of Alabama, Birmingham]↗
DOE OSTI2020

On The Use of Sectional Techniques for the Solution of Depolymerization Population Balances: Results on a Discrete-Continuous Mesh

To study the discrete bond-breaking phenomena of depolymerization, the use of a fully continuous Population Balance Equation (PBE) is inadequate to embody all the inherent characteristics of the process, thus resulting in the need for a discrete-continuous mesh. In this work, the performance of the three most state-of-the-art sectional techniques, i.e. the fixed pivot technique (FPT), cell average technique (CAT) and finite volume scheme (FVS) in approximating discrete depolymerization using discrete-continuous PBEs was extensively compared and evaluated. The solutions from these three methods show different accuracy depending on the breakage mechanisms. For chain-end scission, the FPT and the CAT satisfactorily predict the population densities and moments whereas the FVS fails to predict the population densities but preserves the zeroth and the first moments. In the application of a discrete-continuous model, we identified a previously-not-reported issue of a precipitous drop in the number density at the boundary of discrete and continuous region specifically for chain-end scission. We successfully fixed this problem by employing the alterations proposed in this paper, to the particle allocation functions at the boundary points. For random scission, all three sectional techniques predict the population densities and moments to a high degree of accuracy, even at a very coarse mesh, through the use of our new stoichiometric kernel which is able to closely approximate the inherently discrete bond-breaking depolymerization process. The assessments in this present work intends to provide a clear-cut direction to efficient and economical modelling of depolymerization processes.

Ahamed, Firnaaz↗
DOE OSTI2020

Dynamic Performance Enhancement for Nonlinear Stochastic Systems Using RBF Driven Nonlinear Compensation with Extended Kalman Filter

In this paper, a novel hybrid control method is proposed to enhance the control performance of the PI based control system for a class of nonlinear and non-Gaussian stochastic dynamic processes with unmeasurable states. Firstly, to enhance the tracking performance of the PI controller where the PI parameters are fixed in many actual control systems, the compensative signal is formed using the extended Kalman filter(EKF) based state estimator and driven by the radial basis function (RBF) neural network based compensator. In addition, the weights of RBF is trained to minimize the entropy criterion of tracking error as the process is subjected to non-Gaussian disturbances. Meanwhile, since the precise statistical property of noises is hard to obtain for many industrial processes, the kernel density estimation (KDE) technique is employed in this paper to estimate the entropy. The convergence of RBF network is discussed and the stability of the resulted closed-loop hybrid control system is analyzed in mean square sense. Finally, a numerical example and a practical system testing are given to illustrate the effectiveness of the proposed control method.

stochastic systems, PI Controller, Entropy, Extend↗
DOE OSTI2021

Multichannel Analysis of Surface Waves Accelerated (MASWAccelerated): Software for efficient surface wave inversion using MPI and GPUs

Multichannel Analysis of Surface Waves (MASW) is a technique frequently used in geotechnical engineering and engineering geophysics to infer 1D layered models of seismic shear wave velocities in the top tens to hundreds of meters of the subsurface. We aim to accelerate MASW calculations by capitalizing on modern computer hardware available in the workstations of most engineers: multiple cores and graphics processing units (GPUs). We propose new parallel and GPU accelerated algorithms for computing 1D MASW inversion, and provide software implementations in C using Message Passing Interface (MPI) and CUDA. These algorithms take advantage of sparsity that arises in the problem, and the work balance between processes considers typical data trends. We compare our methods to an existing open source Matlab MASW tool. Our serial C implementation achieves a 2x speedup over the Matlab software, and we continue to see improvements by parallelizing the problem with MPI. Here we see nearly perfect strong and weak scaling for uniform data, and improve strong scaling for realistic data by repartitioning the problem to process mapping. By utilizing GPUs available on most modern workstations, we observe an additional 1.3x speedup over the serial C implementation on the first use of the method. We typically repeatedly evaluate theoretical dispersion curves as part of an optimization procedure, and on the GPU the kernel can be cached for faster reuse on later runs. We observe a 3.2x speedup on the cached GPU runs compared to the serial C runs. This work is the first open-source parallel or GPU-accelerated software tool for MASW imaging, and should enable geotechnical engineers to fully utilize all computer hardware at their disposal.

58 GEOSCIENCES↗
DOE OSTI2021

Enhanced relaxed physical factorization preconditioner for coupled poromechanics

The relaxed physical factorization (RPF) preconditioner is a recent algorithm allowing for the efficient and robust solution to the block linear systems arising from the three-field displacement-velocity-pressure formulation of coupled poromechanics. For its application, however, it is necessary to invert blocks with the algebraic form C^ = (C + βFF T ), where C is a symmetric positive definite matrix, FF T a rank-deficient term, and β a real non-negative coefficient. The inversion of C^, performed in an inexact way, can become unstable for large values of β, as it usually occurs at some stages of a full poromechanical simulation. In this work, we propose a family of algebraic techniques to stabilize the inexact solve with C^. This strategy can prove useful in other problems as well where such an issue might arise, such as augmented Lagrangian preconditioning techniques for Navier-Stokes or incompressible elasticity. First, we introduce an iterative scheme obtained by a natural splitting of matrix C^. Second, we develop a technique based on the use of a proper projection operator annihilating the near-kernel modes of C^. Both approaches give rise to a novel class of preconditioners denoted as Enhanced RPF (ERPF). Furthermore, effectiveness and robustness of the proposed algorithms are demonstrated in both theoretical benchmarks and real-world large-size applications, outperforming the native RPF preconditioner.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Generalized moving least squares vs. radial basis function finite difference methods for approximating surface derivatives

Approximating differential operators defined on two-dimensional surfaces is an important problem that arises in many areas of science and engineering. Over the past ten years, localized meshfree methods based on generalized moving least squares (GMLS) and radial basis function finite differences (RBF-FD) have been shown to be effective for this task as they can give high orders of accuracy at low computational cost, and they can be applied to surfaces defined only by point clouds. However, there have yet to be any studies that perform a direct comparison of these methods for approximating surface differential operators (SDOs). The first purpose of this work is to fill that gap. For this comparison, we focus on an RBF-FD method based on polyharmonic spline kernels and polynomials (PHS+Poly) since they are most closely related to the GMLS method. Additionally, we use a relatively new technique for approximating SDOs with RBF-FD called the tangent plane method since it is simpler than previous techniques and natural to use with PHS+Poly RBF-FD. Further, the second purpose of this work is to relate the tangent plane formulation of SDOs to the local coordinate formulation used in GMLS and to show that they are equivalent when the tangent space to the surface is known exactly. The final purpose is to use ideas from the GMLS SDO formulation to derive a new RBF-FD method for approximating the tangent space for a point cloud surface when it is unknown. For the numerical comparisons of the methods, we examine their convergence rates for approximating the surface gradient, divergence, and Laplacian as the point clouds are refined for various parameter choices. We also compare their efficiency in terms of accuracy per computational cost, both when including and excluding setup costs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Linking spout fluidization hydrodynamics to pyrolytic carbon deposition characteristics in a fluidized bed chemical vapor deposition reactor

Spout fluidized bed chemical vapor deposition (SFB-CVD) is the dominant method for producing pyrolytic carbon (PyC) coatings on tristructural-isotropic (TRISO) fuel particles, yet the relationship between gas injector design, fluidization hydrodynamics, and resulting coating quality remains poorly quantified. Here, in this work, three spout fluidized bed (SFB) nozzle geometries were designed and fabricated to empirically investigate how injector-driven changes in particle circulation influence PyC deposition. The geometries were first evaluated in a room temperature fluidization apparatus using time-resolved particle image velocimetry, which highlighted distinct differences in particle velocity fields, circulation pathways, and overall fluidization quality. Graphite versions of each injector geometry were subsequently implemented in a laboratory-scale SFB-CVD reactor to deposit PyC onto surrogate fuel kernels under similar conditions. Post-deposition characterization included particle morphology, coating thickness, porosity distribution, optical anisotropy, and microindentation mechanical testing. Overall, the results show clear differences in coating microstructure as a function of changing injector geometry, despite mechanical testing indicating comparable elastic modulus values across all coatings. This study provides one of the first fully experimental, quantitative mappings between SFB nozzle geometry, fluidization hydrodynamics, and resulting PyC coating structure. The framework established here supports rational injector design and offers a pathway toward improved coating control in future pilot- and production-scale TRISO fuel fabrication systems.

Coated particle fuel↗
DOE OSTI2020

Data-driven surrogates for high dimensional models using Gaussian process regression on the Grassmann manifold

This paper introduces a surrogate modeling scheme based on Grassmannian manifold learning to be used for cost-efficient predictions of high-dimensional stochastic systems. The method exploits subspace-structured features of each solution by projecting it onto a Grassmann manifold. This point-wise linear dimensionality reduction harnesses the structural information to assess the similarity between solutions at different points in the input parameter space. The method utilizes a solution clustering approach in order to identify regions of the parameter space over which solutions are sufficiently similarly such that they can be interpolated on the Grassmannian. In this clustering, the reduced-order solutions are partitioned into disjoint clusters on the Grassmann manifold using the eigen-structure of properly defined Grassmannian kernels and, the Karcher mean of each cluster is estimated. Then, the points in each cluster are projected onto the tangent space with origin at the corresponding Karcher mean using the exponential mapping. For each cluster, a Gaussian process regression model is trained that maps the input parameters of the system to the reduced solution points of the corresponding cluster projected onto the tangent space. Using this Gaussian process model, the full-field solution can be efficiently predicted at any new point in the parameter space. In certain cases, the solution clusters will span disjoint regions of the parameter space. In such cases, for each of the solution clusters we utilize a second, density-based spatial clustering to group their corresponding input parameter points in the Euclidean space. The proposed method is applied to two numerical examples. Here, the first is a nonlinear stochastic ordinary differential equation with uncertain initial conditions where the surrogate is used to predict the time history solution. The second involves modeling of plastic deformation in a model amorphous solid using the Shear Transformation Zone theory of plasticity, where the proposed surrogate is used to predict the full strain field of a material specimen under large shear strains.

42 ENGINEERING↗
DOE OSTI2021

A compute-bound formulation of Galerkin model reduction for linear time-invariant dynamical systems

This work aims to advance computational methods for projection-based reduced-order models (ROMs) of linear time-invariant (LTI) dynamical systems. For such systems, current practice relies on ROM formulations expressing the state as a rank-1 tensor (i.e., a vector), leading to computational kernels that are memory bandwidth bound and, therefore, ill-suited for scalable performance on modern architectures. This weakness can be particularly limiting when tackling many-query studies, where one needs to run a large number of simulations. This work introduces a reformulation, called rank-2 Galerkin, of the Galerkin ROM for LTI dynamical systems which converts the nature of the ROM problem from memory bandwidth to compute bound. We present the details of the formulation and its implementation, and demonstrate its utility through numerical experiments using, as a test case, the simulation of elastic seismic shear waves in an axisymmetric domain. We quantify and analyze performance and scaling results for varying numbers of threads and problem sizes. In conclusion, we present an end-to-end demonstration of using the rank-2 Galerkin ROM for a Monte Carlo sampling study. We show that the rank-2 Galerkin ROM is one order of magnitude more efficient than the rank-1 Galerkin ROM (the current practice) and about 970 times more efficient than the full-order model, while maintaining accuracy in both the mean and statistics of the field.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Gaussian process regression constrained by boundary value problems

We develop a framework for Gaussian processes regression constrained by boundary value problems. The framework may be applied to infer the solution of a well-posed boundary value problem with a known second-order differential operator and boundary conditions, but for which only scattered observations of the source term are available. Scattered observations of the solution may also be used in the regression. The framework combines co-kriging with the linear transformation of a Gaussian process together with the use of kernels given by spectral expansions in eigenfunctions of the boundary value problem. Furthermore, it benefits from a reduced-rank property of covariance matrices. We demonstrate that the resulting framework yields more accurate and stable solution inference as compared to physics-informed Gaussian process regression without boundary condition constraints.

42 ENGINEERING↗
DOE OSTI2022

A comprehensive and fair comparison of two neural operators (with practical extensions) based on $\mathrm{FAIR}$ data

Neural operators can learn nonlinear mappings between function spaces and offer a new simulation paradigm for real-time prediction of complex dynamics for realistic diverse applications as well as for system identification in science and engineering. Herein, we investigate the performance of two neural operators, which have shown promising results so far, and we develop new practical extensions that will make them more accurate and robust and importantly more suitable for industrial-complexity applications. The first neural operator, DeepONet, was published in 2019 (Lu et al., 2019), and its original architecture was based on the universal approximation theorem of Chen & Chen (1995). The second one, named Fourier Neural Operator or FNO, was published in 2020, and it is based on parameterizing the integral kernel in the Fourier space. DeepONet is represented by a summation of products of neural networks (NNs), corresponding to the branch NN for the input function and the trunk NN for the output function; both NNs are general architectures, e.g., the branch NN can be replaced with a CNN or a ResNet. According to Kovachki et al. (2021), FNO in its continuous form can be viewed conceptually as a DeepONet with a specific architecture of the branch NN and a trunk NN represented by a trigonometric basis. In order to compare FNO with DeepONet computationally for realistic setups, we develop several extensions of FNO that can deal with complex geometric domains as well as mappings where the input and output function spaces are of different dimensions. We also develop an extended DeepONet with special features that provide inductive bias and accelerate training, and we present a faster implementation of DeepONet with cost comparable to the computational cost of FNO, which is based on the Fast Fourier Transform. Here we consider 16 different benchmarks to demonstrate the relative performance of the two neural operators, including instability wave analysis in hypersonic boundary layers, prediction of the vorticity field of a flapping airfoil, porous media simulations in complex-geometry domains, etc. We follow the guiding principles of FAIR (Findability, Accessibility, Interoperability, and Reusability) for scientific data management and stewardship. The performance of DeepONet and FNO is comparable for relatively simple settings, but for complex geometries the performance of FNO deteriorates greatly. We also compare theoretically the two neural operators and obtain similar error estimates for DeepONet and FNO under the same regularity assumptions.

42 ENGINEERING↗
DOE OSTI2025

An end-to-end deep learning method for solving nonlocal Allen–Cahn and Cahn–Hilliard phase-field models

Here, we propose an efficient end-to-end deep learning method for solving nonlocal Allen–Cahn (AC) and Cahn–Hilliard (CH) phase-field models. One motivation for this effort emanates from the fact that discretized partial differential equation-based AC or CH phase-field models result in diffuse interfaces between phases, with the only recourse for remediation is to severely refine the spatial grids in the vicinity of the true moving sharp interface whose width is determined by a grid-independent parameter that is substantially larger than the local grid size. In this work, we introduce non-mass conserving nonlocal AC or CH phase-field models with regular, logarithmic, or obstacle double-well potentials. Because of non-locality, some of these models feature totally sharp interfaces separating phases. The discretization of such models can lead to a transition between phases whose width is only a single grid cell wide. Another motivation is to use deep learning approaches to ameliorate the otherwise high cost of solving discretized nonlocal phase-field models. To this end, loss functions of the customized neural networks are defined using the residual of the fully discrete approximations of the AC or CH models, which results from applying a Fourier collocation method and a temporal semi-implicit approximation. To address the long-range interactions in the models, we tailor the architecture of the neural network by incorporating a nonlocal kernel as an input channel to the neural network model. We then provide the results of extensive computational experiments to illustrate the accuracy, predictive capabilities, and cost reductions of the proposed method.

42 ENGINEERING↗
DOE OSTI2020

A statistical model to predict ignition probability

Ignition capability is a critical design constraint for aeronautical gas turbines. However the current trend toward overall lean burn is detrimental to the engine ignition and relight and the ignition system must be adapted to ensure a fast and reliable light-round in all circumstances. As ignition is a stochastic phenomenon, the optimization of an ignition system requires to build ignition probability maps, which is difficult and costly with either experiment or numerical simulation as both require many tests. Here, this work proposes a model to predict the ignition probability map, knowing only flow statistics in non-reacting conditions, i.e., with only one test. The originality of the model is to construct statistics of the flame kernel trajectory, which are then combined with local flow indicators to evaluate the ignition probability at the considered sparking location. Application to a swirled burner operated in premixed, non-premixed and spray combustion modes illustrates the model concepts and demonstrates its ability to recover the experimental ignition map with good accuracy.

42 ENGINEERING↗
DOE OSTI2022

Co-optimized machine-learned manifold models for large eddy simulation of turbulent combustion

Many modeling approaches in large eddy simulation (LES) of turbulent combustion employ a projection of the thermochemical state onto a low-dimensional manifold within state space to reduce the number of transported variables and hence computational cost. Flamelet-generated manifolds (FGM) is an example of a well-established, physics-based approach, but increasingly, principal component analysis (PCA) is being used as a data-driven method for generating manifold models. For both approaches, the nonlinear relationship between the location on the predefined manifold and the outputs of interest, such as reaction rates, can be tabulated or encoded in a neural network. This work proposes a new approach for manifold modeling that extends these existing approaches. A modified neural network structure simultaneously encodes the definition of the manifold variables, the nonlinear mapping, and the subfilter closure for LES. This allows all three of these aspects of the model to be co-optimized, generating a model from any source of combustion thermochemical state data. The manifold parameterizing variables are constrained to be linear combinations of species, as in FGM and PCA-based models, to aid in interpretability and implementation. For LES, subfilter variances of the manifold variables are also included as inputs. Two types of a priori analysis are performed to evaluate the new approach. In the first, the model is trained on data from one-dimensional premixed flames. In this case, the approach recovers the behavior of flamelet-based manifold approaches, and in fact slightly improves performance by identifying an optimized progress variable. The approach is also applied to data from direct numerical simulations of spherical ignition kernels in isotropic turbulence. For any specified manifold dimensionality, the new approach provides substantially lower prediction errors than a PCA-based model developed from the same data set. Additionally, the LES formulation of the new approach can provide accurate predictions for filtered reaction rates across a variety of filter widths.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Direct numerical simulation of a high-pressure hydrogen micromix combustor: Flame structure and stabilisation mechanism

A high-pressure hydrogen micromix combustor has been investigated using direct numerical simulation with detailed chemistry to examine the flame structure and stabilisation mechanism. The configuration of the combustor was based on the design by Schefer et al., using numerical periodicity to mimic a large square array. A precursor simulation of an opposed jet-in-crossflow was first conducted to generate appropriate partially-premixed inflow boundary conditions for the subsequent reacting simulation. The resulting flame can be described as an predominantly-lean inhomogeneously-premixed lifted jet flame. Five main zones were identified: a jet mixing region, a core flame, a peripheral flame, a recirculation zone, and combustion products. The core flame, situated over the jet mixing region, was found to burn as a thin reaction front, responsible for over 85% of the total fuel consumption. The peripheral flame shrouded the core flame, had low mean flow with high turbulence, and burned at very lean conditions (in the distributed burning regime). It was shown that turbulent premixed flame propagation was an order-of-magnitude too slow to stabilise the flame at these conditions. Stabilisation was identified to be due to ignition events resulting from turbulent mixing of fuel from the jet into mean recirculation of very lean hot products. Ignition events were found to correlate with shear-driven Kelvin-Helmholtz vortices, and increased in likelihood with streamwise distance. At the flame base, isolated events were observed, which developed into rapidly burning flame kernels that were blown downstream. Further downstream, near-simultaneous spatially-distributed ignition events were observed, which appeared more like ignition sheets. The paper concludes with a broader discussion that considers generalising from the conditions considered here.

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

Computational diagnostics and characterization of combustion recession in diesel sprays

While low-temperature combustion (LTC) strategies have been found to mitigate nitrogen oxides and particulate matter emissions in diesel engines, studies have also associated LTC with an increase in unburnt hydrocarbons. With more recent studies on diesel after end-of-injection (AEOI), combustion recession is identified as a phenomenon where at near nozzle region, high-temperature ignition (HTI) combustion can propagate back to the nozzle tip consuming the unburnt hydrocarbons AEOI. Current literature has suggested that combustion recession is controlled by auto-ignition. However, high-fidelity simulations and detailed analysis of such a mechanism are missing. In this study, comprehensive Large Eddy Simulations of a reacting spray at “Spray A” conditions are performed, where detailed analysis of combustion recession concerning flame morphology and propagation modes are included. In particular, this study demonstrated for the first time that while combustion recession is mainly auto-ignition dominated (consistent with the literature), a cool flame was found to deflagrate towards the richer regions of the mixture, promoting mixing and increasing the mixture temperature. This leads to HTI kernels, which then grow and develop as deflagrative waves, therefore sustaining the combustion recession process. The study also detailed the extinction mechanism of combustion: the entrainment wave will overlean the near-nozzle mixtures, rendering it unable to support HTI, which leads to the extinction of the upstream flame AEOI in lower reactivity mixtures. Combustion recession is also observed to be contingent on the chemical and diffusion processes, even at low scalar dissipation rates. Finally, a new criterion for combustion recession based on chemical explosive mode is proposed and validated with previous combustion recession index to quantify the extent of HTI in near-nozzle mixtures AEOI. The newly developed metric combined with a previous experimentally-based metric can provide simple but valuable measurements of the degree and propensity of the upstream flame AEOI.

CEMA↗
DOE OSTI2025

In situ multi-tier auto-ignition detection applied to dual-fuel combustion simulations

Here we use an anomaly detection methodology that is centered on analyzing fourth-order joint moments (co-kurtosis), particularly focusing on its application in auto-ignition of combustion problems with large numbers of species. Unsupervised anomaly detection is challenging to generalize across problem types and domains. A recent technique, centered on analyzing information in the fourth-order joint moment co-kurtosis, has shown promise, especially for high-dimensional scientific data. In this work we present developments to the co-kurtosis based anomaly detection method needed to make it effective and scalable for large-scale distributed scientific data, such as those generated by massively parallel simulations. An in situ co-kurtosis algorithm is employed as the anomaly detection method for identifying ignition kernels in simulations of turbulent combustion. Here, we extend an existing methodology which identifies regions of the domain where anomalies are present, and add another tier of anomaly detection where the individual samples contributing to the anomaly are identified. We apply this algorithm on-the-fly to a variety of turbulent reacting flow problems and compare it to the widely used (but significantly more expensive) chemical explosive mode analysis (CEMA). We demonstrate the ability of the method to detect and identify the onset of low and high temperature ignition which can be used for computational steering, as chemical and combustion anomalies occur intermittently at spatio-temporal locations unknown a priori. Finally, we apply our lightweight in situ algorithm to an exascale high-fidelity simulation with a total of 2.4 Trillion degrees of freedom, performed using an adaptive mesh refinement solver. Furthermore, through a scalability analysis, we show that the relative computational cost of this in-situ anomaly detection algorithm compared to an iteration of the reacting flow solver is negligible.

97 MATHEMATICS AND COMPUTING↗