Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Stochastic modelling”

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 631 records · Page 35

Anisotropic physics-regularized interpretable machine learning of microstructure evolution

Anisotropic Physics-Regularized Interpretable Machine Learning Microstructure Evolution (APRIMME) is a general-purpose machine learning solution for grain growth simulations. In prior work, PRIMME employed a deep neural network to predict site-specific migration as a function of its neighboring sites to model normal, isotropic, grain growth behavior. This work aims to extend this method by incorporating grain boundary misorientation-based grain growth behavior. APRIMME is trained on anisotropic simulations created using the Monte Carlo-Potts (MCP) model. Furthermore, the results of this work are compared statistically using grain radius, number of sides per grain, mean neighborhood misorientations, and the standard deviation of triple junction dihedral angles, and are found to match in most cases. The exceptions are small and seem to be related to two causes: (1) the deterministic model of APRIMME is learning from the stochastic simulations of MCP, which seems to accentuate triple junction behaviors; and, (2) a bias against very small grains is made evident in a quicker decrease in grains than expected at the beginning of an APRIMME simulation. APRIMME is also evaluated for its general ability to capture anisotropic grain growth behavior by first investigating different test case initial conditions, including a circle grain, three grain, and hexagonal grain microstructures.

36 MATERIALS SCIENCE↗

Optimization using pathwise algorithmic derivatives of electromagnetic shower simulations

Among the well-known methods to approximate derivatives of expectancies computed by Monte-Carlo simulations, averages of pathwise derivatives are often the easiest one to apply. Computing them via algorithmic differentiation typically does not require major manual analysis and rewriting of the code, even for very complex programs like simulations of particle-detector interactions in high-energy physics. However, the pathwise derivative estimator can be biased if there are discontinuities in the program, which may diminish its value for applications. This work integrates algorithmic differentiation into the electromagnetic shower simulation code HepEmShow based on G4HepEm, allowing us to study how well pathwise derivatives approximate derivatives of energy depositions in a sampling calorimeter with respect to parameters of the beam and geometry. We found that when multiple scattering is disabled in the simulation, means of pathwise derivatives converge quickly to their expected values, and these are close to the actual derivatives of the energy deposition. Additionally, we demonstrate the applicability of this novel gradient estimator for stochastic gradient-based optimization in a model example.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Finite Bubble Statistics Constrain Late Cosmological Phase Transitions

We consider first order cosmological phase transitions (PTs) happening at late times below standard model temperatures T PT ≲ GeV. The inherently stochastic nature of bubble nucleation and the finite number of bubbles associated with a late-time PT lead to superhorizon fluctuations in the PT completion time. We compute how such fluctuations eventually source curvature fluctuations with universal properties, independent of the microphysics of the PT dynamics. Using cosmic microwave background (CMB) and large scale structure measurements, we constrain the energy released in a dark-sector PT. For 0.1 eV ≲ T PT ≲ keV this constraint is stronger than both the current bound from additional neutrino species Δ⁢N eff , and in some cases, even CMB-S4 projections. Future measurements of CMB spectral distortions and pulsar timing arrays will also provide competitive sensitivity for keV ≲ T PT ≲ GeV.

79 ASTRONOMY AND ASTROPHYSICS↗

Advanced Computing is at the Forefront of a New “Moonshot” Revolutionizing the North American Power Grid

In the 50+ years since the first humans landed on the moon, computing has grown at breakneck speed. We are faced with another challenge that is just as daunting, and just as important to overcome-modernizing the North American electric power grid-and high-performance computing (HPC) systems with specialized software will be an important element in rising to this challenge. We describe at a high level how software developed in the ExaSGD project addresses this "moonshot" goal by utilizing exascale computing and a novel high performance solver software stack to support the mission of decarbonizing power grid operations in an environment of uncertain weather and climate. To reach the exascale benchmark the team has made a number of first-of-their-kind innovations, including novel method for stochastic optimization, fine grained parallel methods for modeling power systems, and GPU resident sparse numerical linear solvers.

17 WIND ENERGY↗

Post-Disaster Microgrid Formation for Enhanced Distribution System Resilience

This paper proposes a deep reinforcement learning (DRL) based approach for post-disaster critical load restoration in active distribution systems to form microgrids through network reconfiguration to minimize critical load curtailments. Distribution networks are represented as graph networks, and optimal network configurations with microgrids are obtained by searching for the optimal spanning forest. The constraints to the research question being explored are the radial topology and power balance. Unlike existing analytical and population-based approaches, which necessitate the repetition of entire analyses and computation for each outage scenario to find the optimal spanning forest, the proposed approach, once properly trained, can quickly determine the optimal, or near-optimal, spanning forest even when outage scenarios change. When multiple lines fail in the system, the proposed approach forms microgrids with distributed energy resources in active distribution systems to reduce critical load curtailment. The proposed DRL-based model learns the action-value function using the REINFORCE algorithm, which is a model-free reinforcement learning technique based on stochastic policy gradients. A case study was conducted on a 33-node distribution test system, demonstrating the effectiveness of the proposed approach for post-disaster critical load restoration.

active distribution systems↗

Functional Traits Resolve Mechanisms Governing the Assembly and Distribution of Nitrogen-Cycling Microbial Communities in the Global Ocean

Microorganisms drive much of the marine nitrogen (N) cycle, which jointly controls the primary production in the global ocean. However, our understanding of the microbial communities driving the global ocean N cycle remains fragmented. Focusing on “who is doing what, where, and how?”, this study draws a clear picture describing the global biogeography of marine N-cycling microbial communities by utilizing the Tara Oceans shotgun metagenomes. The marine N-cycling communities are highly variable taxonomically but relatively even at the functional trait level, showing clear functional redundancy properties. The functional traits and taxonomic groups are shaped by the same set of geo-environmental factors, among which, depth is the major factor impacting marine N-cycling communities, differentiating mesopelagic from epipelagic communities. Latitudinal diversity gradients and distance-decay relationships are observed for taxonomic groups, but rarely or weakly for functional traits. The composition of functional traits is strongly deterministic as revealed by null model analysis, while a higher degree of stochasticity is observed for taxonomic composition. Integrating multiple lines of evidence, in addition to drawing a biogeographic picture of marine N-cycling communities, this study also demonstrated an essential microbial ecological theory—determinism governs the assembly of microbial communities performing essential biogeochemical processes; the environment selects functional traits rather than taxonomic groups; functional redundancy underlies stochastic taxonomic community assembly.

59 BASIC BIOLOGICAL SCIENCES↗

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗

ExaSGD: 2022 Kernel Thrust Activities

The Kernel Thrust milestone ADSE22-407 covers the development of device-capable optimization algorithms and solvers technologies required by the ExaSGD project’s software stack in order to solve security-constrained alternating current optimal power flow (SC-ACOPF) problems on emerging exascale architectures. To this extent, in FY22 the main objective of the Kernel Thrust was (i) provide sparse optimization solver that runs efficiently on hardware accelerator devices (i.e., NVIDIA and AMD GPUs) to perform intra-node computations, (ii) strengthen the reliability and increase the performance of the mixed-dense sparse (MDS) solver of HiOp for deployment on the FY22 target architectures, Summit and Crusher, and (iii) increase performance by improving the mathematical algorithm and refining the parallel MPI-based implementation of the coarse-grain parallel solver HiOp-PriDec for capabilities deployment on the FY22 target architectures, Summit and Crusher. This document presents the developments and contributions done by the Kernels Thrust Team in FY22 toward completion of the above-mentioned objectives. These contributions progressed along four main development (sub)thrusts: (1) Design and implementation of a sparse optimization solver for use on hardware accelerators; (2) Improvement of the mathematical algorithm and of the parallel implementation of HiOp-PriDec to ensure readiness and efficient coarse-grain parallelism for FY23 target exascale machine; and (3) Support Software and Application Development Thrusts of the exaSGD project in their deployment of the project’s software stack on AMD- and NVIDIA-based architectures. The development of the sparse optimization solver (thrust 1 above) was new in FY22 and resulted in a new sparse solver in HiOp (available as of version 0.6). The second development thrust was a continuation of the efforts from FY21 and improved the mathematical algorithm and the communication strategy of the HiOp-PriDec solver. The last developement thrust is a large collaborative effort. Namely, the project’s teams from multiple labs (LLNL, PNNL, ORNL, and NREL) performed large-scale demonstration of the ExaSGD software stack, namely the optimization solvers of HiOp interfaced with the modeling front-end ExaGO and the stochastic sampler PowerScenarios. These demonstration efforts solved large-scale instances of the SC-ACOPF challenge problem of medium network sizes (10, 000-bus system) and large number of contingencies on Summit (NVIDIA accelerators) and Crusher (AMD accelerators) systems at ORNL.

97 MATHEMATICS AND COMPUTING↗

The Forward Master Equation for the Joint Neutron-Photon Number Probability Distribution

The model is similar to the Binary Fission Model (BFM) in chapter three of the Stochastic Neutronics Primer Volume I, however, we add photons as a product of induced fission events (IFEs). We will find that tracking the population of an additional particle adds an additional layer of complexity because we are now looking for a joint probability distribution.

42 ENGINEERING↗

Randomized Federated Learning Methods for Nonsmooth, Nonconvex, and Hierarchical Optimization (Final Technical Report)

This final technical report summarizes the outcomes of a DOE-funded project on federated scientific machine learning (FL) under nonsmooth, nonconvex, and hierarchical optimization settings. The project develops new mathematical models, algorithms, and theoretical guarantees for decentralized stochastic, bilevel, and minimax optimization problems arising in DOE mission-relevant applications. A unified framework of randomized and zeroth-order federated optimization methods is introduced, providing provable convergence, communication efficiency, and sample-complexity guarantees. The report documents algorithmic design, theoretical analysis, and empirical validation of the proposed federated learning methods. The project also contributes to workforce development through graduate training and dissemination of results via publications and seminars.

97 MATHEMATICS AND COMPUTING↗

Mercury’s Chaotic Secular Evolution as a Subdiffusive Process

Abstract Mercury’s orbit can destabilize, generally resulting in a collision with either Venus or the Sun. Chaotic evolution can causeg 1 to decrease to the approximately constant value ofg 5 and create a resonance. Previous work has approximated the variation ing 1 as stochastic diffusion, which leads to a phenomological model that can reproduce the Mercury instability statistics of secular andN-body models on timescales longer than 10 Gyr. Here we show that the diffusive model significantly underpredicts the Mercury instability probability on timescales less than 5 Gyr, the remaining lifespan of the solar system. This is becauseg 1 exhibits larger variations on short timescales than the diffusive model would suggest. To better model the variations on short timescales, we build a new subdiffusive phenomological model forg 1 . Subdiffusion is similar to diffusion but exhibits larger displacements on short timescales and smaller displacements on long timescales. We choose model parameters based on the behavior of theg 1 trajectories in theN-body simulations, leading to a tuned model that can reproduce Mercury instability statistics from 1–40 Gyr. This work motivates fundamental questions in solar system dynamics: why does subdiffusion better approximate the variation ing 1 than standard diffusion? Why is there an upper bound ong 1 , but not a lower bound that would prevent it from reachingg 5 ?

Astronomy & Astrophysics↗

A Stochastic Approach to Reconstruct Gamma-Ray-burst Light Curves

Gamma-ray bursts (GRBs), as they are observed at high redshift ( z = 9.4), are vital to cosmological studies and investigating Population III stars. To tackle these studies, we need correlations among relevant GRB variables with the requirement of small uncertainties on their variables. Thus, we must have good coverage of GRB light curves (LCs). However, gaps in the LC hinder the precise determination of GRB properties and are often unavoidable. Therefore, extensive categorization of GRB LCs remains a hurdle. We address LC gaps using a stochastic reconstruction, wherein we fit two preexisting models (the Willingale model; W07; and a broken power law; BPL) to the observed LC, then use the distribution of flux residuals from the original data to generate data to fill in the temporal gaps. We also demonstrate a model-independent LC reconstruction via Gaussian processes. At 10% noise, the uncertainty of the end time of the plateau, its correspondent flux, and the temporal decay index after the plateau decreases by 33.3%, 35.03%, and 43.32% on average for the W07, and by 33.3%, 30.78%, 43.9% for the BPL, respectively. The uncertainty of the slope of the plateau decreases by 14.76% in the BPL. After using the Gaussian process technique, we see similar trends of a decrease in uncertainty for all model parameters for both the W07 and BPL models. These improvements are essential for the application of GRBs as standard candles in cosmology, for the investigation of theoretical models, and for inferring the redshift of GRBs with future machine-learning analyses.

79 ASTRONOMY AND ASTROPHYSICS↗

Particle transport in Markov stochastic mixtures with spatial gradients

Markov geometries are a prototype class of stochastic media that are widely used to model complex disordered systems. In a series of recent works, we have shown that spatially homogeneous (but possibly non-isotropic) Poisson tessellations can be conveniently used in order to generate three-dimensional realizations of Markov media and thus characterize the features of particle transport e.g. in fragmented fuel elements following severe nuclear accidents or Rayleigh-Taylor turbulent mixing for inertial confinement fusion. In this paper we show that Poisson tessellations can be extended to take into account the presence of spatial gradients, which commonly occur in real-world applications due to material stratification. For this purpose, we will provide an explicit construction of spatially-non-homogeneous Poisson tessellations, fully characterize their statistical properties, and finally illustrate the behaviour of particle transport in such random media. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

The benefits of diligence: how precise are predicted gravitational wave spectra in models with phase transitions?

Models of particle physics that feature phase transitions typically provide predictions for stochastic gravitational wave signals at future detectors and such predictions are used to delineate portions of the model parameter space that can be constrained. The question is: how precise are such predictions? Uncertainties enter in the calculation of the macroscopic thermal parameters and the dynamics of the phase transition itself. We calculate such uncertainties with increasing levels of sophistication in treating the phase transition dynamics. Currently, the highest level of diligence corresponds to careful treatments of the source lifetime; mean bubble separation; going beyond the bag model approximation in solving the hydrodynamics equations and explicitly calculating the fraction of energy in the fluid from these equations rather than using a fit; and including fits for the energy lost to vorticity modes and reheating effects. The lowest level of diligence incorporates none of these effects. We compute the percolation and nucleation temperatures, the mean bubble separation, the fluid velocity, and ultimately the gravitational wave spectrum corresponding to the level of highest diligence for three explicit examples: SMEFT, a dark sector Higgs model, and the real singlet-extended Standard Model (xSM). In each model, we contrast different levels of diligence in the calculation and find that the difference in the final predicted signal can be several orders of magnitude. Our results indicate that calculating the gravitational wave spectrum for particle physics models and deducing precise constraints on the parameter space of such models continues to remain very much a work in progress and warrants care.

79 ASTRONOMY AND ASTROPHYSICS↗

Effects of grain size and porosity on cladding failure in high-burnup UO 2 : A sensitivity and uncertainty study

Isotopic taggants are being studied to aid in the provenance assessment of nuclear materials. However, these taggants must be selected such that they do not adversely affect fuel performance during normal operation or accident scenarios. Taggants are known to affect the fuel’s grain size and porosity. In the work described in this paper, the BISON fuel performance code was used to assess the potential effects of taggants (i.e., grain size and porosity) on fuel rod behavior and cladding failure during a high-burnup, large-break loss-of-coolant accident. Here, 281 individual fuel rods from the same reactor core were modeled for a sensitivity study, a parametric study, and uncertainty quantification. The cladding failure predictions often exhibited stochastic behavior. After additional study, it was found that the cladding failure model is highly sensitive to residual error inherent to numerical approximation solvers. Some strategies to mitigate this sensitivity are discussed. The study found no relationship between known taggant effects and cladding failure status. However, taggants were found to affect the time and location of failure in certain rods. In conclusion, future work to continue investigating and validating these findings is briefly discussed.

Doped UO 2↗

True random number generation using the spin crossover in LaCoO 3

While digital computers rely on software-generated pseudo-random number generators, hardware-based true random number generators (TRNGs), which employ the natural physics of the underlying hardware, provide true stochasticity, and power and area efficiency. Research into TRNGs has extensively relied on the unpredictability in phase transitions, but such phase transitions are difficult to control given their often abrupt and narrow parameter ranges (e.g., occurring in a small temperature window). Here we demonstrate a TRNG based on self-oscillations in LaCoO 3 that is electrically biased within its spin crossover regime. The LaCoO 3 TRNG passes all standard tests of true stochasticity and uses only half the number of components compared to prior TRNGs. Assisted by phase field modeling, we show how spin crossovers are fundamentally better in producing true stochasticity compared to traditional phase transitions. As a validation, by probabilistically solving the NP-hard max-cut problem in a memristor crossbar array using our TRNG as a source of the required stochasticity, we demonstrate solution quality exceeding that using software-generated randomness.

97 MATHEMATICS AND COMPUTING↗

Operator learning for predicting multiscale bubble growth dynamics

We report simulating and predicting multiscale problems that couple multiple physics and dynamics across many orders of spatiotemporal scales is a great challenge that has not been investigated systematically by deep neural networks (DNNs). Herein, we develop a framework based on operator regression, the so-called deep operator network (DeepONet), with the long-term objective to simplify multiscale modeling by avoiding the fragile and time-consuming “hand-shaking” interface algorithms for stitching together heterogeneous descriptions of multiscale phenomena. To this end, as a first step, we investigate if a DeepONet can learn the dynamics of different scale regimes, one at the deterministic macroscale and the other at the stochastic microscale regime with inherent thermal fluctuations. Specifically, we test the effectiveness and accuracy of the DeepONet in predicting multirate bubble growth dynamics, which is described by a Rayleigh–Plesset (R–P) equation at the macroscale and modeled as a stochastic nucleation and cavitation process at the microscale by dissipative particle dynamics (DPD). First, we generate data using the R–P equation for multirate bubble growth dynamics caused by randomly time-varying liquid pressures drawn from Gaussian random fields (GRFs). Our results show that properly trained DeepONets can accurately predict the macroscale bubble growth dynamics and can outperform long short-term memory networks. We also demonstrate that the DeepONet can extrapolate accurately outside the input distribution using only very few new measurements. Subsequently, we train the DeepONet with DPD data corresponding to stochastic bubble growth dynamics. Although the DPD data are noisy and we only collect sparse data points on the trajectories, the trained DeepONet model is able to predict accurately the mean bubble dynamics for time-varying GRF pressures. Taken together, our findings demonstrate that DeepONets can be employed to unify the macroscale and microscale models of the multirate bubble growth problem, hence providing new insight into the role of operator regression via DNNs in tackling realistic multiscale problems and in simplifying modeling with heterogeneous descriptions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Gravitational waves from breaking of an extra U (1) in SO (10) grand unification

Abstract In a class of gauged $U(1)$ extended Standard Models (SMs), the breaking of the $U(1)$ symmetry is not only a source for Majorana masses of right-handed (RH) neutrinos crucial for the seesaw mechanism, but also a source of stochastic gravitational wave (GW) background. Such $U(1)$ extended models are well-motivated from the viewpoint of grand unification. In this paper, we discuss a successful ultraviolet completion of a $U(1)$ extended SM by an $SO(10)$ grand unified model through an intermediate step of $SU(5) \times U(1)$ unification. With a parameter set that is compatible with the $SO(10)$ grand unification, we find that a first-order phase transition associated with the $U(1)$ symmetry breaking can be strong enough to generate GWs with a detectable size of amplitude. We also find that the resultant GW amplitude reduces and its peak frequency becomes higher as the RH neutrino masses increase.

Physics↗