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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

A differentiable perturbation-based weak lensing shear estimator

Upcoming imaging surveys will use weak gravitational lensing to study the large-scale structure of the Universe, demanding sub-per cent accuracy for precise cosmic shear measurements. We present a new differentiable implementation of our perturbation-based shear estimator (fpfs), using jax, which is publicly available as part of a new suite of analytic shear algorithms called anacal. This code can analytically calibrate the shear response of any non-linear observable constructed with the fpfs shapelets and detection modes utilizing autodifferentiation (ad), generalizing the formalism to include a family of shear estimators with corrections for detection and selection biases. Using the ad capability of jax, it calculates the full Hessian matrix of the non-linear observables, which improves the previously presented second-order noise bias correction in the shear estimation. As an illustration of the power of the new anacal framework, we optimize the effective galaxy number density in the space of the generalized shear estimators using an LSST-like galaxy image simulation for the 10 yr LSST. For the generic shear estimator, the magnitude of the multiplicative bias |m| is below 3 × 10 –3 (99.7 per cent confidence interval), and the effective galaxy number density is improved by 5 per cent. We also discuss some planned future additions to the anacal software suite to extend its applicability beyond the fpfs measurements.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

The PENELOPE Physics Models and Transport Mechanics. Implementation into Geant4

A translation of the PENELOPE physics subroutines to C++, designed as an extension of the GEANT4 toolkit, is presented. The Fortran code system PENELOPE performs Monte Carlo simulation of coupled electron-photon transport in arbitrary materials for a wide energy range, nominally from 50 eV up to 1 GeV. PENELOPE implements the most reliable interaction models that are currently available, limited only by the required generality of the code. In addition, the transport of electrons and positrons is simulated by means of an elaborate class II scheme in which hard interactions (involving deflection angles or energy transfers larger than pre-defined cutoffs) are simulated from the associated restricted differential cross sections. After a brief description of the interaction models adopted for photons and electrons/positrons, we describe the details of the class-II algorithm used for tracking electrons and positrons. The C++ classes are adapted to the specific code structure of GEANT4. They provide a complete description of the interactions and transport mechanics of electrons/positrons and photons in arbitrary materials, which can be activated from the G4ProcessManager to produce simulation results equivalent to those from the original PENELOPE programs. The combined code, named PENG4, benefits from the multi-threading capabilities and advanced geometry and statistical tools of GEANT4.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

SUNDIALS time integrators for exascale applications with many independent systems of ordinary differential equations

Many complex systems can be accurately modeled as a set of coupled time-dependent partial differential equations (PDEs). However, solving such equations can be prohibitively expensive, easily taxing the world’s largest supercomputers. One pragmatic strategy for attacking such problems is to split the PDEs into components that can more easily be solved in isolation. This operator splitting approach is used ubiquitously across scientific domains, and in many cases leads to a set of ordinary differential equations (ODEs) that need to be solved as part of a larger “outer-loop” time-stepping approach. The SUNDIALS library provides a plethora of robust time integration algorithms for solving ODEs, and the U.S. Department of Energy Exascale Computing Project (ECP) has supported its extension to applications on exascale-capable computing hardware. In this paper, we highlight some SUNDIALS capabilities and its deployment in combustion and cosmology application codes (Pele and Nyx, respectively) where operator splitting gives rise to numerous, small ODE systems that must be solved concurrently.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Sequential Decision Making (SDM) for Mesh Refinement and Model Selection in Multiscale, Multi-Physics Applications

Intelligent automation and decision support are needed to enhance computational efficiency and robustness in multiscale and multi-physics problems, including materials science, manufacturing, and climate and weather modeling. Current scientific computing approaches for enabling decisions by scientists fail to explore the role of learning, reasoning, and probabilistic planning. Often these decisions are not performed in real-time during the computation but are made prior to the start of the computation, which must be interrupted in order to make changes to the prior choices. Such interruptions at different stages of the computation increase the total computing time and the need for a human expert to frequently monitor the results. State of art scientific computing methods consist of rule-based algorithms that cannot automatically adapt to a dynamically changing computing environment. The development of a Sequential Decision Making (SDM) framework will automate scientific computing by optimizing the policies for mesh refinement, time-stepping, model and algorithm selection, resource allocation, and pre and post-processing. Our agent SDM framework for scientific computing will consist of data-driven learning (Classifier), automated reasoning (contextual knowledge), and probabilistic planning (Reinforcement Learning). In this project, we focused on three problems to demonstrate our SDM framework on a set of ordinary and partial differential equations. Classification of Lorenz system regions using Feed-Forward Neural Networks examined learning in the SDM framework. On the other hand, reasoning and planning in the SDM framework were used in two problems: adaptive time-stepping for nonlinear ODEs using on-policy RL algorithms, and adaptive mesh refinement for 2-D PDEs using off-policy RL algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Machine Learning of Bacterial Transcriptomes Reveals Responses Underlying Differential Antibiotic Susceptibility

In vitro antibiotic susceptibility testing often fails to accurately predict in vivo drug efficacies, in part due to differences in the molecular composition between standardized bacteriologic media and physiological environments within the body. Here, we investigate the interrelationship between antibiotic susceptibility and medium composition in Escherichia coli K-12 MG1655 as contextualized through machine learning of transcriptomics data. Application of independent component analysis, a signal separation algorithm, shows that complex phenotypic changes induced by environmental conditions or antibiotic treatment are directly traced to the action of a few key transcriptional regulators, including RpoS, Fur, and Fnr. Integrating machine learning results with biochemical knowledge of transcription factor activation reveals medium-dependent shifts in respiration and iron availability that drive differential antibiotic susceptibility. By extension, the data generation and data analytics workflow used here can interrogate the regulatory state of a pathogen under any measured condition and can be applied to any strain or organism for which sufficient transcriptomics data are available.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Accelerated Sparse Recovery via Gradient Descent with Nonlinear Conjugate Gradient Momentum

This paper applies an idea of adaptive momentum for the nonlinear conjugate gradient to accelerate optimization problems in sparse recovery. Specifically, we consider two types of minimization problems: a (single) differentiable function and the sum of a non-smooth function and a differentiable function. In the first case, we adopt a fixed step size to avoid the traditional line search and establish the convergence analysis of the proposed algorithm for a quadratic problem. This acceleration is further incorporated with an operator splitting technique to deal with the non-smooth function in the second case. As a result, we use the convex ι 1 and the nonconvex ι 1 – ι 2 functionals as two case studies to demonstrate the efficiency of the proposed approaches over traditional methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

The DESC stellarator code suite. Part 2. Perturbation and continuation methods

A new perturbation and continuation method is presented for computing and analysing stellarator equilibria. The method is formally derived from a series expansion about the equilibrium condition $\boldsymbol {F} \equiv \boldsymbol {J}\times \boldsymbol {B} - \boldsymbol {\nabla } p = 0$ , and an efficient algorithm for computing solutions to second- and third-order perturbations is developed. The method has been implemented in the DESC stellarator equilibrium code, using automatic differentiation to compute the required derivatives. Examples are shown demonstrating its use for computing complicated equilibria, perturbing a tokamak into a stellarator and performing parameter scans in pressure, rotational transform and boundary shape in a fraction of the time required for a full solution.

Conlin, Rory (ORCID:0000000183662111)↗
DOE OSTI2023

Measurement of substructure-dependent jet suppression in Pb + Pb collisions at 5.02 TeV with the ATLAS detector

The ATLAS detector at the Large Hadron Collider has been used to measure jet substructure modification and suppression in Pb + Pb collisions at a nucleon–nucleon center-of-mass energy $\sqrt{{^S}_{NN}}$ = 5.02 TeV in comparison with proton–proton (pp) collisions at $\sqrt{{^S}}$ = 5.02 TeV. The Pb + Pb data, collected in 2018, have an integrated luminosity of 1.72 nb -1 , while the pp data, collected in 2017, have an integrated luminosity of 260 pb -1 . Jets used in this analysis are clustered using the anti- k t algorithm with a radius parameter R = 0.4. The jet constituents, defined by both tracking and calorimeter information, are used to determine the angular scale r g of the first hard splitting inside the jet by reclustering them using the Cambridge–Aachen algorithm and employing the soft-drop grooming technique. The nuclear modification factor, R AA , used to characterize jet suppression in Pb + Pb collisions, is presented differentially in r g , jet transverse momentum, and in intervals of collision centrality. The R AA value is observed to depend significantly on jet r g . Jets produced with the largest measured r g are found to be twice as suppressed as those with the smallest r g in central Pb + Pb collisions. The R AA values do not exhibit a strong variation with jet p T in any of the r g intervals. The r g and p T dependence of jet R AA is qualitatively consistent with a picture of jet quenching arising from coherence and provides the most direct evidence in support of this approach.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Dimuon production in the MicroBooNE detector

This analysis studies the production of the rare signal with two muons (dimuon) in the finalstate at µB using the Booster Neutrino Beam (BNB) as source of neutrino interactions. Themain background source for the dimuon signal are pions. Differentiating muons and pions hasbeen challenging at µB because the tracks left by these particles are almost identical. Thisanalysis faces this problem using a supervised classifier algorithm called boosted decisiontree (BDT). A Monte Carlo simulation (MC) enhanced dimuon signal sample was producedto train a BDT capable of recognizing this signal. A set of variables that show somediscrimination characteristics was used to perform the training. A MC neutrino interactionsimulation sample was used to estimate the background. Estimations of dimuon productionin real data samples were made for different cases. Additionally, an analysis of the systematicuncertainties, fake data studies, and BDT performance checks were obtained.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Computational tools and algorithms for ion mobility spectrometry-mass spectrometry

Ion mobility spectrometry-mass spectrometry (IMS-MS or IM-MS) is a powerful analytical technique that combines the gas-phase separation capabilities of IM with the identification and quantification capabilities of MS. IM-MS can differentiate molecules with indistinguishable masses but different structures (e.g., isomers, isobars, molecular classes, and contaminant ions). The importance of this analytical technique is reflected by a staged increase in the number of applications for molecular characterization across a variety of fields, from different MS-based omics (proteomics, metabolomics, lipidomics, etc.) to the structural characterization of glycans, organic matter, proteins, and macromolecular complexes. With the increasing application of IM-MS there is a pressing need for effective and accessible computational tools. This article presents an overview of the most recent free and open-source software tools specifically tailored for the analysis and interpretation of data derived from IM-MS instrumentation. This review enumerates these tools and outlines their main algorithmic approaches, while highlighting representative applications across different fields. Finally, a discussion of current limitations and expectable improvements is presented.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Differentially Private Adaptive Noise Injection (DP-ANI) v1.0

Location data is collected from users continuously to understand their mobility patterns. Releasing the user trajectories may compromise user privacy. Therefore, the general practice is to release aggregated location datasets. However, private information may still be inferred from an aggregated version of location trajectories. Differential privacy (DP) protects the query output against inference attacks regardless of background knowledge. This software implements a differential privacy-based privacy model that protects the user's origins and destinations from being inferred from aggregated mobility datasets. This is achieved by injecting Planar Laplace noise to the user origin and destination GPS points. The noisy GPS points are then transformed into a link representation using a link-matching algorithm. Finally, the link trajectories form an aggregated mobility network. The injected noise level is selected using the Sparse Vector Mechanism. This DP selection mechanism considers the link density of the location and the functional category of the localized links. Compared to the different baseline models, including a k-anonymity method, our differential privacy-based aggregation model offers query responses that are close to the raw data in terms of aggregate statistics at both the network and trajectory-levels with maximum 9% deviation from the baseline in terms of network length.

Peisert, Sean [Lawrence Berkeley National Laborato↗
DOE OSTI2022

Measurement and QCD analysis of double-differential inclusive jet cross sections in proton-proton collisions at $\sqrt{s}$ = 13 TeV

A measurement of the inclusive jet production in proton-proton collisions at the LHC at $ \sqrt{s} $ = 13 TeV is presented. The double-differential cross sections are measured as a function of the jet transverse momentum p$_{T}$ and the absolute jet rapidity |y|. The anti-k$_{T}$ clustering algorithm is used with distance parameter of 0.4 (0.7) in a phase space region with jet p$_{T}$ from 97 GeV up to 3.1 TeV and |y| < 2.0. Data collected with the CMS detector are used, corresponding to an integrated luminosity of 36.3 fb$^{-1}$ (33.5 fb$^{-1}$). The measurement is used in a comprehensive QCD analysis at next-to-next-to-leading order, which results in significant improvement in the accuracy of the parton distributions in the proton. Simultaneously, the value of the strong coupling constant at the Z boson mass is extracted as α$_{S}$(m$_{Z}$) = 0.1170±0.0019. For the first time, these data are used in a standard model effective field theory analysis at next-to-leading order, where parton distributions and the QCD parameters are extracted simultaneously with imposed constraints on the Wilson coefficient c$_{1}$ of 4-quark contact interactions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2019

The Bloch equation for spin dynamics in electron storage rings: Computational and theoretical aspects

In this paper, we describe our work on spin polarization in high-energy electron storage rings which we base on the Full Bloch equation (FBE) for the polarization density and which aims towards the [Formula: see text] option of the proposed Future Circular Collider (FCC-ee) and the proposed Circular Electron Positron Collider (CEPC). The FBE takes into account non spin-flip and spin-flip effects due to synchrotron radiation including the spin-diffusion effects and the Sokolov–Ternov effect with its Baier–Katkov generalization as well as the kinetic-polarization effect. This mathematical model is an alternative to the standard mathematical model based on the Derbenev–Kondratenko formulas. For our numerical and analytical studies of the FBE, we develop an approximation to the latter to obtain an effective FBE. This is accomplished by finding a third mathematical model based on a system of stochastic differential equations (SDEs) underlying the FBE and by approximating that system via the method of averaging from perturbative ODE theory. We also give an overview of our algorithm for numerically integrating the effective FBE. This discretizes the phase space using spectral methods and discretizes time via the additive Runge–Kutta (ARK) method which is a high-order semi-implicit method. We also discuss the relevance of the third mathematical model for spin tracking.

Physics↗
DOE OSTI2024

CMPLE: Correlation Modeling to Decode Photosynthesis Using the Minorize–Maximize Algorithm

In plant genomic experiments, correlations among various biological traits (phenotypes) give new insights into how genetic diversity may have tuned biological processes to enhance fitness under diverse conditions. Consequently, knowing how the correlations are affected by genetic (G) and environmental (E) factors helps develop climate-resilient plants. However, the current literature lacks any method for assessing the effect of predictors on pairwise correlations among multiple phenotypes together with easily interpretable model parameters. To address this need, we propose to model pairwise correlations directly in terms of G and E and develop a computationally efficient inference procedure. Two major novelties in our methodology are (1) the use of a composite pairwise likelihood method to avoid the positive definiteness restriction on the correlation matrix and (2) the use of a novel Minorize–Maximize (MM) algorithm for the efficient estimation of a large number of parameters. The proposed method shows excellent numerical performance on synthetic datasets. Here, the analysis of the motivating data on cowpea reveals that the rates of solar energy storage by photosynthesis (the aggregate trait) are differentially affected by different genetic loci through two distinct processes: “photoinhibition” which results from photodamage caused by excess light, and “photoprotection” which protects plants from photodamage but also results in energy loss.

Correlation modeling↗
DOE OSTI2020

Pass-efficient methods for compression of high-dimensional turbulent flow data

The future of high-performance computing, specifically on future Exascale computers, will presumably see memory capacity and bandwidth fail to keep pace with data generated, for instance, from massively parallel partial differential equation (PDE) systems. Current strategies proposed to address this bottleneck entail the omission of large fractions of data, as well as the incorporation of in situ compression algorithms to avoid overuse of memory. To ensure that post-processing operations are successful, this must be done in a way that a sufficiently accurate representation of the solution is stored. Moreover, in situations where the input/output system becomes a bottleneck in analysis, visualization, etc., or the execution of the PDE solver is expensive, the number of passes made over the data must be minimized. In the interest of addressing this problem, this work focuses on the utility of pass-efficient, parallelizable, low-rank, matrix decomposition methods in compressing high-dimensional simulation data from turbulent flows. Additionally, a particular emphasis is placed on using coarse representation of the data – compatible with the PDE discretization grid – to accelerate the construction of the low-rank factorization. This includes the presentation of a novel single-pass matrix decomposition algorithm for computing the so-called interpolative decomposition. The methods are described extensively and numerical experiments on two turbulent channel flow data are performed. In the first (unladen) channel flow case, compression factors exceeding 400 are achieved while maintaining accuracy with respect to first- and second-order flow statistics. In the particle-laden case, compression factors of 100 are achieved and the compressed data is used to recover particle velocities. These results show that these compression methods can enable efficient computation of various quantities of interest in both the carrier and disperse phases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Greedy emulators for nuclear two-body scattering

Applications of reduced basis method emulators are increasing in low-energy nuclear physics because they enable fast and accurate sampling of high-fidelity calculations, enabling robust uncertainty quantification. Here, in this paper, we develop, implement, and test two model-driven emulators based on the (Petrov-)Galerkin projection using the prototypical test case of two-body scattering with the Minnesota potential and a more realistic local chiral potential. The high-fidelity scattering equations are solved with the matrix Numerov method, a reformulation of the popular Numerov recurrence relation for solving special second-order differential equations as a linear system of coupled equations. A novel error estimator based on reduced-space residuals is applied to an active learning approach (a greedy algorithm) to choosing training samples (“snapshots”) for the emulator and contrasted with a proper orthogonal decomposition (POD) approach. Both approaches allow for computationally efficient offline-online decompositions, but the greedy approach requires many fewer snapshot calculations. These developments set the groundwork for emulating scattering observables based on chiral nucleon-nucleon and three-nucleon interactions and optical models, where computational speed-ups are necessary for Bayesian uncertainty quantification. Our emulators and error estimators are widely applicable to linear systems.

Bayesian methods↗
DOE OSTI2021

A stochastic solver based on the residence time algorithm for crystal plasticity models

Abstract The deformation of crystalline materials by dislocation motion takes place in discrete amounts determined by the Burgers vector. Dislocations may move individually or in bundles, potentially giving rise to intermittent slip. This confers plastic deformation with a certain degree of variability that can be interpreted as being caused by stochastic fluctuations in dislocation behavior. However, crystal plasticity (CP) models are almost always formulated in a continuum sense, assuming that fluctuations average out over large material volumes and/or cancel out due to multi-slip contributions. Nevertheless, plastic fluctuations are known to be important in confined volumes at or below the micron scale, at high temperatures, and under low strain rate/stress deformation conditions. Here, we develop a stochastic solver for CP models based on the residence-time algorithm that naturally captures plastic fluctuations by sampling among the set of active slip systems in the crystal. The method solves the evolution equations of explicit CP formulations, which are recast as stochastic ordinary differential equations and integrated discretely in time. The stochastic CP model is numerically stable by design and naturally breaks the symmetry of plastic slip by sampling among the active plastic shear rates with the correct probability. This can lead to phenomena such as intermittent slip or plastic localization without adding external symmetry-breaking operations to the model. The method is applied to body-centered cubic tungsten single crystals under a variety of temperatures, loading orientations, and imposed strain rates.

42 ENGINEERING↗
DOE OSTI2020

Scalability of high-performance PDE solvers

Performance tests and analyses are critical to effective high-performance computing software development and are central components in the design and implementation of computational algorithms for achieving faster simulations on existing and future computing architectures for large-scale application problems. In this article, we explore performance and space-time trade-offs for important compute-intensive kernels of large-scale numerical solvers for partial differential equations (PDEs) that govern a wide range of physical applications. We consider a sequence of PDE-motivated bake-off problems designed to establish best practices for efficient high-order simulations across a variety of codes and platforms. We measure peak performance (degrees of freedom per second) on a fixed number of nodes and identify effective code optimization strategies for each architecture. In addition to peak performance, we identify the minimum time to solution at 80% parallel efficiency. The performance analysis is based on spectral and p-type finite elements but is equally applicable to a broad spectrum of numerical PDE discretizations, including finite difference, finite volume, and h-type finite elements.

97 MATHEMATICS AND COMPUTING↗