Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic differentiation”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Assessing three closed-loop learning algorithms by searching for high-quality quantum control pulses

Designing a high-quality control is crucial for reliable quantum computation. Among the existing approaches, closed-loop leaning control is an effective choice. Its efficiency depends on the learning algorithm employed, thus deserving algorithmic comparisons for its practical applications. Here we assess three representative learning algorithms, including GRadient Ascent Pulse Engineering (GRAPE), improved Nelder-Mead (NMplus), and Differential Evolution (DE), by searching for high-quality control pulses to prepare the Bell state. We first implement each algorithm experimentally in a nuclear magnetic resonance system and then conduct a numerical study considering the impact of some possible significant experimental uncertainties. The experiments report the successful preparation of the high-fidelity target state by the three algorithms, while NMplus converges fastest, and these results coincide with the numerical simulations when potential uncertainties are negligible. However, under certain significant uncertainties, these algorithms possess distinct performance with respect to their resulting precision and efficiency, and DE shows the best robustness. Finally, this study provides insight to aid in the practical application of different closed-loop learning algorithms in realistic physical scenarios.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Differentiable Predictions for Large Scale Structure with SHAMNet

In simulation-based models of the galaxy-halo connection, theoretical predictions for galaxy clustering and lensing are typically made based on Monte Carlo realizations of a mock universe. In this paper, we use Subhalo Abundance Matching (SHAM) as a toy model to introduce an alternative to stochastic predictions based on mock population, demonstrating how to make simulation-based predictions for clustering and lensing that are both exact and differentiable with respect to the parameters of the model. Conventional implementations of SHAM are based on iterative algorithms such as Richardson-Lucy deconvolution; here we use the JAX library for automatic differentiation to train SHAMNet, a neural network that accurately approximates the stellar-to-halo mass relation (SMHM) defined by abundance matching. In our approach to making differentiable predictions of large-scale structure, we map parameterized PDFs onto each simulated halo, and calculate gradients of summary statistics of the galaxy distribution by using autodiff to propagate the gradients of the SMHM through the statistical estimators used to measure one- and two-point functions. Our techniques are quite general, and we conclude with an overview of how they can be applied in tandem with more complex, higher-dimensional models, creating the capability to make differentiable predictions for the multi-wavelength universe of galaxies.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Measurement of photonuclear jet production in ultraperipheral Pb + Pb collisions at $\sqrt{s_{NN}}$ = 5.02 TeV with the ATLAS detector

In ultrarelativistic heavy ion collisions at the LHC, each nucleus acts a sources of high-energy real photons that can scatter off the opposing nucleus in ultraperipheral photonuclear (𝛾 + 𝐴) collisions. Hard scattering processes initiated by the photons in such collisions provide a novel method for probing nuclear parton distributions in a kinematic region not easily accessible to other measurements. ATLAS has measured production of dijet and multijet final states in ultraperipheral Pb + Pb collisions at $\sqrt{s_{NN}}$ = 5.02 TeV using a dataset recorded in 2018 with an integrated luminosity of 1.72 nb −1 . Photonuclear final states are selected by requiring a rapidity gap in the photon direction; this selects events where one of the outgoing nuclei remains intact. Jets are reconstructed using the anti-𝑘 t algorithm with radius parameter, 𝑅 = 0.4. Triple-differential cross sections, unfolded for detector response, are measured and presented using two sets of kinematic variables. The first set consists of the total transverse momentum (𝐻 T ), rapidity, and mass of the jet system. The second set uses 𝐻 T and particle-level nuclear and photon parton momentum fractions, 𝑥 A and 𝑧 𝛾 , respectively. The results are compared with leading-order perturbative QCD calculations of photonuclear jet production cross sections, where all leading order predictions using existing fits fall below the data in the shadowing region. More detailed theoretical comparisons will allow these results to strongly constrain nuclear parton distributions, and these data provide results from the LHC directly comparable to early physics results at the planned Electron-Ion Collider.

Parton distribution functions↗
DOE OSTI2025

Machine-Learning-Based Multiscale Methods for 3D Modelling of Granular Materials by Incorporating History-Dependent State Variables

Over the past decades, the prevalence of machine learning (ML) methods has made the development of ML-based constitutive models for granular materials undoubtedly a popular subject. Numerous studies have been made to feature the loading path or history-dependent stress-strain response of granular media using neural networks. In this work, a novel finite element method (FEM)–ML multiscale approach was developed by incorporating internal variables to improve the simulation accuracy of 3D history-dependent granular materials for the first time. To this end, a surrogate constitutive model based on the single-step-based multi-layer perceptron (MLP) neural network was used to replace representative volume element (RVE) simulations conducted by the discrete element method (DEM) in the multiscale FEM–DEM approach. Although the prediction principle of the MLP aligns with the FEM algorithm, artificially added internal variables are required to differentiate the loading history. To address this issue, history variables associated with the Frobenius norm are proposed to be fed into the MLP coupled with the strain tensor to extract the history-dependent behaviour of granular assemblies. The developed FEM–ML approach was demonstrated in 3D conventional triaxial compression (CTC) simulations. Compared to the multiscale FEM–DEM approach, the proposed FEM–ML method exhibits a significantly improved computational efficiency.

granular materials↗
DOE OSTI2021

Uncertainty Quantification of Geophysical Inversion Using Stochastic Partial Differential Equations (LDRD #218329)

This report summarizes work completed under the Laboratory Directed Research and Development (LDRD) project "Uncertainty Quantification of Geophysical Inversion Using Stochastic Differential Equations." Geophysical inversions often require computationally expensive algorithms to find even one solution, let alone propagating uncertainties through to the solution domain. The primary purpose of this project was to find more computationally efficient means to approximate solution uncertainty in geophysical inversions. We found multiple computationally efficient methods of propagating Earth model uncertainty into uncertainties in solutions of full waveform seismic moment tensor inversions. However, the optimum method of approximating the uncertainty in these seismic source solutions was to use the Karhunen-Love theorem with data misfit residuals. This method was orders of magnitude more computationally efficient than traditional Monte Carlo methods and yielded estimates of uncertainty that closely approximated those of Monte Carlo. We will summarize the various methods we evaluated for estimating uncertainty in seismic source inversions as well as work toward this goal in the realm of 3-D seismic tomographic inversion uncertainty.

58 GEOSCIENCES↗
DOE OSTI2022

Measurement of Piston Deposit Thickness Using Laser Profilometer

In this work, a novel method of measuring the thickness of deposits on engine pistons, including within ring grooves, is described. A laser profilometer is used in conjunction with a rotary stage to measure a continuous profile of the piston with deposits, and the measurement is repeated after cleaning the deposits from the piston. Algorithms for aligning the scans and determining the differential thickness are described, and results are compared to deposit thickness measurements using a contact-type magnetic induction coating thickness gauge. This method allows continuous measurement of deposit thickness across the entire surface including lands and ring grooves as well as quantification of the volume of the deposits.

42 ENGINEERING↗
DOE OSTI2020

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.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Randomized algorithms for generalized singular value decomposition with application to sensitivity analysis

The generalized singular value decomposition (GSVD) is a valuable tool that has many applications in computational science. However, computing the GSVD for large-scale problems is challenging. Motivated by applications in hyper-differential sensitivity analysis (HDSA), in this work we propose new randomized algorithms for computing the GSVD which use randomized subspace iteration and weighted QR factorization. Detailed error analysis is given which provides insight into the accuracy of the algorithms and the choice of the algorithmic parameters. We demonstrate the performance of our algorithms on test matrices and a large-scale model problem where HDSA is used to study subsurface flow.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

RSVP - Flu Like Illness and Respiratory Syndromes COVID-19 Syndromic Reporting Tool Prototype

Individuals infected with SARS-CoV-2, the virus that causes COVID-19, may be infectious between 1-3 days prior to symptom onset. People may delay seeking medical care after symptom development due to multiple determinants of health seeking behavior like availability of testing, accessibility of providers, and ability to pay. Therefore, understanding symptoms in the general public is important to better predict and inform resource management plans and engage in reopening. As the influenza season looms, the ability to differentiate between clinical presentation of COVID-19 and seasonal influenza will also be important to health providers and public health response efforts. This project has developed an algorithm that when used with captured syndromic trends can help provide both differentiation to various influenza-like illnesses (ILI) as well as provide public health decision makers a better understanding regarding spatial and temporal trends. This effort has also developed a web-based tool to allow for the capturing of generalized syndromic trends and provide both spatial and temporal outputs on these trends. This page left blank

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Explicit physics-informed neural networks for nonlinear closure: The case of transport in tissues

In upscaling methods, closures for nonlinear problems present a well-known challenge. While a number of theoretical methods have been proposed for handling such closures, nonlinearities still remain a significant obstacle for many problems. In this work, we use a combination of formal upscaling and data-driven machine learning for explicitly closing a nonlinear transport and reaction process in multiscale tissues. The classical effectiveness factor model is used to formulate the macroscale reaction kinetics. We train a multilayer perceptron network using training data generated by direct numerical simulations over microscale examples. Once trained, the network is used in an algorithm for numerically solving the upscaled (coarse-grained) differential equation describing mass transport and reaction in two example tissues. The network is described as being explicit in the sense that the network is trained using macroscale concentrations and gradients of concentration as components of the feature space rather than incorporating them as part of a constraint in the optimization process. Network training and solutions to the macroscale transport equations were computed for two different tissues. The two tissue types (brain and liver) exhibit markedly different geometrical complexity and spatial scale (cell size and sample size). The upscaled solutions for the average concentration are compared with numerical solutions derived from the microscale concentration fields by a posteriori averaging. There are three outcomes of this work of particular note. 1) Our overall approach results in an upscaled nonlinear PDE. The PDE is closed using a neural network, and our approach results in the definition of the classical effectiveness factor for effecting closure. 2) We identify particular source terms for the closure problem that are important for representing the structure of the closure. These source terms involve macroscale concentrations and their gradients. We adopt these source terms to use as explicit features in the learning algorithm. We find the trained networks that include the macroscale source terms generate models that are able to predict the correction factor with increased fidelity over those that do not. 3) We find that the trained network exhibits good generalizability, and it is able to predict the effectiveness factor with high fidelity for realistically-structured tissues despite the significantly different scale and geometrical complexity of the two example tissue types. This latter result emphasizes our purposeful connection between conventional averaging methods with the use of machine learning for closure; this contrasts with some machine learning methods for upscaling where the exact form of the macroscale equation remains unknown.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Fast Multigrid Reduction-in-Time for Advection via Modified Semi-Lagrangian Coarse-Grid Operators

Many iterative parallel-in-time algorithms have been shown to be highly efficient for diffusion-dominated partial differential equations (PDEs) but are inefficient or even divergent when applied to advection-dominated PDEs. We consider the application of the multigrid reduction-in-time (MGRIT) algorithm to linear advection PDEs. Here, the key to efficient time integration with this method is using a coarse-grid operator that provides a sufficiently accurate approximation to the so-called ideal coarse-grid operator. For certain classes of semi-Lagrangian discretizations, we present a novel semi-Lagrangian-based coarse-grid operator that leads to fast and scalable multilevel time integration of linear advection PDEs. The coarse-grid operator is composed of a semi-Lagrangian discretization followed by a correction term, with the correction designed so that the leading-order truncation error of the composite operator is approximately equal to that of the ideal coarse-grid operator. Parallel results show substantial speed-ups over sequential time integration for variable-wave-speed advection problems in one and two spatial dimensions, and using high-order discretizations up to order five. The proposed approach establishes the first practical method that provides small and scalable MGRIT iteration counts for advection problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Single-shot x-ray phase-contrast and dark-field imaging based on coded binary phase mask

We introduce a coded-mask-based multi-contrast imaging method for high-resolution phase-contrast and dark-field imaging. The method uses a binary phase mask designed to provide an ultra-high-contrast pattern and reference-free single-shot measurement and an algorithm based on maximum-likelihood optimization and automatic differentiation to perform simultaneous reconstruction of absorption, phase, and dark-field object images. Further, we demonstrate that the method has great potential for real-time quantitative phase imaging and wavefront sensing when combined with deep learning.

Qiao, Zhi (ORCID:0000000286285320)↗
DOE OSTI2023

Challenging the Curse of Dimensionality in Multidimensional Numerical Integration by Using a Low-Rank Tensor-Train Format

Numerical integration is a basic step in the implementation of more complex numerical algorithms suitable, for example, to solve ordinary and partial differential equations. The straightforward extension of a one-dimensional integration rule to a multidimensional grid by the tensor product of the spatial directions is deemed to be practically infeasible beyond a relatively small number of dimensions, e.g., three or four. In fact, the computational burden in terms of storage and floating point operations scales exponentially with the number of dimensions. This phenomenon is known as the curse of dimensionality and motivated the development of alternative methods such as the Monte Carlo method. The tensor product approach can be very effective for high-dimensional numerical integration if we can resort to an accurate low-rank tensor-train representation of the integrand function. In this work, we discuss this approach and present numerical evidence showing that it is very competitive with the Monte Carlo method in terms of accuracy and computational costs up to several hundredths of dimensions if the integrand function is regular enough and a sufficiently accurate low-rank approximation is available.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Fault Current Control and Protection in a Standalone DC Microgrid Using Adaptive Droop and Current Derivative

This report presents a novel fault detection, characterization, and fault current control algorithm for a standalone solar-photovoltaic (PV) based dc microgrids. The protection scheme is based on the current derivative algorithm. The overcurrent and current directional/differential comparison based protection schemes are incorporated for the dc microgrid fault characterization. For a low impedance fault, the fault current is controlled based on the current/voltage thresholds and current direction. Generally, the droop method is used to control the power-sharing between the converters by controlling the reference voltage. In this article, an adaptive droop scheme is also proposed to control the fault current by calculating a virtual resistance R droop , and to control the converter output reference voltage. For a high impedance fault, differential comparison method is used to characterize the fault. These algorithms effectively control the converter pulsewidth and reduce the flow of source current from a particular converter, which helps to increase the fault clearing time. Additionally, a trip signal is sent to the corresponding dc circuit breaker (DCCB), to isolate the faulted converter, feeder or a dc bus. The dc microgrid protection design procedure is detailed, and the performance of the proposed method is verified by simulation analysis.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Cosmology meets cohomology

The cosmological polytope and bootstrap programs have revealed interesting connections between positive geometries, modern on-shell methods and bootstrap principles studied in the amplitudes community with the wavefunction of the Universe in toy models of FRW cosmologies. To compute these FRW correlators, one often faces integrals that are too difficult to evaluate by direct integration. Borrowing from the Feynman integral community, the method of (canonical) differential equations provides an efficient alternative for evaluating these integrals. Moreover, we further develop our geometric understanding of these integrals by describing the associated relative twisted cohomology. Leveraging recent progress in our understanding of relative twisted cohomology in the Feynman integral community, we give an algorithm to predict the basis size and simplify the computation of the differential equations satisfied by FRW correlators.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Genetic algorithm optimization of nuclear criticality experiment for reduction of intermediate-energy 239 Pu nuclear data uncertainties

Nuclear criticality experiments are conducted to investigate specific nuclear data important for safe handling and storage of fissile materials, reactor design and operation, and the validation of radiation transport codes. Incorrect or uncertain nuclear data can prohibitively impact operational safety limits, reactor licensing, and predictive simulation capability; therefore, integral measurements from criticality experiments are necessary and should be performed frequently. To maximize the impact of the integral measurements, it is important to consider experiment geometry, material selection, and component dimensions. When taking these considerations into account, the experiment design process becomes iterative and very time intensive. This work utilizes a genetic algorithm to efficiently explore potential nuclear criticality experiment designs for the Laboratory Directed Research & Development project PARADIGM (PARallel Approach of Differential and InteGral Measurements) at Los Alamos National Laboratory. In this paper, the building blocks of the genetic algorithm are discussed in detail, the genetic algorithm methodology is verified, and the genetic algorithm is used to produce three candidate experiment models for the final PARADIGM design. The three candidate models produced by the genetic algorithm consist of copper-reflected assemblies containing 14 repeating units of alumina, graphite, boron, and plutonium plates. Furthermore, in addition to the optimization results, final design considerations are also discussed for designs with a height and/or weight very close to or slightly above assembly machine operational limits.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗