Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “dynamic model learning”

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 361 records · Page 20

A Strategy for Integrating a Large Finite Element Model: X-33 Lessons Learned

The X-33 vehicle is an advanced technology demonstrator sponsored by NASA. For the past three years the Structural Dynamics & Loads Group of NASA's Marshall Space Flight Center has had the task of integrating the X-33 vehicle structural finite element model. In that time, five versions of the integrated vehicle model have been produced and a strategy has evolved that would benefit anyone given the task of integrating structural finite element models that have been generated by various modelers and companies. The strategy that has been presented here consists of six decisions that need to be made. These six decisions are: purpose of model, units, common material list, model numbering, interface control, and archive format. This strategy has been proved and expanded from experience on the X-33 vehicle.

McGhee, David S.↗

Predicting RNA structure and dynamics with deep learning and solution scattering

Advanced deep learning and statistical methods can predict structural models for RNA molecules. However, RNAs are flexible, and it remains difficult to describe their macromolecular conformations in solutions where varying conditions can induce conformational changes. Small-angle x-ray scattering (SAXS) in solution is an efficient technique to validate structural predictions by comparing the experimental SAXS profile with those calculated from predicted structures. There are two main challenges in comparing SAXS profiles to RNA structures: the absence of cations essential for stability and charge neutralization in predicted structures and the inadequacy of a single structure to represent RNA’s conformational plasticity. We introduce a solution conformation predictor for RNA (SCOPER) to address these challenges. This pipeline integrates kinematics-based conformational sampling with the innovative deep learning model, IonNet, designed for predicting Mg 2+ ion binding sites. Validated through benchmarking against 14 experimental data sets, SCOPER significantly improved the quality of SAXS profile fits by including Mg 2+ ions and sampling of conformational plasticity. We observe that an increased content of monovalent and bivalent ions leads to decreased RNA plasticity. Therefore, carefully adjusting the plasticity and ion density is crucial to avoid overfitting experimental SAXS data. SCOPER is an efficient tool for accurately validating the solution state of RNAs given an initial, sufficiently accurate structure and provides the corrected atomistic model, including ions.

59 BASIC BIOLOGICAL SCIENCES↗

Machine learning and process-based modeling of spatiotemporal changes in active layer thickness across Alaska

Permafrost degradation poses a growing threat to infrastructure stability and ecosystem resilience in the rapidly warming Arctic. We investigated the spatiotemporal dynamics of active layer thickness (ALT) across Alaska by integrating field observations, environmental datasets, a physically based Stefan model, and machine learning (ML) techniques. Using weather projections from the Coupled Model Intercomparison Project Phase 6 under two Shared Socioeconomic Pathways (SSP 2-4.5 and SSP 5-8.5), we assessed ALT sensitivity to projected future weather conditions. The random forest (RF) model outperformed the Stefan approach in predicting ALT on the training dataset (R² = 0.84 vs. 0.53) but demonstrated lower generalizability on the test dataset (R² = 0.24 vs. 0.54). The root mean square error (RMSE) for the RF model for training and testing ranged from 14 to 22 cm, compared to 17 and 18 cm for the Stefan model. Variable importance analysis revealed that mean annual temperature and slope angle were the strongest predictors of ALT, accounting for 19% and 18% of the variance, respectively, followed by sediment transport index (14%) and stream power index (11%). Comparative analysis of baseline ALT predictions showed the Stefan model tended to project a thicker active layer (mean ± SD: 65 ± 16 cm), compared to the RF model (mean ± SD: 59 ± 8.8) cm). Both models indicated a latitudinal gradient in ALT, with shallower depths at higher latitudes. Projected ALT increases by 2100 were estimated at 3.3 ± 2.2 cm under SSP 2-4.5 and 5.9 ± 4.0 cm under SSP 5-8.5 for the ML model, whereas the Stefan model projected substantially larger increases of 13 ± 2.6 cm (SSP 2-4.5) and 28 ± 4.4 cm (SSP5-8.5). Spatial analysis showed the greatest ALT increases in northern Alaska, with relatively smaller changes in southern regions. These findings highlight the complex, multifactorial nature of ALT dynamics and the value of hybrid modeling approaches. As rising temperatures accelerate permafrost thaw, changes in ALT can disrupt ecosystems, damage infrastructures, and enhance the release of stored soil carbon, highlighting the urgent need for improved predictive capabilities to inform adaptation strategies in the Arctic.

Climate sciences↗

Goal Directed Model Inversion: A Study of Dynamic Behavior

Goal Directed Model Inversion (GDMI) is an algorithm designed to generalize supervised learning to the case where target outputs are not available to the learning system. The output of the learning system becomes the input to some external device or transformation, and only the output of this device or transformation can be compared to a desired target. The fundamental driving mechanism of GDMI is to learn from success. Given that a wrong outcome is achieved, one notes that the action that produced that outcome 0 "would have been right if the outcome had been the desired one." The algorithm then proceeds as follows: (1) store the action that produced the wrong outcome as a "target" (2) redefine the wrong outcome as a desired goal (3) submit the new desired goal to the system (4) compare the new action with the target action and modify the system by using a suitable algorithm for credit assignment (Back propagation in our example) (5) resubmit the original goal. Prior publications by our group in this area focused on demonstrating empirical results based on the inverse kinematic problem for a simulated robotic arm. In this paper we apply the inversion process to much simpler analytic functions in order to elucidate the dynamic behavior of the system and to determine the sensitivity of the learning process to various parameters. This understanding will be necessary for the acceptance of GDMI as a practical tool.

Colombano, Silvano P.↗

Influence of initial conditions on data-driven model identification and information entropy for ideal mhd problems

Data-driven methods of model identification are able to discern governing dynamics of a system from data. Such methods are well suited to help us learn about systems with unpredictable evolution or systems with ambiguous governing dynamics given our current understanding. Many plasma problems of interest fall into these categories as there are a wide range of models that exist, however each model is only useful in a certain regime and often limited by computational complexity. To ensure data-driven methods align with theory, they must be consistent and predictable when acting on data whose governing dynamics are known. Weak Sparse Identification of Nonlinear Dynamics (WSINDy) is a recently developed data-driven method that has shown promise in learning governing dynamics from data with high noise levels [1]. This work examines how WSINDy acts on ideal MHD test problems as the initial conditions are varied and specifies limiting requirements for successful equation identification. Furthermore, it is hard to recover the governing dynamics from data that emphasize a single dominant behavior. In these low information cases, Shannon information entropy is able to pick up on the redundancies in the data that affect recoverability.

97 MATHEMATICS AND COMPUTING↗

Constrained or unconstrained? Neural-network-based equation discovery from data

Throughout many fields, practitioners often rely on differential equations to model systems. Yet, for many applications, the theoretical derivation of such equations and/or the accurate resolution of their solutions may be intractable. Instead, recently developed methods, including those based on parameter estimation, operator subset selection, and neural networks, allow for the data-driven discovery of both ordinary and partial differential equations (PDEs), on a spectrum of interpretability. The success of these strategies is often contingent upon the correct identification of representative equations from noisy observations of state variables and, as importantly and intertwined with that, the mathematical strategies utilized to enforce those equations. Specifically, the latter has been commonly addressed via unconstrained optimization strategies. Representing the PDE as a neural network, we propose to discover the PDE (or the associated operator) by solving a constrained optimization problem and using an intermediate state representation similar to a physics-informed neural network (PINN). The objective function of this constrained optimization problem promotes matching the data, while the constraints require that the discovered PDE is satisfied at a number of spatial collocation points. We present a penalty method and a widely used trust-region barrier method to solve this constrained optimization problem, and we compare these methods on numerical examples. Our results on several example problems demonstrate that the latter constrained method outperforms the penalty method, particularly for higher noise levels or fewer collocation points. This work motivates further exploration into using sophisticated constrained optimization methods in scientific machine learning, as opposed to their commonly used, penalty-method or unconstrained counterparts. For both of these methods, we solve these discovered neural network PDEs with classical methods, such as finite difference methods, as opposed to PINNs-type methods relying on automatic differentiation. Here, we briefly highlight how simultaneously fitting the data while discovering the PDE improves the robustness to noise and other small, yet crucial, implementation details.

Data-driven discovery↗

Nuclear safety Enhanced: A Deep dive into current and future RAVEN applications

As the horizon of nuclear energy expands with the advent of small modular reactors, IV generation reactors, and fusion reactors, there is a growing perspective that the licensing process could benefit from a more comprehensive approach. Moving beyond traditional deterministic and PRA analysis might pave the way for a novel safety analysis paradigm propelled by the increasing computational power at our disposal. This paper explores different methodologies that can improve the outcomes of nuclear safety analysis. These range from uncertainty quantification techniques, aimed at enhancing the precision of safety margins, to deploying dynamic event trees by driving system code simulations, capturing the potential evolutions of severe accidents. These methodologies introduce innovative dimensions to safety analysis, considering the consequences of postulated events and the dynamics of accident sequences. However, they also bring forth challenges, especially in managing the complexity and sheer volume of potential scenarios. The paper touches upon some strategies to counter these challenges, emphasizing the importance of adaptability and continuous evolution in the face of emerging nuclear safety concerns. Additionally, the paper sheds light on the need for advanced tools to apply these methodologies. Among these tools is RAVEN, an open-source software designed for parametric and probabilistic analyses. Its core components, including distribution, sampler, and reduced order model, enable various applications, from risk assessment and mitigation to dynamic learning and plant control logic simulations.

97 - MATHEMATICS AND COMPUTING↗

Deep Learning Emulation of Subgrid-Scale Processes in Turbulent Shear Flows

Deep neural networks (DNNs) are developed from a data set obtained from the dynamic Smagorinsky model to emulate the subgrid-scale (SGS) viscosity (ν sgs ) and diffusivity (κ sgs ) for turbulent stratified shear flows encountered in the oceans and the atmosphere. These DNNs predict ν sgs and κ sgs from velocities, strain rates, and density gradients such that the evolution of the kinetic energy budget and density variance budget terms is similar to the corresponding values obtained from the original dynamic Smagorinsky model. These DNNs also compute ν sgs and κ sgs ~2–4 times quicker than the dynamic Smagorinsky model resulting in a ~2–2.5 times acceleration of the entire simulation. This study demonstrates the feasibility of deep learning in emulating the subgrid-scale (SGS) phenomenon in geophysical flows accurately in a cost-effective manner. In a broader perspective, deep learning-based surrogate models can present a promising alternative to the traditional parameterizations of the subgrid-scale processes in climate models.

58 GEOSCIENCES↗

What dictates soft clay-like lithium superionic conductor formation from rigid salts mixture

Abstract Soft clay-like Li-superionic conductors, integral to realizing all-solid-state batteries, have been recently synthesized by mixing rigid-salts. Here, through computational and experimental analysis, we clarify how a soft clay-like material can be created from a mixture of rigid-salts. Using molecular dynamics simulations with a deep learning-based interatomic potential energy model, we uncover the microscopic features responsible for soft clay-formation from ionic solid mixtures. We find that salt mixtures capable of forming molecular solid units on anion exchange, along with the slow kinetics of such reactions, are key to soft-clay formation. Molecular solid units serve as sites for shear transformation zones, and their inherent softness enables plasticity at low stress. Extended X-ray absorption fine structure spectroscopy confirms the formation of molecular solid units. A general strategy for creating soft clay-like materials from ionic solid mixtures is formulated.

25 ENERGY STORAGE↗

Evolutionary reinforcement learning of dynamical large deviations

In this work, we show how to bound and calculate the likelihood of dynamical large deviations using evolutionary reinforcement learning. An agent, a stochastic model, propagates a continuous-time Monte Carlo trajectory and receives a reward conditioned upon the values of certain path-extensive quantities. Evolution produces progressively fitter agents, potentially allowing the calculation of a piece of a large-deviation rate function for a particular model and path-extensive quantity. For models with small state spaces, the evolutionary process acts directly on rates, and for models with large state spaces, the process acts on the weights of a neural network that parameterizes the model's rates. This approach shows how path-extensive physics problems can be considered within a framework widely used in machine learning.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On learning what to learn: Heterogeneous observations of dynamics and establishing possibly causal relations among them

Abstract Before we attempt to (approximately) learn a function between two sets of observables of a physical process, we must first decide what the inputs and outputs of the desired function are going to be. Here we demonstrate two distinct, data-driven ways of first deciding “the right quantities” to relate through such a function, and then proceeding to learn it. This is accomplished by first processing simultaneous heterogeneous data streams (ensembles of time series) from observations of a physical system: records of multiple observation processes of the system. We determine (i) what subsets of observables are common between the observation processes (and therefore observable from each other, relatable through a function); and (ii) what information is unrelated to these common observables, therefore particular to each observation process, and not contributing to the desired function. Any data-driven technique can subsequently be used to learn the input–output relation—from k-nearest neighbors and Geometric Harmonics to Gaussian Processes and Neural Networks. Two particular “twists” of the approach are discussed. The first has to do with the identifiability of particular quantities of interest from the measurements. We now construct mappings from a single set of observations from one process to entire level sets of measurements of the second process, consistent with this single set. The second attempts to relate our framework to a form of causality: if one of the observation processes measures “now,” while the second observation process measures “in the future,” the function to be learned among what is common across observation processes constitutes a dynamical model for the system evolution.

Sroczynski, David W.↗

Entropy-driven Optimal Sub-sampling of Fluid Dynamics for Developing Machine-learned Surrogates

Optimal sub-sampling of large datasets from fluid dynamics simulations is essential for training reduced-order machine learned models. A method using Shannon entropy was developed to weight flow features according to their level of information content, such that the most informative features can be extracted and used for training a surrogate model. The method is demonstrated in the canonical flow over a cylinder problem simulated with OpenFOAM. Both time-independent predictions and temporal forecasting were investigated as well as two types of prediction targets: local per-grid-point predictions and global per-time-step predictions. When tested on training a surrogate model, results indicate that our entropy-based sampling method typically outperforms random sampling and yields more reproducible results in less iterations. Finally, the method was used to train a surrogate model for modeling turbulence in magnetohydrodynamic flows, which revealed various challenges and opportunities for future research.

Brewer, Wes↗

Tunable Topological Phonon for Next-generation Quantum Transduction

This project aims to understand the critical factors that determine transduction performance of topological phonons across an oxide perovskite/tungsten diselenide heterojunction. We will investigate mechanisms of their propagation and interfacial coupling using modeling and machine learning approaches. Methods include density functional theory, molecular dynamics, numerical transport simulations, and active learning for building up a training dataset for force field development.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Continual Learning for Production-Level Machine Learning in Particle Accelerators

Particle accelerators operate in complex environments where data distribution can change dynamically, leading to data drifts that significantly challenge Machine Learning (ML) models. These non-stationary conditions often cause ML models to deteriorate in performance, making it difficult to maintain reliable predictions in operation. The primary sources of data drifts are changes in accelerator settings and changes in equipment performance which cannot be measured directly. To bridge this gap between ML development and long-term deployment in operational settings, we identify key areas within particle accelerators where continual learning can help mitigate drift-induced performance degradation. We will provide a practical guide on selecting the appropriate method given resource constraints and desired stability plasticity trade offs. As a concrete example, we will present a real-world use case for anomaly detection to predict errant beams at the Spallation Neutron Source accelerator, where continual learning has been employed to demonstrate stable performance on drifting data streams. We will present practical challenges, lessons learned, and the results from the deployed ML model.

Rajput, Kishansingh [Thomas Jefferson National Acc↗

Weak-Form Latent Space Dynamics Identification

This software showcases the enhanced capabilities of the Latent Space Dynamics Identification (LaSDI) algorithm through the application of the weak form, resulting in WLaSDI. WLaSDI first compresses the data, then projects it onto test functions, and subsequently learns the local latent space models. Notably, WLaSDI demonstrates significantly improved robustness to noise. Using weak-form equation learning techniques, WLaSDI achieves local latent space modeling. Compared to the standard sparse identification of nonlinear dynamics (SINDy) used in LaSDI, the variance reduction of the weak form ensures robust and precise latent space recovery, enabling fast, robust, and accurate simulations. We demonstrate the efficacy of WLaSDI against LaSDI using several common benchmark examples, including viscid and inviscid Burgers', radial advection, and heat conduction. For instance, in 1D inviscid Burgers' simulations with up to 100% Gaussian white noise, WLaSDI maintains relative errors consistently below 6%, whereas LaSDI errors can exceed 10,000%. Similarly, in radial advection simulations, WLaSDI keeps relative errors below 16%, compared to potential errors of up to 10,000% with LaSDI. Additionally, WLaSDI achieves significant speedups, such as a 140X speedup in 1D Burgers' simulations compared to the corresponding full order model.

Choi, Youngsoo↗

Assessment of Machine Learning Wall Modeling Approaches for Large Eddy Simulation of Gas Turbine Film Cooling Flows: An a Priori Study

Here, in this work, a priori analysis of machine learning (ML) strategies is carried out with the goal of data-driven wall modeling for large eddy simulation (LES) of gas turbine film cooling flows. High-fidelity flow datasets are extracted from wall-resolved LES (WRLES) of flow over a flat plate interacting with the coolant flow supplied by a single row of 7-7-7 shaped cooling holes inclined at 30 degrees with the flat plate at different blowing ratios (BR). The WRLES are performed using the high-order Nek5000 spectral element computational fluid dynamics (CFD) solver. Light gradient boosting machine (LightGBM) is employed as the ML algorithm for the data-driven wall model. Parametric tests are conducted to systematically assess the influence of a wide range of input flow features (velocity components, velocity gradients, pressure gradients, and fluid properties) on the accuracy of ML wall model with respect to prediction of wall shear stress. In addition, the use of spatial stencil and time delay is also explored within the ML wall modeling framework. It is shown that features associated with gradients of the streamwise and spanwise velocity components have a major impact on the prediction fidelity of wall model, while the effect of gradients of wall-normal velocity component is found to be negligible. Moreover, adding flow feature information from an x-y-z spatial stencil significantly improves the ML model accuracy and generalizability compared to just using local flow features from the matching location. Overall, highest prediction accuracy is achieved when both spatial stencil and time delay features are incorporated within the data-driven wall modeling paradigm.

33 ADVANCED PROPULSION SYSTEMS↗