Search NASA⌕ Search

SEARCH · Search NASA

Results for “differentiable simulation”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

A physics-based ensemble machine-learning approach to identifying a relationship between lightning indices and binary lightning hazard

To convert lightning indices generated by numerical weather prediction experiments into binary lightning hazard, a machine-learning tool was developed. This tool, consisting of parallel multilayer perceptron classifiers, was trained on an ensemble of planetary boundary layer schemes and microphysics parameterizations that generated four different lightning indices over 1 week. In a subsequent week, the multi-physics ensemble was applied and the machine-learning tool was used to evaluate the accuracy. Unintuitively, the machine-learning tool performed better on the testing dataset than the training dataset. Much of the error may be attributed to mischaracterizing the convection. The combination of the machine learning model and simulations could not differentiate between cloud-to-cloud lightning and cloud-to-ground lightning, despite being trained on cloud-to-ground lightning. It was found that the simulation most representative of the local operational model was the most accurate simulation tested.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Elucidating the Onset of Plasticity in Sliding Contacts Using Differential Computational Orientation Tomography

Abstract Depending on the mechanical and thermal energy introduced to a dry sliding interface, the near-surface regions of the mated bodies may undergo plastic deformation. In this work, we use large-scale molecular dynamics simulations to generate “differential computational orientation tomographs” (dCOT) and thus highlight changes to the microstructure near tribological FCC alloy surfaces, allowing us to detect subtle differences in lattice orientation and small distances in grain boundary migration. The analysis approach compares computationally generated orientation tomographs with their undeformed counterparts via a simple image analysis filter. We use our visualization method to discuss the acting microstructural mechanisms in a load- and time-resolved fashion, focusing on sliding conditions that lead to twinning, partial lattice rotation, and grain boundary-dominated processes. Extracting and laterally averaging the color saturation value of the generated tomographs allows us to produce quantitative time- and depth-resolved maps that give a good overview of the progress and severity of near-surface deformation. Corresponding maps of the lateral standard deviation in the color saturation show evidence of homogenization processes occurring in the tribologically loaded microstructure, frequently leading to the formation of a well-defined separation between deformed and undeformed regions. When integrated into a computational materials engineering framework, our approach could help optimize material design for tribological and other deformation problems. Graphic Abstract .

36 MATERIALS SCIENCE↗
DOE OSTI2021

Structure–Capacitance Relationships of Graphene/Ionic Liquid Electrolyte Double Layers

The differential capacitance profile of electrochemical interfaces reflects the physical properties of the double layer. For carbon electrodes and ionic liquid based electrolytes, these capacitance profiles are not fully understood. In this work, we utilize constant voltage molecular dynamics simulations to compute differential capacitance profiles of ionic liquids [BMIm + ][BF 4 - ] and [BMIm + ][TFSI - ] mixed with acetonitrile and 1,2-dichloroethane, at model graphene electrodes. We find that both pure and 10% mole fraction ionic liquid electrolytes exhibit camel shaped capacitance profiles with two peaks on either side of a minimum centered at the potential of zero charge. This profile shape results from electric field induced rearrangement of ion structure within the inner layer closest to the electrode interface. At low potential, the ionic liquid inner layer is concentrated with non-polar tri-fluoromethyl and butyl functional groups of the anions and cations, corresponding to the minimum of the capacitance profiles. With increasing voltage, electrostatic interactions of polar/charged functional groups with the electrode surface compete with these non-polar interactions, leading to ion rearrangement that increases the inner layer charge density and results in higher capacitance. After the ion restructuring is complete, the response saturates and capacitance diminishes. The presence of organic solvent significantly changes the composition of the inner layer. For example, strong non-polar interactions between dichloroethane molecules and the graphene surface substantially block ion/electrode contact at moderate potentials. Overall, our simulations highlight the dynamic nature of the inner region of organic electrolyte double layers, and the sensitive dependence on electrolyte composition and applied voltage.

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

Unified differentiable digital twin for the IOTA/FAST facility

As the design complexity of modern accelerators grows, there is more interest in using advanced simulations that have fast execution time or produce insights about accelerator state. One notable example of additional information are gradients of physical observables with respect to design parameters produced by differentiable simulations. The IOTA/FAST facility has recently begun a program to implement and experimentally validate a unified start-to-end differentiable digital twin to serve as a virtual accelerator test stand, allowing for rapid prototyping of new software and experiments with minimal beam time costs. In this contribution we will discuss our plans and progress. Specifically, we will cover the selection and benchmarking of both physics and ML codes, the development of generic interfaces between device models and surrogate or physics-based sections, and the export of the parameters through either a deterministic event loop or a fully asynchronous EPICS soft input/output controller. We will also discuss challenges in model calibration and uncertainty quantification, as well as future plans to support larger proton accelerators like PIPII and Booster.

Kuklev, Nikita [Fermilab]↗
DOE OSTI2022

Multi-fidelity modeling to predict the rheological properties of a suspension of fibers using neural networks and Gaussian processes

Unveiling the rheological properties of fiber suspensions is of paramount interest to many industrial applications. There are multiple factors, such as fiber aspect ratio and volume fraction, that play a significant role in altering the rheological behavior of suspensions. Three-dimensional (3D) numerical simulations of coupled differential equations of the suspension of fibers are computationally expensive and time-consuming. Machine learning algorithms can be trained on the available data and make predictions for the cases where no numerical data are available. However, some widely used machine learning surrogates, such as neural networks, require a relatively large training dataset to produce accurate predictions. Multi-fidelity models, which combine high-fidelity data from numerical simulations and less expensive lower fidelity data from resources such as simplified constitutive equations, can pave the way for more accurate predictions. Here, we focus on neural networks and the Gaussian processes with two levels of fidelity, i.e., high and low fidelity networks, to predict the steady-state rheological properties, and compare them to the single-fidelity network. High-fidelity data are obtained from direct numerical simulations based on an immersed boundary method to couple the fluid and solid motion. The low-fidelity data are produced by using constitutive equations. Multiple neural networks and the Gaussian process structures are used for the hyperparameter tuning purpose. Results indicate that with the best choice of hyperparameters, both the multi-fidelity Gaussian processes and neural networks are capable of making predictions with a high level of accuracy with neural networks demonstrating marginally better performance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

New Constraints on the Dark Matter Density Profiles of Dwarf Galaxies from Proper Motions of Globular Cluster Streams

The central density profiles in dwarf galaxy halos depend strongly on the nature of dark matter (DM). Recently, in Malhan et al. we employed N-body simulations to show that the cuspy cold DM subhalos predicted by cosmological simulations can be differentiated from cored subhalos using the properties of accreted globular cluster (GC) streams since these GCs experience tidal stripping within their parent halos prior to accretion onto the Milky Way. We previously found that clusters that are accreted within cuspy subhalos produce streams with larger physical widths and higher dispersions in line-of-sight velocity and angular momentum than streams that are accreted within cored subhalos. Here, we use the same suite of simulations to demonstrate that the dispersion in the tangential velocities of streams (${\sigma }_{{v}_{\mathrm{Tan}}}$) is also sensitive to the central DM density profiles of their parent dwarfs and GCs that they were accreted from; cuspy subhalos produce streams with larger ${\sigma }_{{v}_{\mathrm{Tan}}}$ than those accreted inside cored subhalos. Using Gaia EDR3 observations of multiple GC streams we compare their ${\sigma }_{{v}_{\mathrm{Tan}}}$ values with simulations. The measured ${\sigma }_{{v}_{\mathrm{Tan}}}$ values are consistent with both an “in situ” origin and with accretion inside cored subhalos of M ~ 10 8–9 M ⊙ (or very low-mass cuspy subhalos of mass ~10 8 M ⊙ ). Despite the large current uncertainties in ${\sigma }_{{v}_{\mathrm{Tan}}}$, we find a low probability that any of the progenitor GCs were accreted from cuspy subhalos of M ≳ 10 9 M ⊙ . The uncertainties on Gaia tangential velocity measurements are expected to decrease in future and will allow for stronger constraints on subhalo DM density profiles.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Examining ICARUS Cosmic Muon Signal Shapes

In the search for new physics, such as sterile neutrinos, we must compare our experimental data to the case where this new physics does not exist, which is provided by simulations. However, our detectors and simulations are not perfect, so we need to be able to differentiate imperfections in our simulations, detector effects, and unknown unknowns from new physics. Thus, we need to quantify ICARUS detector systematic uncertainties; in other words, we need to know how much difference between experiment and simulation we can expect due to only detector systematics, so when we see differences greater than this, we can be confident they are due to new physics. To calculate this uncertainty, we study the signals produced in ICARUS by cosmic muons, since these muons are well understood. Ideally, we want to fit these waveforms as Gaussians and compare the fits from experimental data to fits from simulations to calculate the uncertainties, but first, we need to know how accurately these curve s can be described by Gaussians. We examined the peak and the full width at half maximum (FHWM) of signals from simulations, and we produced plots of the distribution of peaks and FHWMs for these signals. We further studied how the peaks and FHWMs varied depending on where the signal came from in the detector. Ultimately, by comparing the actual distribution of peaks and FHWMs to the distribution predicted by the Gaussian fits, we hope to determine how well these signals can be described as Gaussians.

Patino, Nicolas↗
DOE OSTI2025

End-to-end differentiable digital twin for the IOTA/FAST facility

As the design complexity of modern accelerators grows, there is more interest in using controllable-fidelity simulations that have fast execution time or can yield additional insights about accelerator state. One notable example of additional information are gradients of physical observables with respect to design parameters produced by differentiable simulations. The IOTA/FAST facility has recently begun a program to implement and experimentally validate an end-to-end digital twin to serve as a virtual accelerator test stand, allowing for rapid prototyping of new software and experiments with minimal beam time costs. In this contribution we will discuss our plans and progress. Specifically, we will cover the selection and benchmarking of both physics and ML codes for linac and ring simulation, the development of generic interfaces between surrogate and physics-based sections, and presenting the control interface as either a deterministic event loop or a fully asynchronous EPICS soft input/output controller. We will also discuss challenges in model calibration and uncertainty quantification, as well as future plans to implement larger proton accelerators like PIPII and Booster.

Kuklev, N. [Fermilab]↗
DOE OSTI2024

Online randomized interpolative decomposition with a posteriori error estimator for temporal PDE data reduction

Traditional low-rank approximation is a powerful tool for compressing large data matrices that arise in simulations of partial differential equations (PDEs), but suffers from high computational cost and requires several passes over the PDE data. The compressed data may also lack interpretability thus making it difficult to identify feature patterns from the original data. Here, to address these issues, we present an online randomized algorithm to compute the interpolative decomposition (ID) of large-scale data matrices in situ. Compared to previous randomized IDs that used the QR decomposition to determine the column basis, we adopt a streaming ridge leverage score-based column subset selection algorithm that dynamically selects proper basis columns from the data and thus avoids an extra pass over the data to compute the coefficient matrix of the ID. In particular, we adopt a single-pass error estimator based on the non-adaptive Hutch++ algorithm to provide real-time error approximation for determining the best coefficients. As a result, our approach only needs a single pass over the original data and thus is suitable for large and high-dimensional matrices stored outside of core memory or generated in PDE simulations. A strategy to improve the accuracy of the reconstructed data gradient, when desired, within the ID framework is also presented. We provide numerical experiments on turbulent channel flow and ignition simulations, and on the NSTX Gas Puff Image dataset, comparing our algorithm with the offline ID algorithm to demonstrate its utility in real-world applications.

Column subset selection↗
DOE OSTI2024

A discontinuous piecewise polynomial generalized moving least squares scheme for robust finite element analysis on arbitrary grids

A variational approach is developed with a meshless discretization to enable accurate and robust numerical simulation of partial differential equations for meshes that are of poor quality. Traditional finite element methods use the mesh to both discretize the geometric domain and to define the finite element shape functions. The latter creates a dependence between the quality of the mesh and the properties of the finite element basis that may adversely affect the accuracy of the discretized problem. Here, we propose a new approach for defining finite element shape functions that breaks this dependence and separates mesh quality from the discretization quality, which we call discontinuous piecewise polynomial generalized moving least squares (DPP-GMLS). At the core of the approach is a meshless definition of the shape functions, which limits the purpose of the mesh to representing the geometric domain and integrating the basis functions without having any role in their approximation quality. The resulting non-conforming space can be utilized within a standard discontinuous Galerkin framework, providing a rigorous foundation for solving partial differential equations on low-quality meshes. We present a collection of numerical experiments demonstrating our approach in a wide range of settings: strongly coercive elliptic problems, linear elasticity in the compressible regime, and the stationary Stokes problem. We demonstrate convergence for all problems and stability for element pairs for problems which usually require inf-sup compatibility for conforming methods, also referring to a minor modification possible through the symmetric interior penalty Galerkin framework for stabilizing element pairs that would otherwise be traditionally unstable. Mesh robustness is particularly critical for elasticity, and we provide an example that our approach provides a greater than 5 x improvement in accuracy and allows for taking an 8 x larger stable timestep for a highly deformed mesh, compared to the continuous Galerkin finite element method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

QuadConv: Quadrature-based convolutions with applications to non-uniform PDE data compression

We present a new convolution layer for deep learning architectures which we call QuadConv — an approximation to continuous convolution via quadrature. Our operator is developed explicitly for use on non-uniform, mesh-based data, and accomplishes this by learning a continuous kernel that can be sampled at arbitrary locations. Moreover, the construction of our operator admits an efficient implementation which we detail and construct. As an experimental validation of our operator, we consider the task of compressing partial differential equation (PDE) simulation data from fixed meshes. Here, we show that QuadConv can match the performance of standard discrete convolutions on uniform grid data by comparing a QuadConv autoencoder (QCAE) to a standard convolutional autoencoder (CAE). Further, we show that the QCAE can maintain this accuracy even on non-uniform data. In both cases, QuadConv also outperforms alternative unstructured convolution methods such as graph convolution.

Compression↗
DOE OSTI2022

A Differentiable Hydrology Approach for Modeling With Time-Varying Parameters

In the analysis of observational data with mathematical models, it is often desirable to let one or more model parameters vary with time to account for changing environmental conditions or to offer more flexibility. A standard approach for dynamic models is to allow for the number of parameters to grow as a function of time, leading to a high-dimensional inference problem for long data records. We propose using Hamiltonian Monte Carlo, a gradient-based Markov chain Monte Carlo (MCMC) method, to perform Bayesian inference for time-varying parameters (TVP) in hydrology models. As derivatives of model error functions with regard to parameters are not available in closed form, we implemented the GR4J rainfall-runoff models in Theano/PyMC3, and Jax/NumPyro, allowing for the application of automatic differentiation techniques. A simulation experiment assessing the viability of these methods for recovering underlying temporal variation in parameters indicates that a discrete Gaussian random walk-based prior appears to be best suited across a range of scenarios while the continuous-time Gaussian process compares relatively poorly. In an analysis of 20 years of daily real-world streamflow records from the Model Parameter Estimation Experiment (MOPEX) hydrology data set with increasing data sparsity and at multiple temporal resolutions, we find that TVP inference with gradient-based MCMC is a flexible and reliable approach for analyzing hydrology models with dynamic parameter sets.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Efficient six-dimensional phase space reconstructions from experimental measurements using generative machine learning

Next-generation accelerator concepts, which hinge on the precise shaping of beam distributions, demand equally precise diagnostic methods capable of reconstructing beam distributions within six-dimensional position-momentum spaces. However, the characterization of intricate features within six-dimensional beam distributions using current diagnostic techniques necessitates a substantial number of measurements, using many hours of valuable beam time. Novel phase space reconstruction techniques are needed to reduce the number of measurements required to reconstruct detailed, high-dimensional beam features in order to resolve complex beam phenomena and as a feedback in precision beam shaping applications. In this study, we present a novel approach to reconstructing detailed six-dimensional phase space distributions from experimental measurements using generative machine learning and differentiable beam dynamics simulations. We demonstrate that this approach can be used to resolve six-dimensional phase space distributions from scratch, using basic beam manipulations and as few as 20 two-dimensional measurements of the beam profile. We also demonstrate an application of the reconstruction method in an experimental setting at the Argonne Wakefield Accelerator, where it is able to reconstruct the beam distribution and accurately predict previously unseen measurements 75× faster than previous methods.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Simulating Open Quantum Systems Using Hamiltonian Simulations

We present a novel method to simulate the Lindblad equation, drawing on the relationship between Lindblad dynamics, stochastic differential equations, and Hamiltonian simulations. We derive a sequence of unitary dynamics in an enlarged Hilbert space that can approximate the Lindblad dynamics up to an arbitrarily high order. This unitary representation can then be simulated using a quantum circuit that involves only Hamiltonian simulation and tracing out the ancilla qubits. There is no need for additional postselection in measurement outcomes, ensuring a success probability of one at each stage. Our method can be directly generalized to the time-dependent setting. We provide numerical examples that simulate both time-independent and time-dependent Lindbladian dynamics with accuracy up to the third order. Published by the American Physical Society 2024

Ding, Zhiyan (ORCID:000000018863403X)↗
DOE OSTI2023

Solving multiphysics-based inverse problems with learned surrogates and constraints

Abstract Solving multiphysics-based inverse problems for geological carbon storage monitoring can be challenging when multimodal time-lapse data are expensive to collect and costly to simulate numerically. We overcome these challenges by combining computationally cheap learned surrogates with learned constraints. Not only does this combination lead to vastly improved inversions for the important fluid-flow property, permeability, it also provides a natural platform for inverting multimodal data including well measurements and active-source time-lapse seismic data. By adding a learned constraint, we arrive at a computationally feasible inversion approach that remains accurate. This is accomplished by including a trained deep neural network, known as a normalizing flow, which forces the model iterates to remain in-distribution, thereby safeguarding the accuracy of trained Fourier neural operators that act as surrogates for the computationally expensive multiphase flow simulations involving partial differential equation solves. By means of carefully selected experiments, centered around the problem of geological carbon storage, we demonstrate the efficacy of the proposed constrained optimization method on two different data modalities, namely time-lapse well and time-lapse seismic data. While permeability inversions from both these two modalities have their pluses and minuses, their joint inversion benefits from either, yielding valuable superior permeability inversions and CO 2 plume predictions near, and far away, from the monitoring wells.

Yin, Ziyi (ORCID:0000000250248771)↗
DOE OSTI2020

Regression Based Approach for Robust Finite Element Analysis on Arbitrary Grids. LDRD Final Report

This report summarizes the work performed under a one-year LDRD project aiming to enable accurate and robust numerical simulation of partial differential equations for meshes that are of poor quality. Traditional finite element methods use the mesh to both discretize the geometric domain and to define the finite element shape functions. The latter creates a dependence between the quality of the mesh and the properties of the finite element basis that may adversely affect the accuracy of the discretized problem. In this project, we propose a new approach for defining finite element shape functions that breaks this dependence and separates mesh quality from the discretization quality. At the core of the approach is a meshless definition of the shape functions, which limits the purpose of the mesh to representing the geometric domain and integrating the basis functions without having any role in their approximation quality. The resulting non-conforming space can be utilized within a standard discontinuous Galerkin framework providing a rigorous foundation for solving partial differential equations on low-quality meshes. We present a collection of numerical experiments demonstrating our approach in a wide range of settings: strongly coercive elliptic problems, linear elasticity in the compressible regime, and the stationary Stokes problem. We demonstrate convergence for all problems and stability for element pairs for problems which usually require inf-sup compatibility for conforming methods, also referring to a minor modification possible through the symmetric interior penalty Galerkin framework for stabilizing element pairs that would otherwise be traditionally unstable. Mesh robustness is particularly critical for elasticity, and we provide an example that our approach provides a greater than 5x improvement in accuracy and allows for taking an 8x larger stable timestep for a highly deformed mesh, compared to the continuous Galerkin finite element method. The report concludes with a brief summary of ongoing projects and collaborations that utilize or extend the products of this work.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Progress on the National Solar Radiation Data Base (NSRDB): A New DNI Computation

This study introduces a new technique to compute direct normal irradiance (DNI) for improving the National Solar Radiation Data Base (NSRDB). A finite-surface integration algorithm is developed to compute solar radiation in differential solid angles and efficiently infer its contribution to a surface perpendicular to the solar direction. A lookup table of cloud bi-directional transmittance distribution function (BTDF) is developed by use of the discrete ordinates radiative transfer (DISORT) model for possible solar and observing directions and various cloud optical and microphysical properties. In each solar incident direction, DNI is given by the cloud BTDFs from approximately 200 differential solid angles. The simulated DNI is calibrated and evaluated using surface observations at the National Renewable Energy Laboratory's (NREL's) Solar Energy Research Laboratory (SRRL) and the Atmospheric Radiation Measurement (ARM) Southern Great Plains (SGP) facility.

41 EE - Solar Energy Technologies Office (EE-4S)↗