Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Equation 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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Estimators and Fusers for Fiber Delay Estimation Using Environmental Measurements

The properties of deployed network fiber are affected by environmental factors due to their exposure to the elements. Particularly for quantum networks, the resultant delay variations may have significant impacts due to the extreme sensitivity of synchronization, coincidence counting, and other critical operations. In this paper, the delays of 15 km aerial-inground fiber connections are measured, and effects due to temperature, humidity and wind speed are analyzed over multiple periods spanning four seasons of a year. Machine learning methods are first utilized to reveal surprisingly pronounced effects of humidity on the delay, in addition to the expected temperature and its seasonal variations. Estimator and fusion methods are developed to estimate the delay using temperature, humidity and wind speed measurements, by utilizing smooth Gaussian Process Regression (GPR) and nonsmooth Ensemble of Trees (EOT) methods. Measurements from winter and summer periods are temporally fused using twelve different methods, and eight methods provide estimates for the delay throughout the year with median test errors under 1.28%. The results reveal distinct temperature-humidity trends across the seasons, and the ability of estimator and temporal fusion methods to exploit them for estimating the delay. These results constitute a case study of machine learning analytical results, wherein generalization equations explain the performance of various estimator and fuser methods.

Rao, Nageswara [ORNL] (ORCID:0000000234085941)↗
DOE OSTI2024

Scientific machine learning for closure models in multiscale problems: A review

Here, closure problems are omnipresent when simulating multiscale systems, where some quantities and processes cannot be fully prescribed despite their effects on the simulation's accuracy. Recently, scientific machine learning approaches have been proposed as a way to tackle the closure problem, combining traditional (physics-based) modeling with data-driven (machine-learned) techniques, typically through enriching differential equations with neural networks. This paper reviews the different reduced model forms, distinguished by the degree to which they include known physics, and the different objectives of a priori and a posteriori learning. The importance of adhering to physical laws (such as symmetries and conservation laws) in choosing the reduced model form and choosing the learning method is discussed. The effect of spatial and temporal discretization and recent trends toward discretization-invariant models are reviewed. In addition, we make the connections between closure problems and several other research disciplines: inverse problems, Mori-Zwanzig theory, and multi-fidelity methods. In conclusion, much progress has been made with scientific machine learning approaches for solving closure problems, but many challenges remain. In particular, the generalizability and interpretability of learned models is a major issue that needs to be addressed further.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Learning Optimal Multigrid Smoothers via Neural Networks

Multigrid methods are one of the most efficient techniques for solving large sparse linear systems arising from partial differential equations (PDEs) and graph Laplacians from machine learning applications. One of the key components of multigrid is smoothing, which aims at reducing high-frequency errors on each grid level. However, finding optimal smoothing algorithms is problem-dependent and can impose challenges for many problems. In this paper, we propose an efficient adaptive framework for learning optimized smoothers from operator stencils in the form of convolutional neural networks (CNNs). Here, the CNNs are trained on small-scale problems from a given type of PDEs based on a supervised loss function derived from multigrid convergence theories and can be applied to large-scale problems of the same class of PDEs. Numerical results on anisotropic rotated Laplacian problems and variable coefficient diffusion problems demonstrate improved convergence rates and solution time compared with classical hand-crafted relaxation methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Evaluation of dual-weighted residual and machine learning error estimation for projection-based reduced-order models of steady partial differential equations

Projection-based reduced-order models (pROMs) show great promise as a means to accelerate many-query applications such as forward error propagation, solving inverse problems, and design optimization. In order to deploy pROMs in the context of high-consequence decision making, accurate error estimates are required to determine the region(s) of applicability in the parameter space. The following paper considers the dual-weighted residual (DWR) error estimate for pROMs and compares it to another promising pROM error estimate, machine learned error models (MLEM). Here, we show how DWR can be applied to ROMs and then evaluate DWR on two partial differential equations (PDEs): a two-dimensional linear convection–reaction–diffusion equation, and a three-dimensional static hyper-elastic beam. It is shown that DWR is able to estimate errors for pROMs extrapolating outside of their training set while MLEM is best suited for pROMs used to interpolate within the pROM training set.

42 ENGINEERING↗
DOE OSTI2022

Long-time integration of parametric evolution equations with physics-informed DeepONets

Ordinary and partial differential equations (ODEs/PDEs) play a paramount role in analyzing and simulating complex dynamic processes across all corners of science and engineering. In recent years machine learning tools are aspiring to introduce new effective ways of simulating such equations, however existing approaches are not able to reliably return stable and accurate predictions across long temporal horizons. We aim to address this challenge by introducing an effective framework for learning evolution operators that map random initial conditions to associated ODE/PDE solutions within a short time interval. Such operators can be parametrized by deep neural networks that are trained in an entirely self-supervised manner without requiring one to generate any paired input-output observations. Global long-time predictions across a range of initial conditions can be then obtained by iteratively evaluating the trained model using each prediction as the initial condition for the next evaluation step. Here, this introduces a new approach to temporal domain decomposition that is shown to be effective in performing accurate long-time simulations for a wide range of parametric ODE and PDE systems, from wave propagation, to reaction-diffusion dynamics and stiff chemical kinetics, introducing a new way of rapidly emulating non-equilibrium processes in science and engineering.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

AutoTandemML: Active Learning Enhanced Tandem Neural Networks for Inverse Design Problems

Inverse design in science and engineering involves determining optimal design parameters that achieve desired performance outcomes, a process often hindered by the complexity and high dimensionality of design spaces, leading to significant computational costs. To tackle this challenge, we propose a novel hybrid approach that combines active learning with Tandem Neural Networks to enhance the efficiency and effectiveness of solving inverse design problems. Active learning allows to selectively sample the most informative data points, reducing the required dataset size without compromising accuracy. We investigate this approach using three benchmark problems: airfoil inverse design, photonic surface inverse design, and scalar boundary condition reconstruction in diffusion partial differential equations. We demonstrate that integrating active learning with Tandem Neural Networks outperforms standard approaches across the benchmark suite, achieving better accuracy with fewer training samples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Machine learning models for PDE constrained optimization

Partial differential equation (PDE)-constrained optimization problems arise in a variety of scientific and engineering applications, such as topology optimization, electrodynamics, fluid dynamics, and structural dynamics. However, these problems are often challenging and computationally expensive to solve, due to the need to solve the PDEs within the optimization loop. One approach to reducing the computational cost of these methods while providing convergence guarantees is through inexact trust region methods; this method uses lower fidelity solutions of the PDE at early stages of the optimization and adjusts the required accuracy of inexact PDE solvers as the optimization progresses. In this work, we explore the use of machine learning based surrogate models with these inexact trust region methods. We first demonstrate the potential of this approach by using Gaussian processes as the surrogate model and test this on a simple PDE-constrained optimization problem. We then document explorations into improving the computational costs of evolutional deep neural network / neural Galerkin methods, with the eventual goal of using these methods with the inexact trust region algorithms. We are able to speed up these approaches, albeit at the cost of lower accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Reducing Frequency Bias of Fourier Neural Operators in 3D Seismic Wavefield Simulations Through Multistage Training

The recent development of neural operator (NeurOp) learning for solutions to the elastic wave equation shows promising results and provides the basis for fast large-scale simulations for different seismological applications. In this article, we use the Fourier neural operator (FNO) model to directly solve the 3D Helmholtz wave equation for fast seismic ground-motion simulations on different frequencies and show the frequency bias of the FNO model, that is, it learns the lower frequencies better comparing to the higher frequencies. To reduce the frequency bias, we adopt the multistage FNO training, that is, after training a stage 1 FNO model for estimating the ground motion, we use a second FNO model as the stage 2 to learn from the residual, which greatly reduced the errors on the higher frequencies. By adopting this multistage training, the FNO models show reduced biases on higher frequencies, which enhanced the overall results of the ground-motion simulations. Thus the multistage training FNO improves the accuracy and realism of the ground-motion simulations.

earthquakes↗
NASA NTRS1992

Progress in unstructured-grid methods development for unsteady aerodynamic applications

The development of unstructured-grid methods for the solution of the equations of fluid flow and what was learned over the course of the research are summarized. The focus of the discussion is on the solution of the time-dependent Euler equations including spatial discretizations, temporal discretizations, and boundary conditions. An example calculation with an implicit upwind method using a CFL number of infinity is presented for the Boeing 747 aircraft. The results were obtained in less than one hour CPU time on a Cray-2 computer, thus, demonstrating the speed and robustness of the capability. Additional calculations for the ONERA M6 wing demonstrate the accuracy of the method through the good agreement between calculated results and experimental data for a standard transonic flow case.

Batina, John T.↗
DOE OSTI2025

Inferring Plant Acclimation and Improving Model Generalizability With Differentiable Physics‐Informed Machine Learning of Photosynthesis

Net photosynthesis (A N ) is a key component of the global carbon cycle influencing climate feedback over decadal scales. Although plant acclimation to environmental changes can modify A N , traditional vegetation models in Earth system models (ESMs) often rely on plant functional type (PFT)-specific parameterizations or simplified acclimation assumptions limiting generalizability across time, space, and PFTs. In this study, we developed a differentiable photosynthesis model to learn the environmental dependencies of V c,max25 (maximum carboxylation rate at 25°C, representing photosynthetic capacity), as this genre of hybrid physics-informed machine learning can seamlessly train neural networks and process-based equations together. Compared to PFT-specific parameterization of V c,max25 , learning the environment dependencies of key photosynthetic parameters improved model spatiotemporal generalizability. Applying environmental acclimation to V c,max25 led to substantial variations in global mean A N indicating the need to address acclimation in ESMs. The model effectively captured multivariate observations (V c,max25 , A N , and stomatal conductance (g s )) simultaneously with multivariate constraints, improving generalization across space and PFTs. It also learned sensible acclimation relationships of V c,max25 to different environmental conditions. The model explained more than 54%, 57%, and 62% of the variance of A N , g s , and V c,max25 , respectively, presenting a first global-scale spatial test benchmark of A N and g s . These results highlight the potential for differentiable modeling to enhance process-based modules in ESMs and effectively leverage information from large, multivariate data sets.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Respecting causality for training physics-informed neural networks

While the popularity of physics-informed neural networks (PINNs) is steadily rising, to this date PINNs have not been successful in simulating dynamical systems whose solution exhibits multi-scale, chaotic or turbulent behavior. In this work we attribute this shortcoming to the inability of existing PINNs formulations to respect the spatio-temporal causal structure that is inherent to the evolution of physical systems. We argue that this is a fundamental limitation and a key source of error that can ultimately steer PINN models to converge towards erroneous solutions. We address this pathology by proposing a simple re-formulation of PINNs loss functions that can explicitly account for physical causality during model training. We demonstrate that this simple modification alone is enough to introduce significant accuracy improvements, as well as a practical quantitative mechanism for assessing the convergence of a PINNs model. Here we provide state-of-the-art numerical results across a series of benchmarks for which existing PINNs formulations fail, including the chaotic Lorenz system, the Kuramoto–Sivashinsky equation in the chaotic regime, and the Navier–Stokes equations. To the best of our knowledge, this is the first time that PINNs have been successful in simulating such systems, introducing new opportunities for their applicability to problems of industrial complexity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Enabling probabilistic learning on manifolds through double diffusion maps

Here, we present a generative learning framework for probabilistic sampling that extends Probabilistic Learning on Manifolds (PLoM), which is designed to generate statistically consistent realizations of a random vector in a finite-dimensional Euclidean space, informed by a (representative) set of observations. In its original form, PLoM constructs a reduced-order probabilistic model by combining three main components: (a) kernel density estimation to approximate the underlying probability measure, (b) Diffusion Maps to characterize the manifold of the data, and (c) a reduced-order Itô Stochastic Differential Equation (ISDE) to sample from the learned distribution. However, its sampling dynamics are posed in the ambient space and the retained number of reduced coordinates is chosen by projection-reconstruction error. In practice, this often (i) requires more coordinates than the data’s intrinsic dimension to achieve stable sampling and (ii) lacks a smooth, basis-independent lifting back to the data domain; moreover, standard Diffusion Maps emphasize harmonic eigenfunctions and can miss non-harmonic latent structure. We address these limitations by decoupling geometry learning from sampling: a first Diffusion Maps pass identifies non-harmonic coordinates on which we formulate a full-order ISDE directly in the latent space, while Double Diffusion Maps captures multiscale geometric features and Geometric Harmonics (GH) learns a smooth lifting map to the ambient variables that is independent of the particular diffusion basis. This hybrid design preserves the system’s dynamical richness with a compact geometric representation and enables principled out-of-sample inference. The effectiveness and robustness of the proposed method are illustrated through two numerical studies: one based on data generated from two-dimensional Hermite polynomial functions and another based on high-fidelity simulations of a detonation wave in a reactive flow.

Double diffusion maps↗
DOE OSTI2021

Estimation of sensor measurement errors in reactor coolant systems using multi-sensor fusion

A nuclear power plant is typically instrumented with a variety of sensors to continually monitor its variables, and their sensor’s measurements may be used to assess the plant state and initiate safety actions, if needed. Errors in sensor measurements, due to factors such as calibration drifts, critically affect such state assessments. Here, we address a problem of estimating sensor errors using physics-informed machine learning methods that use measurements collected under known plant conditions. For a given sensor, we propose an information fusion method that uses measurements from other sensors to estimate its output assuming it is error-free and provides its difference from an actual measurement as an error estimate. We present the ensemble of trees and support vector machine fusers, and evaluate their performance using measurements collected over an emulated test loop of a pressurized water reactor. The plant variables are related to each other through the underlying physical laws under inertial constraints that place bounds on their derivatives, which analytically justify the applicability of machine learning methods for computing these fusers. Under twenty scenarios, we assess their sensor error estimates for pressure sensors of the heat exchanger of a reactor’s primary coolant system. Multiple types of errors are captured by both fusers under externally induced calibration drifts, blockages, minor leaks and air gaps in sensing lines, and electromagnetic interference; the root mean square error of the estimation of error is under 2.2% percent of the maximum measurement. We present generalization equations, in the framework of statistical learning theory, for these methods that characterize the confidence probability that the estimation error is bounded by a specified parameter in future test scenarios.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2024

Benchmarking Optimizers for Qumode State Preparation with Variational Quantum Algorithms

Quantum state preparation involves preparing a target state from an initial system, a process integral to applications such as quantum machine learning and solving systems of linear equations. Recently, there has been a growing interest in qumodes due to advancements in the field and their potential applications. However there is a notable gap in the literature specifically addressing this area. This paper aims to bridge this gap by providing performance benchmarks of various optimizers used in state preparation with Variational Quantum Algorithms. We conducted extensive testing across multiple scenarios, including different target states, both ideal and sampling simulations, and varying numbers of basis gate layers. Our evaluations offer insights into the complexity of learning each type of target state and demonstrate that some optimizers perform better than others in this context. Notably, the Powell optimizer was found to be exceptionally robust against sampling errors, making it a preferred choice in scenarios prone to such inaccuracies. Additionally, the Simultaneous Perturbation Stochastic Approximation optimizer was distinguished for its efficiency and ability to handle increased parameter dimensionality effectively.

Kan, Shuwen [Fordham University]↗
DOE OSTI2024

Sparsified time-dependent Fourier neural operators for fusion simulations

This paper presents a sparsified Fourier neural operator for coupled time-dependent partial differential equations (ST-FNO) as an efficient machine learning surrogate for fluid and particle-based fusion codes such as NIMROD (Non-Ideal Magnetohydrodynamics with Rotation - Open Discussion) and GTC (Gyrokinetic Toroidal Code). ST-FNO leverages the structures in the governing equations and utilizes neural operators to represent Green's function-like numerical operators in the corresponding numerical solvers. Once trained, ST-FNO can rapidly and accurately predict dynamics in fusion devices compared with first-principle numerical algorithms. In general, ST-FNO represents an efficient and accurate machine learning surrogate for numerical simulators for multi-variable nonlinear time-dependent partial differential equations, with the proposed architectures and loss functions. The efficacy of ST-FNO has been demonstrated using quiescent H-mode simulation data from NIMROD and kink-mode simulation data from GTC. The ST-FNO H-mode results show orders of magnitude reduction in memory and central processing unit usage in comparison with the numerical solvers in NIMROD when computing fields over a selected poloidal plane. The ST-FNO kink-mode results achieve a factor of 2 reduction in the number of parameters compared to baseline FNO models without accuracy loss.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Generalization Equations for Machine Learners Based on Physical and Abstract Laws

The physical and abstract laws derived from the first principles have been recently exploited to customize and sharpen machine learning (ML) methods and also derive their generalization equations. These laws often encapsulate knowledge that complements datasets and ML models. We present a generic framework that uses these laws to provide ML codes that are transferable across multiple areas, including data transport infrastructures and thermal hydraulics analytics of nuclear reactors. By anchoring on datasets from these areas and the statistical generalization theory, we present a rigorous approach to co-develop ML solutions and the generalization equations that characterize them, by exploiting the structure and constraints from the laws. We present illustrative examples using practical problems from existing literature on the performance characterization of data transport infrastructures, and the sensor error and power level estimation in nuclear reactor systems using sensor measurements of primary and secondary coolant systems, respectively.

Rao, Nageswara↗
DOE OSTI2025

Generative AI models for learning flow maps of stochastic dynamical systems in bounded domains

Simulating stochastic differential equations (SDEs) in bounded domains, presents significant computational challenges due to particle exit phenomena, which requires accurate modeling of interior stochastic dynamics and boundary interactions. Despite the success of machine learning-based methods in learning SDEs, existing learning methods are not applicable to SDEs in bounded domains because they cannot accurately capture the particle exit dynamics. We present a unified hybrid data-driven approach that combines a conditional diffusion model with an exit prediction neural network to capture both interior stochastic dynamics and boundary exit phenomena. Our ML model consists of two major components: a neural network that learns exit probabilities using binary cross-entropy loss with rigorous convergence guarantees, and a training-free diffusion model that generates state transitions for non-exiting particles using closed-form score functions. The two components are integrated through a probabilistic sampling algorithm that determines particle exit at each time step and generates appropriate state transitions. Here, the performance of the proposed approach is demonstrated via three test cases: a one-dimensional simplified problem for theoretical verification, a two-dimensional advection-diffusion problem in a bounded domain, and a three-dimensional problem of interest to magnetically confined fusion plasmas.

Bounded domains↗
DOE OSTI2024

Coarse-Graining Conformational Dynamics with Multidimensional Generalized Langevin Equation: How, When, and Why

A data-driven ab initio generalized Langevin equation (AIGLE) approach is developed to learn and simulate high-dimensional, heterogeneous, coarse-grained (CG) conformational dynamics. Constrained by the fluctuation–dissipation theorem, the approach can build CG models in dynamical consistency (DC) with all-atom molecular dynamics. Here, we also propose practical criteria for AIGLE to enforce long-term DC. Case studies of a toy polymer, with 20 CG sites, and the alanine dipeptide, with two dihedral angles, elucidate why one should adopt AIGLE or its Markovian limit for modeling CG conformational dynamics in practice.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗