SEARCH · Engineering Papers

Results for “Differentiable physics”

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.

SourceResearch connectionFrom yearThrough year

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

At least 667 records · Page 37

All sources NASA NTRS DOE OSTI

NASA NTRS1991

Optimization of transistor design including large signal device/circuit interactions at extremely high frequencies (20-100+GHz)

Transistor design for extremely high frequency applications requires consideration of the interaction between the device and the circuit to which it is connected. Traditional analytical transistor models are to approximate at some of these frequencies and may not account for variations of dopants and semiconductor materials (especially some of the newer materials) within the device. Physically based models of device performance are required. These are based on coupled systems of partial differential equations and typically require 20 minutes of Cray computer time for a single AC operating point. A technique is presented to extract parameters from a few partial differential equation solutions for the device to create a nonlinear equivalent circuit model which runs in approximately 1 second of personal computer time. This nonlinear equivalent circuit model accurately replicates the contact current properties of the device as computed by the partial differential solver on which it is based. Using the nonlinear equivalent circuit model of the device, optimization of systems design can be performed based on device/circuit interactions.

Levy, Ralph↗

NASA NTRS2014

A Walsh Function Module Users' Manual

The solution of partial differential equations (PDEs) with Walsh functions offers new opportunities to simulate many challenging problems in mathematical physics. The approach was developed to better simulate hypersonic flows with shocks on unstructured grids. It is unique in that integrals and derivatives are computed using simple matrix multiplication of series representations of functions without the need for divided differences. The product of any two Walsh functions is another Walsh function - a feature that radically changes an algorithm for solving PDEs. A FORTRAN module for supporting Walsh function simulations is documented. A FORTRAN code is also documented with options for solving time-dependent problems: an advection equation, a Burgers equation, and a Riemann problem. The sample problems demonstrate the usage of the Walsh function module including such features as operator overloading, Fast Walsh Transforms in multi-dimensions, and a Fast Walsh reciprocal.

Gnoffo, Peter A.↗

NASA NTRSDate not supplied

Calibration of a V-Cone for Low Mass Flows For Small Core Compressor Research

Advancements in core compressor technologies are necessary for next generation, high Overall Pressure Ratio (OPR) turbofan engines. High pressure compressors (HPCs) for future engines are being designed with exit corrected mass flow rates less than 2.25 kg/s (5 lbm/s). In order to accurately measure the performance of these advanced designs, high accuracy measurements are needed in test facilities. The W7 High Speed Multistage Axial Compressor Facility at NASA Glenn Research Center has been used to acquire data for advanced compressor designs. This facility utilizes an advanced differential pressure flow meter called a V-Cone. The facility has historically tested components with physical mass flow rates in the range of 27 to 45 kg/s (60 to 100 lbm/s). As such, when the V-Cone was calibrated prior to installation, the calibrations focused on higher mass flow rates, and uncertainties in that regime range from 0.5% to 0.85%. However, for low mass flow rates under 9 kg/s (20 lbm/s), expected in tests of advanced high OPR HPCs rear stages, the uncertainties of the V-Cone exceed 2.5%. To address this, using a method similar to that utilized by the National Institute of Standards and Technology, an array of Critical Flow Venturi Nozzles (CFVs) was installed in the W7 test section and used to calibrate the V-Cone in 0.5 kg/s (1 lbm/s) increments up to 10.5 kg/s (23 lbm/s). This effort details the measurements and uncertainties associated with this calibration which resulted in a final uncertainty of the V-Cone measurements under 1%.

Measurement Uncertainty↗

DOE OSTI2022

Surface fluctuating hydrodynamics methods for the drift-diffusion dynamics of particles and microstructures within curved fluid interfaces

Here we introduce fluctuating hydrodynamics approaches on surfaces for capturing the drift-diffusion dynamics of particles and microstructures immersed within curved fluid interfaces of spherical shape. We take into account the interfacial hydrodynamic coupling, traction coupling with the surrounding bulk fluid, and thermal fluctuations. For fluid-structure interactions, we introduce Immersed Boundary Methods (IBM) and related Stochastic Eulerian-Lagrangian Methods (SELM) for curved surfaces. We use these approaches to investigate the statistics of surface fluctuating hydrodynamics and microstructures. For velocity autocorrelations, we find characteristic power-law scalings $τ^{-1}, τ^{-2}$, and plateaus can emerge. This depends on the physical regime associated with the geometry, surface viscosity, and bulk viscosity. This differs from the characteristic $τ^{-3/2}$ scaling for bulk three dimensional fluids. We develop theory explaining these observed power-laws associated with time-scales for dissipation within the fluid interface and coupling to the surrounding fluid. We then use our introduced methods to investigate a few example systems and roles of hydrodynamic coupling and thermal fluctuations including for the kinetics of passive particles and active microswimmers in curved fluid interfaces.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Automated identification of dominant physical processes

The identification of processes that locally and approximately dominate dynamical system behavior has enabled significant advances in understanding and modeling nonlinear differential dynamical systems. Conventional methods of dominant process identification involve piecemeal and ad hoc (non-rigorous, informal) scaling analyses to identify dominant balances of governing equation terms and to delineate the spatiotemporal boundaries (boundaries in space and/or time) of each dominant balance. For the first time, we present an objective global measure of the fit of dominant balances to observations, which is desirable for automation, and was previously undefined. Furthermore, we propose a formal definition of the dominant balance identification problem in the form of an optimization problem. Here, we show that the optimization can be performed by various machine learning algorithms, enabling the automatic identification of dominant balances. Our method is algorithm agnostic and it eliminates reliance upon expert knowledge to identify dominant balances which are not known beforehand.

42 ENGINEERING↗

NASA NTRS2004

Novel Optical Diagnostic Techniques for Studying Particle Contact and Deposition Upon a Large Cylinder in a Sheared Suspension

The objectives of this research project were: 1) To study the fluid dynamics of sheared particle-liquid suspensions and the impact of differential particle-fluid inertia; 2) To develop new techniques for observing suspension particle contact and deposition upon solid surfaces. Dr. Yoda was supported by the NASA Office of Biological and Physical Research on a four-year grant from March 2000 through November 2004 for a ground-based study on the fluid dynamics of sheared particle-liquid suspensions and the impact of differential particle-fluid inertia on such flows. Such inertial effects can only be observed in reduced-gravity environments since they are overwhelmed by buoyancy effects on Earth. Moreover, these inertial effects will have a significant impact upon suspension flows in microgravity. Suspension dynamics are of importance in a wide variety of advanced life systems applications, including water reclamation and dust mitigation in confined habitats.

Rashidnia, Nasser↗

DOE OSTI2020

NSFnets (Navier-Stokes flow nets): Physics-informed neural networks for the incompressible Navier-Stokes equations

In the last 50 years there has been a tremendous progress in solving numerically the Navier-Stokes equations using finite differences, finite elements, spectral, and even meshless methods. Yet, in many real cases, we still cannot incorporate seamlessly (multi-fidelity) data into existing algorithms, and for industrial-complexity applications the mesh generation is time consuming and still an art. Moreover, solving ill-posed problems (e.g., lacking boundary conditions) or inverse problems is often prohibitively expensive and requires different formulations and new computer codes. Here, we employ physics-informed neural networks (PINNs), encoding the governing equations directly into the deep neural network via automatic differentiation, to overcome some of the aforementioned limitations for simulating incompressible laminar and turbulent flows. We develop the Navier-Stokes flow nets (NSFnets) by considering two different mathematical formulations of the Navier-Stokes equations: the velocity-pressure (VP) formulation and the vorticity-velocity (VV) formulation. Since this is a new approach, we first select some standard benchmark problems to assess the accuracy, convergence rate, computational cost and flexibility of NSFnets; analytical solutions and direct numerical simulation (DNS) databases provide proper initial and boundary conditions for the NSFnet simulations. The spatial and temporal coordinates are the inputs of the NSFnets, while the instantaneous velocity and pressure fields are the outputs for the VP-NSFnet, and the instantaneous velocity and vorticity fields are the outputs for the VV-NSFnet. This is unsupervised learning and, hence, no labeled data are required beyond boundary and initial conditions and the fluid properties. The residuals of the VP or VV governing equations, together with the initial and boundary conditions, are embedded into the loss function of the NSFnets. No data is provided for the pressure to the VP-NSFnet, which is a hidden state and is obtained via the incompressibility constraint without extra computational cost. Unlike the traditional numerical methods, NSFnets inherit the properties of neural networks (NNs), hence the total error is composed of the approximation, the optimization, and the generalization errors. Here, we empirically attempt to quantify these errors by varying the sampling (“residual”) points, the iterative solvers, and the size of the NN architecture. For the laminar flow solutions, we show that both the VP and the VV formulations are comparable in accuracy but their best performance corresponds to different NN architectures. The initial convergence rate is fast but the error eventually saturates to a plateau due to the dominance of the optimization error. For the turbulent channel flow, we show that NSFnets can sustain turbulence at , but due to expensive training we only consider part of the channel domain and enforce velocity boundary conditions on the subdomain boundaries provided by the DNS data base. We also perform a systematic study on the weights used in the loss function for balancing the data and physics components, and investigate a new way of computing the weights dynamically to accelerate training and enhance accuracy. In the last part, we demonstrate how NSFnets should be used in practice, namely for ill-posed problems with incomplete or noisy boundary conditions as well as for inverse problems. We obtain reasonably accurate solutions for such cases as well without the need to change the NSFnets and at the same computational cost as in the forward well-posed problems. As a result, we also present a simple example of transfer learning that will aid in accelerating the training of NSFnets for different parameter settings.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Toward an event-level analysis of hadron structure using differential programming

Reconstructing the internal properties of hadrons in terms of fundamental quark and gluon de- grees of freedom is a central goal in nuclear and particle physics. This effort lies at the core of major experimental programs, such as the Jefferson Lab 12 GeV program and the upcoming Electron-Ion Collider. A primary challenge is the inherent inverse problem: converting large-scale observational data from collision events into the fundamental QCD-defined densities that characterize the micro- scopic structure of hadronic systems. Recent advances in AI and machine learning have opened new avenues for addressing this challenge using deep learning techniques. A particularly promising direction is the integration of complex theoretical calculations and experimental simulations into a unified framework capable of reconstructing these densities directly from event-level information. In this document, we introduce a key algorithm called LOITS, which enables differentiable program- ming within such a framework, facilitating the use of AI/ML techniques to solve the inverse problem of QCF reconstruction at the event level.

Braga, Kevin [College of William and Mary, William↗

DOE OSTI2024

Beam Dynamics of the Muon $g\textrm{-}2$ Experiment

The Muon $g\textrm{-}2$ Experiment (E989) at Fermilab aims to measure the muon anomalous magnetic moment $a_{\mu}$ with unprecedented precision, potentially uncovering physics beyond the Standard Model of particle physics. The result based on Runs 1-3, released in 2023, achieved a precision of 0.20 ppm. The experiment circulates muons in a storage ring, measuring $a_{\mu}$ from decay positron time and energy measurements collected with calorimeters. To achieve the required accuracy, it is crucial to measure and control the magnetic field in the ring with high precision. Beam dynamics corrections are necessary for muons not orbiting exactly in the midplane, for their oscillations, and for electric field effects. Highly accurate beam dynamics simulations are instrumental for quantifying and validating the beam dynamics corrections, ultimately improving the precision of the $a_{\mu}$ measurement and facilitating the achievement of the ambitious $70\:\mathrm{ppb}$ systematic uncertainty goal. The measured field data was incorporated into models for simulations using three codes: \texttt{gm2ringsim} (an internal Geant4-based code), \textit{COSY INFINITY}, and \textit{BMAD}. The advantages of \texttt{gm2ringsim} include using CAD-based geometry and modelling the detector effects. \textit{COSY INFINITY} is a highly accurate and efficient code that uses high-order differential-algebraic transfer maps, precise fringe field calculations, and advanced symplectification methods. Symplectification is important for maintaining the physical correctness of the muon beam behaviour with high precision over the storage time, ensuring conservation of phase space volume and preventing artificial damping or excitation of particle motion. The experiment completed its final Run 6 in July 2023, collecting 21 times more data than the previous BNL experiment. Analyses of data from Runs 4-6 are ongoing, with results planned for release in 2025, potentially resolving the current tension between experiment and theory.

43 PARTICLE ACCELERATORS↗

DOE OSTI2025

Learning and discovering multiple solutions using physics-informed neural networks with random initialization and deep ensemble

In this work we explore the capability of physics-informed neural networks (PINNs) to discover multiple solutions. Many real-world phenomena governed by nonlinear differential equations (DEs), such as fluid flow, exhibit multiple solutions under the same conditions, yet capturing this solution multiplicity remains a significant challenge. A key difficulty lies in providing appropriate initial conditions or guesses, as widely used time-marching schemes and Newton’s method are highly sensitive to these choices when solving complex computational problems. While machine learning models, particularly PINNs, have shown promise in solving DEs, their ability to capture multiple solutions remains underexplored. In this work, we propose a simple and practical approach using PINNs to learn and discover multiple solutions. We first demonstrate that PINNs, when combined with random initialization and deep ensemble method—originally developed for uncertainty quantification—can effectively uncover multiple solutions to nonlinear ordinary and partial DEs. Although training large ensembles of PINNs may appear computationally demanding, this can be done efficiently using vectorization techniques supported by modern deep learning frameworks, allowing many networks to be trained simultaneously. Our approach highlights the critical role of initialization in shaping solution diversity, addressing an often-overlooked aspect of machine learning for scientific computing. Furthermore, we propose utilizing PINN-generated solutions as initial conditions or initial guesses for conventional numerical solvers to enhance accuracy and efficiency in capturing multiple solutions. Extensive numerical experiments, including the Allen–Cahn equation and cavity flow, where our approach successfully identifies both stable and unstable solutions, validate the effectiveness of our method. These findings establish a general and efficient framework for addressing solution multiplicity in nonlinear DEs.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Volumetric Rendering on Wavelet-Based Adaptive Grid

Numerical modeling of physical phenomena frequently involves processes across a wide range of spatial and temporal scales. In the last two decades, the advancements in wavelet-based numerical methodologies to solve partial differential equations, combined with the unique properties of wavelet analysis to resolve localized structures of the solution on dynamically adaptive computational meshes, make it feasible to perform large-scale numerical simulations of a variety of physical systems on a dynamically adaptive computational mesh that changes both in space and time. Volumetric visualization of the solution is an essential part of scientific computing, yet the existing volumetric visualization techniques do not take full advantage of multi-resolution wavelet analysis and are not fully tailored for visualization of a compressed solution on the wavelet-based adaptive computational mesh. Our objective is to explore the alternatives for the visualization of time-dependent data on space-time varying adaptive mesh using volume rendering while capitalizing on the available sparse data representation. Two alternative formulations are explored. The first one is based on volumetric ray casting of multi-scale datasets in wavelet space. Rather than working with the wavelets at the finest possible resolution, a partial inverse wavelet transform is performed as a preprocessing step to obtain scaling functions on a uniform grid at a user-prescribed resolution. As a result, a solution in physical space is represented by a superposition of scaling functions on a coarse regular grid and wavelets on an adaptive mesh. An efficient and accurate ray casting algorithm is based just on these coarse scaling functions. Additional details are added during the ray tracing by taking an appropriate number of wavelets into account based on support overlap with the interpolation point, wavelet coefficient magnitude, and other characteristics, such as opacity accumulation (front to back ordering) and deviation from frontal viewing direction. The second approach is based on complementing of wavelet-based adaptive mesh to the traditional Adaptive Mesh Refinement (AMR) mesh. Both algorithms are illustrated and compared to the existing volume visualization software for Rayleigh-Benard thermal convection and electron density data sets in terms of rendering time and visual quality for different data compression of both wavelet-based and AMR adaptive meshes.

Vezolainen, Alexei V.↗

DOE OSTI2023

Uncovering Where Compensating Errors Could Hide in ENDF/B-VIII.0

Unconstrained physics spaces between two or more nuclear data observables in a library occur when their values can be simultaneously adjusted without violating the uncertainties in either differential information or simulations of relevant integral experiments. Differential data are often too imprecise to fully bound all nuclear data observables of interest for application simulations. Integral data are simulated with combinations of nuclear data so that an error in one observable may be hidden by a counterbalancing error in another. In this manner compensating errors may lurk within nuclear data libraries and these errors have the potential to undermine the predictive power of neutron transport simulations, particularly in situations where there is no conclusive validation experiment that resembles the application of interest. The EUCLID project (Experiments Underpinned by Computational Learning for Improvements in Nuclear Data) developed a preliminary workflow to identify these unconstrained physics spaces by bringing together results from a large collection of integral experiments with their simulated counter-parts as well as differential information that have a one-to-one correspondence to nuclear data. This wealth of information is processed by machine learning tools for subsequent refinement by human experts. Here, we show how the EUCLID work-flow is executed by applying it first to 239 Pu and then to 9 Be nuclear data in ENDF/B-VIII.0.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2022

Uncovering Where Compensating Errors Could Hide in ENDF/B-VIII.0

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2020

Learning and meta-learning of stochastic advection–diffusion–reaction systems from sparse measurements

Physics-informed neural networks (PINNs) were recently proposed in [18] as an alternative way to solve partial differential equations (PDEs). A neural network (NN) represents the solution, while a PDE-induced NN is coupled to the solution NN, and all differential operators are treated using automatic differentiation. Here, we first employ the standard PINN and a stochastic version, sPINN, to solve forward and inverse problems governed by a non-linear advection–diffusion–reaction (ADR) equation, assuming we have some sparse measurements of the concentration field at random or pre-selected locations. Subsequently, we attempt to optimise the hyper-parameters of sPINN by using the Bayesian optimisation method (meta-learning) and compare the results with the empirically selected hyper-parameters of sPINN. In particular, for the first part in solving the inverse deterministic ADR, we assume that we only have a few high-fidelity measurements, whereas the rest of the data is of lower fidelity. Hence, the PINN is trained using a composite multi-fidelity network, first introduced in [12], that learns the correlations between the multi-fidelity data and predicts the unknown values of diffusivity, transport velocity and two reaction constants as well as the concentration field. For the stochastic ADR, we employ a Karhunen–Loève (KL) expansion to represent the stochastic diffusivity, and arbitrary polynomial chaos (aPC) to represent the stochastic solution. Correspondingly, we design multiple NNs to represent the mean of the solution and learn each aPC mode separately, whereas we employ a separate NN to represent the mean of diffusivity and another NN to learn all modes of the KL expansion. For the inverse problem, in addition to stochastic diffusivity and concentration fields, we also aim to obtain the (unknown) deterministic values of transport velocity and reaction constants. The available data correspond to 7spatial points for the diffusivity and 20 space–time points for the solution, both sampled 2000 times. We obtain good accuracy for the deterministic parameters of the order of 1–2% and excellent accuracy for the mean and variance of the stochastic fields, better than three digits of accuracy. In the second part, we consider the previous stochastic inverse problem, and we use Bayesian optimisation to find five hyper-parameters of sPINN, namely the width, depth and learning rate of two NNs for learning the modes. Here, we obtain much deeper and wider optimal NNs compared to the manual tuning, leading to even better accuracy, i.e., errors less than 1% for the deterministic values, and about an order of magnitude less for the stochastic fields.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

DONUT: physics-aware machine learning for real-time X-ray nanodiffraction analysis

Coherent X-ray scattering techniques are critical for investigating the fundamental structural properties of materials at the nanoscale. While advancements have made these experiments more accessible, real-time analysis remains a significant bottleneck, often hindered by artifacts and computational demands. In scanning X-ray nanodiffraction microscopy, which is widely used to spatially resolve structural heterogeneities, this challenge is compounded by the convolution of the divergent beam with the sample’s local structure. To address this, we introduce DONUT (Diffraction with Optics for Nanobeam by Unsupervised Training), a physics-aware neural network designed for the rapid and automated analysis of nanobeam diffraction data. By incorporating a differentiable geometric diffraction model directly into its architecture, DONUT learns to predict crystal lattice strain and orientation in real-time. Crucially, this is achieved without reliance on labeled datasets or pre-training, overcoming a fundamental limitation for supervised machine learning in X-ray science. We demonstrate experimentally that DONUT accurately extracts all features within the data over 200 times more efficiently than conventional fitting methods.

Materials science↗

DOE OSTI2026

SODAs: sparse optimization for the discovery of differential and algebraic equations

Differential-algebraic equations (DAEs) integrate ordinary differential equations (ODEs) with algebraic constraints, providing a fundamental framework for developing models of dynamical systems characterized by time-scale separation, conservation laws and physical constraints. While sparse optimization has revolutionized model development by allowing data-driven discovery of parsimonious models from a library of possible equations, existing approaches for dynamical systems assume DAEs can be reduced to ODEs by eliminating variables before model discovery. This assumption limits the applicability of such methods for DAE systems with unknown constraints and time scales. We introduce sparse optimization for differential-algebraic systems (SODAs), a data-driven method for the identification of DAEs in their explicit form. By discovering the algebraic and dynamic components sequentially without prior identification of the algebraic variables, this approach leads to a sequence of convex optimization problems. It has the advantage of discovering interpretable models that preserve the structure of the underlying physical system. To this end, SODAs improves since SODAs is singular numerical stability when handling high correlations between library terms, caused by near-perfect algebraic relationships, by iteratively refining the conditioning of the candidate library. We demonstrate the performance of our method on biological, mechanical and electrical systems, showcasing its robustness to noise in both simulated time series and real-time experimental data.

DAE↗

DOE OSTI2024

Angular analysis of B → K * e + e − in the low- q 2 region with new electron identification at Belle

We perform an angular analysis of the B → K * e + e − decay for the dielectron mass squared, q 2 , range of 0.0008 – 1.1200 GeV 2 / c 4 using the full Belle dataset in the K * 0 → K + π − and K * + → K S 0 π + channels, incorporating new methods of electron identification to improve the statistical power of the dataset. This analysis is sensitive to contributions from right-handed currents from physics beyond the Standard Model by constraining the Wilson coefficients C 7 ( ′ ) . We perform a fit to the B → K * e + e − differential decay rate and measure the imaginary component of the transversality amplitude to be A T Im = − 1.27 ± 0.52 ± 0.12 , and the K * transverse asymmetry to be A T ( 2 ) = 0.52 ± 0.53 ± 0.11 , with F L and A T Re fixed to the Standard Model values. The resulting constraints on the value of C 7 ′ are consistent with the Standard Model within a 2 σ confidence interval. Published by the American Physical Society 2024

Ferlewicz, D. (ORCID:0000000243741234)↗

NASA NTRS1985

Generation of Surface Coordinates by Elliptic Partial Differential Equations

The problem of generating spatial coordinates by numerical methods through carefully selected mathematical models is of current interest both in mechanics and physics. The problem of generation of a desired system of coordinates in a given surface was considered, which essentially is an effort directed to the problem of grid generation in a two-dimensional non-Euclidean space. The mathematical model selected for this purpose is based on the formulae of Gauss for a surface. The proposed equations can be used to generate a new coordinate system from the data of an already given coordinate system in a surface. If the coefficients of the first and second fundamental forms have been given, then the proposed equations can be used to generate a surface satisfying the given data (surface fitting). The proposed equations can also be used to generate surfaces in the space between two arbitrary given surfaces, thus providing 3D grids in an Euclidean space.

Warsi, Z. U. A.↗