Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “stochastic approximation”

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.

321 records · Page 18

Learning Forecasts of Rare Stratospheric Transitions from Short Simulations

Abstract Rare events arising in nonlinear atmospheric dynamics remain hard to predict and attribute. We address the problem of forecasting rare events in a prototypical example, sudden stratospheric warmings (SSWs). Approximately once every other winter, the boreal stratospheric polar vortex rapidly breaks down, shifting midlatitude surface weather patterns for months. We focus on two key quantities of interest: the probability of an SSW occurring, and the expected lead time if it does occur, as functions of initial condition. These optimal forecasts concretely measure the event’s progress. Direct numerical simulation can estimate them in principle but is prohibitively expensive in practice: each rare event requires a long integration to observe, and the cost of each integration grows with model complexity. We describe an alternative approach using integrations that are short compared to the time scale of the warming event. We compute the probability and lead time efficiently by solving equations involving the transition operator, which encodes all information about the dynamics. We relate these optimal forecasts to a small number of interpretable physical variables, suggesting optimal measurements for forecasting. We illustrate the methodology on a prototype SSW model developed by Holton and Mass and modified by stochastic forcing. While highly idealized, this model captures the essential nonlinear dynamics of SSWs and exhibits the key forecasting challenge: the dramatic separation in time scales between a single event and the return time between successive events. Our methodology is designed to fully exploit high-dimensional data from models and observations, and has the potential to identify detailed predictors of many complex rare events in meteorology.

Finkel, Justin↗

Once-in-a-lifetime encounter models for neutrino media. II. Quasisteady states and miscidynamic flavor evolution

We extended the once-in-a-lifetime encounter (OILE) model to stochastic interactions among neutrinos. As in the original OILE model, the new model reproduces the mean-field behavior of a dense neutrino gas for time 𝑡 ≲ (𝜇⁢𝛾) −1 , where 𝜇 measures the strength of the mean-field neutrino self-interaction potential and is proportional to the neutrino density, and the dimensionless “impact parameter” 𝛾 is a measure of the change in the flavor quantum state of a neutrino during interaction with another neutrino when the wave packets of the two neutrinos overlap. As in the mean-field case, the OILE model with random neutrino velocities experiences kinetic flavor decoherence as the flavor quantum states of the neutrinos diverge from each other. Unlike the mean-field case, however, the OILE model has a “collision term” due to the quantum entanglement among neutrinos. For 𝛾 ≪ 1, this incoherent effect can drive the neutrinos into a quasisteady state that is similar to the collective precession mode in a homogeneous and isotropic neutrino gas in the mean-field approximation. Subsequently, the collision term drives the neutrino gas adiabatically through different quasisteady states and eventually to flavor equilibration. This process is an example of miscidynamic flavor evolution, with the mixing equilibria being the quasisteady precession states.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A primal–dual algorithm for risk minimization

In this paper, we develop an algorithm to efficiently solve risk-averse optimization problems posed in reflexive Banach space. Such problems often arise in many practical applications as, e.g., optimization problems constrained by partial differential equations with uncertain inputs. Unfortunately, for many popular risk models including the coherent risk measures, the resulting risk-averse objective function is nonsmooth. Here, this lack of differentiability complicates the numerical approximation of the objective function as well as the numerical solution of the optimization problem. To address these challenges, we propose a primal–dual algorithm for solving large-scale nonsmooth risk-averse optimization problems. This algorithm is motivated by the classical method of multipliers and by epigraphical regularization of risk measures. As a result, the algorithm solves a sequence of smooth optimization problems using derivative-based methods. We prove convergence of the algorithm even when the subproblems are solved inexactly and conclude with numerical examples demonstrating the efficiency of our method.

97 MATHEMATICS AND COMPUTING↗

Position-dependent Voronoi probability distribution functions for matter and halos

Here, we measure the Voronoi density probability distribution function (PDF) for both dark matter and halos in N-body simulations. For the dark matter, Voronoi densities represent the matter density field smoothed on a uniform mass scale, which approximates the Lagrangian density field. For halos, the Voronoi densities contain information about the local environment of each halo. We measure the halo virial masses, the total amount of dark matter within each halo Voronoi cell, and the halo Voronoi cell volumes, and we show how halo abundances depend on these three quantities. We then study the position-dependent Voronoi density PDF, measured within finite subregions of the Universe, using separate universe simulations. We demonstrate that the spatial variation of the position-dependent PDF is due to large-scale density fluctuations, indicating that the position-dependent PDF is a biased tracer of large-scale structure. We measure this bias for the dark matter, and interpret it as the bias of regions of the Lagrangian density field that are selected based on density. For the halos, this bias can be interpreted as a form of assembly bias. We present the mapping from late-time to early-time Voronoi density for each simulation dark matter particle, which is highly stochastic. We compare the median of this stochastic map with spherical collapse calculations and discuss challenges involved in modeling the evolution of the density field on these scales.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Generalized master equation for particle transport in binary random media with renewal statistics

Particle transport in binary stochastic mixtures is classically modeled assuming Markovian or exponential mixing statistics but in many applications material memory invalidates the Markov assumption. For non-Markovian mixing characterized by alternating renewal processes, a transport-theoretic framework is presented that provides an exact description of transport in nonscattering random binary media with general non-exponential statistics. Our approach is to Markovianize the problem by augmenting the {material type, particle flux} state space with the age or distance from the last interface. A Chapman-Kolmogorov equation is formulated for the joint probability density of the material type, particle flux, and age, and subsequently reduced to a generalized Master equation (GME) in differential form. This constitutes the primary result of this work. A state-updating Monte Carlo algorithm consistent with the GME is developed and benchmarked against analytical solutions for multiple chord-length laws. For purely absorbing renewal statistical media, the GME reproduces analytical benchmarks for the equilibrium age distribution, interior mean/variance of material-conditioned fluxes, and boundary transmittance. Simulations further demonstrate that a Markov (exponential) approximation of non-exponential statistics can introduce large errors in transmittance and interior flux profiles. Lastly, the reintroduction of memory due to scattering is briefly addressed through heuristic considerations.

Fluctuations & noise↗

Transport in Stochastic Media with Random Chord Length Distributions

Thermal radiation transport computations in binary Markovian random mixtures rely almost exclusively on the Levermore-Pomraning (LP) model which is obtained by applying a heuristic closure to the ensemble averaged random medium transport equation. The validity of this model has been extensively tested by comparing numerical results over a broad parameter range (material types and mixing parameters) against benchmark solutions in planar geometry. The conditions under which the LP-model provides useful results and when it breaks down are now well established, but work to date has been largely restricted to homogeneous mixing statistics, i.e., the mean chord lengths of both materials are taken to be spatially constant. In recent work, this limitation was relaxed by allowing the mean chord lengths and, in a consistent fashion, the volume fractions in the LP-model to vary spatially and in a follow-up investigation benchmark solutions were obtained by ensemble averaging results over material realizations sampled from a nonhomogeneous Poisson process (NHPP). Numerical experiments in rod geometry with specifically linear and quadratic spatial dependence of chord lengths showed that the material averaged radiation intensities vary nonmonotonically with depth into the medium, in stark contrast to solutions obtained assuming uniform chord lengths. Moreover, depending on the local optical thickness and strength of scattering, the LP-model results showed locally more nuanced deviations from the benchmark solutions than was the case with constant chord lengths. These limited numerical investigations highlight the nontrivial qualitative and quantitative consequences of nonhomogeneous mixing statistics, in particular that closure approximations may not be uniformly valid or invalid over the problem domain.

42 ENGINEERING↗

Conditional Karhunen-Loève expansion for uncertainty quantification and active learning in partial differential equation models

We use a conditional Karhunen-Lo` eve (KL) model to quantify and reduce uncertainty in a stochastic partial differential equation (SPDE) problem with partially-known space-dependent coefficient, Y (x). We assume that a small number of Y (x) measurements are available and model Y (x) with a KL expansion. We achieve reduction in uncertainty by conditioning the KL expansion coefficients on measurements. We consider two approaches for conditioning the KL expansion: In Approach 1, we condition the KL model first and then truncate it. In Approach 2, we first truncate the KL expansion and then condition it. We employ the conditional KL expansion together with Monte Carlo and sparse grid collocation methods to compute the moments of the solution of the SPDE problem. Uncertainty of the problem is further reduced by adaptively selecting additional observation locations using two active learning methods. Method 1 minimizes the variance of the PDE coefficient, while Method 2 minimizes the variance of the solution of the PDE. We demonstrate that conditioning leads to dimension reduction of the KL representation of Y (x). For a linear diffusion SPDE with uncertain log-normal coefficient, we show that Approach 1 provides a more accurate approximation of the conditional log-normal coefficient and solution of the SPDE than Approach 2 for the same number of random dimensions in a conditional KL expansion. Furthermore, Approach 2 provides a good estimate for the number of terms of the truncated KL expansion of the conditional field of Approach 1. Finally, we demonstrate that active learning based on Method 2 is more efficient for uncertainty reduction in the SPDE’s states (i.e., it leads to a larger reduction of the variance) than active learning using Method 2.

Conditioned Karhunen-Lo` eve expanion, machine lea↗

Denoising of imaginary time response functions with Hankel projections

Imaginary-time response functions of finite-temperature quantum systems are often obtained with methods that exhibit stochastic or systematic errors. Reducing these errors comes at a large computational cost—in quantum Monte Carlo simulations, the reduction of noise by a factor of two incurs a simulation cost of a factor of four. In this paper, we relate certain imaginary-time response functions to an inner product on the space of linear operators on Fock space. We then show that data with noise typically does not respect the positive definiteness of its associated Gramian. The Gramian has the structure of a Hankel matrix. As a method for denoising noisy data, we introduce an alternating projection algorithm that finds the closest positive definite Hankel matrix consistent with noisy data. We test our methodology at the example of fermion Green's functions for continuous-time quantum Monte Carlo data and show remarkable improvements of the error, reducing noise by a factor of up to 20 in practical examples. We argue that Hankel projections should be used whenever finite-temperature imaginary-time data of response functions with errors is analyzed, be it in the context of quantum Monte Carlo, quantum computing, or in approximate semianalytic methodologies. Published by the American Physical Society 2024

Yu, Yang (ORCID:0000000186178878)↗

Human-in-the-loop Sensing and Control for Commercial Building Energy Efficiency and Occupant Comfort

Most of the existing heating, ventilation and air conditioning (HVAC) systems in commercial buildings operate in a conservative manner by assuming maximum occupancy in each room during pre-specified periods of the week, leading to significant energy being wasted as rooms are over-conditioned compared to the actual requirements of the occupants. Though critical, our understanding of occupancy patterns and thermal comfort needs of the occupants in commercial buildings is lacking and it is well known that both of these quantities are stochastic and time-varying, thus requiring sensing solutions to estimate them. This project had the goal of designing, implementing and evaluating a hardware and software solution to ameliorate this challenge. In particular, a depth camera (one whose pixels reveal distance from the camera as opposed to color values) placed on doorways is used to detect entrance and exit events from thermal zones in the building, and thereby estimate their occupancy levels. This information is then fed to a novel control algorithm that can, through interactions with the HVAC system, learn how to provide control inputs that maximize comfort and minimize energy waste. The resulting system represents a significant improvement over existing controllers for commercial HVAC systems and allowed us to improve our understanding of the design of future human-in-the-loop control solutions. For this solution to be feasible, the project had target metrics for its performance and cost. In particular, entrance and exit events for occupants moving about the building would need to be detected with an accuracy higher than 97%; and the resulting control inputs derived from this information would need to lead to approximately 10% energy savings compared to a schedule-based controller. Furthermore, regarding the final hardware design, the project had a target bill of materials (BOM) cost for the sensing solution of less than US$200 per unit while using less than 25W of power on average. All of these target metrics were met or exceeded by our final proposed solution. We performed evaluations by deploying the system in over 20 rooms of different types across 6 commercial buildings in Pittsburgh, PA over the course of three years, and performing targeted controlled experiments to test its performance along the different metrics. The human-in-the-loop control solutions (both hardware and software) developed through this project are expected to lead to significant improvements in the comfort and energy efficiency of HVAC systems used in commercial buildings. The insights we developed through the project pave the way to HVAC systems that can condition interior spaces according to their real-time utilization and the thermal comfort needs of the occupants, thereby reducing energy use. They also open up a new learning-based way of configuring HVAC controllers without having to manually fine-tune them for each building. These innovations can significantly increase the adoption of novel control solutions by the industry and thereby save resources and reduce costs of operation.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Progress on Demonstration of a MOOSE-Based Coupled Capability for Hot Channel Factors in Fast Reactors

Hot channel factors (HCFs) are computed values that account for the impact on predicted peak fuel, cladding, and coolant temperatures due to uncertainties in the as-built reactor’s material properties and geometry as well as uncertainties due to modeling approximations. Reduction in computed HCF values via reduction or elimination of modeling approximations may translate to significant economic savings if the reactor power can be raised due to the extra temperature margin gained. While limited historical datasets exist for sodium-cooled fast reactors (SFRs), there are no available HCF data for lead-cooled fast reactors (LFRs) outside of work generated previously within NEAMS. The computation of HCFs involves insights from reactor physics, thermal fluids and heat conduction calculations to determine how the peak temperatures respond to various uncertainties in the design. Due to the significant advantages for multi-physics coupling offered by the MOOSE framework, Griffin (MOOSE-based reactor physics code), MOOSE Heat Conduction Module, and Cardinal (MOOSE-wrapped multi-physics application which includes the NekRS thermal fluids code) are being coupled together using the MOOSE MultiApp System to develop a highfidelity multi-physics modeling capability for HCF simulations. This high-fidelity coupling workflow may also be beneficial for other fast reactor applications in the future. In previous work, Griffin and NekRS were individually assessed to ensure the necessary capabilities were in place. This work describes initial efforts to couple the codes (including folding in the MOOSE Heat Conduction Module) and determining the workflow for the perturbed calculations which will leverage the Stochastic Tools Module (STM). To our knowledge, this is the first coupling of Griffin and NekRS as well as the first exploratory use of Stochastic Tools Module for Cardinal. In this report, the neutronics code Griffin, the heat conduction solver in MOOSE, and the MOOSE-wrapped application containing NekRS (Cardinal) are linked together to demonstrate the coupled capability. Griffin and Cardinal are linked dynamically by specifying shared libraries. Different coupling hierarchies are tested for selecting the most appropriate coupling strategy. A coupling scheme is selected based on the efficiency of calculation and ease of data communication. Multiple tests are performed to choose suitable mesh structure, model configurations, scheme setup and boundary conditions to avoid loss of energy due to data interpolation between different modules or weak imposition of fluxes in finite element codes. Computational experiments are performed to study the tolerance control of each type of iteration to avoid false convergence. The coupled capability is demonstrated in both single pin and 7-pin models based on LFR materials and geometry. The study finds that the use of too large a time step size in the heat conduction module can lead to temperature oscillation even though the heat conduction equation does not have a time-derivative kernel, but only the time-dependent boundary condition. A 7-pin model without duct region achieved good convergence in the coupled calculation while a 7 pin model with duct region experienced data communication issues which need to be resolved.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Accelerating multilevel Markov Chain Monte Carlo using machine learning models

Here, this work presents an efficient approach for accelerating multilevel Markov Chain Monte Carlo (MCMC) sampling for large-scale problems using low-fidelity machine learning models. While conventional techniques for large-scale Bayesian inference often substitute computationally expensive high-fidelity models with machine learning models, thereby introducing approximation errors, our approach offers a computationally efficient alternative by augmenting high-fidelity models with low-fidelity ones within a hierarchical framework. The multilevel approach utilizes the low-fidelity machine learning model (MLM) for inexpensive evaluation of proposed samples thereby improving the acceptance of samples by the high-fidelity model. The hierarchy in our multilevel algorithm is derived from geometric multigrid hierarchy. We utilize an MLM to accelerate the coarse level sampling. Training machine learning model for the coarsest level significantly reduces the computational cost associated with generating training data and training the model. We present an MCMC algorithm to accelerate the coarsest level sampling using MLM and account for the approximation error introduced. We provide theoretical proofs of detailed balance and demonstrate that our multilevel approach constitutes a consistent MCMC algorithm. Additionally, we derive the expression for cost reduction due to machine learning model to facilitate cost analysis of the hierarchical sampling algorithm. Our technique is demonstrated on a standard benchmark inference problem in groundwater flow, where we estimate the probability density of a quantity of interest using a four-level MCMC algorithm. Our proposed algorithm accelerates multilevel sampling by a factor of two while achieving similar accuracy compared to sampling using the standard multilevel algorithm.

97 MATHEMATICS AND COMPUTING↗

Fast Computational Algorithms for Partial Differential Equations and Uncertainty Quantifications

This project concerned the construction, testing and analysis of computational algorithms for solving parameterized and stochastic partial differential equations. The study and understanding of equations of this type is of fundamental importance in numerous engineering and scientific applications. Examples include simulation of plasma dynamics in models of electric propulsion and nuclear fusion, simulation of multiphase flows, such as the flow of water, gas and oil in reservoirs, and structural analysis of the dependence of structures on materials. Parametrization is used in such settings when properties of the models such as viscosity of fluids or electric resistivity of materials are not precisely understood and instead are treated as random variables. The resulting solutions are themselves random, and having such solutions will enable engineers to use probabilistic methods to assess the likelihood of events, for example, whether a pollutant in a liquid will exceed a limit, and to use such analyses to develop ways to ensure positive outcomes. Construction of accurate (high resolution) computational solutions is expensive, requiring significant computer time and computational resources, and there is need to reduce computational cost to make simulation useful and effective. The aim of the project was to construct algorithms to efficiently compute surrogate solutions to parameterized problems to allow for efficient and accurate simulation. The technical approach used focused on two related strategies, based on rank-reduction methods and reduced-order models. These methods construct surrogate solutions of parameter-dependent models by projection or interpolation into low-dimensional approximation spaces. Cost savings are achieved if the low-dimensional spaces can be identified and constructed efficiently and if the resulting low-dimensional algebraic systems can be solved cheaply. Accomplishments include: Theoretical and empirical demonstration of the effectiveness of fast multigrid solution strategies for computing low-rank representations of parameter-dependent solutions to discrete partial differential equations, including the first proof establishing so-called textbook convergence properties for low-rank methods. Development of efficient solution algorithms for solving nonlinear parameter-dependent partial differential equations used in models of fluid dynamics. Developent of efficient algorithms for low-rank representation of solutions of time-dependent simulations of fluid dynamics using multi-dimensional tensor representations of solutions.

97 MATHEMATICS AND COMPUTING↗

Counting generations in birth and death processes with competing Erlang and exponential waiting times

Lymphocyte populations, stimulated in vitro or in vivo, grow as cells divide. Stochastic models are appropriate because some cells undergo multiple rounds of division, some die, and others of the same type in the same conditions do not divide at all. If individual cells behave independently, then each cell can be imagined as sampling from a probability density of times to division and death. The exponential density is the most mathematically and computationally convenient choice. It has the advantage of satisfying the memoryless property, consistent with a Markov process, but it overestimates the probability of short division times. With the aim of preserving the advantages of a Markovian framework while improving the representation of experimentally-observed division times, we consider a multi-stage model of cellular division and death. We use Erlang-distributed (or, more generally, phase-type distributed) times to division, and exponentially distributed times to death. We classify cells into generations, using the rule that the daughters of cells in generation n are in generation n + 1. In some circumstances, our representation is equivalent to established models of lymphocyte dynamics. We find the growth rate of the cell population by calculating the proportions of cells by stage and generation. The exponent describing the late-time cell population growth, and the criterion for extinction of the population, differs from what would be expected if N steps with rate λ were equivalent to a single step of rate λ/N. We link with a published experimental dataset, where cell counts were reported after T cells were transferred to lymphopenic mice, using Approximate Bayesian Computation. In the comparison, the death rate is assumed to be proportional to the generation and the Erlang time to division for generation 0 is allowed to differ from that of subsequent generations. The multi-stage representation is preferred to a simple exponential in posterior distributions, and the mean time to first division is estimated to be longer than the mean time to subsequent divisions.

59 BASIC BIOLOGICAL SCIENCES↗

Similarity of capacitive radio-frequency discharges in nonlocal regimes

Similarity transformations are essential for correlating discharges at different scales, which are mostly utilized with local field or local energy approximations. In this work, we report the fully kinetic results from particle-in-cell/Monte Carlo collision simulations that unambiguously demonstrate the similarity of radio frequency (rf) discharges in nonlocal regimes where the electron energy relaxation length is much larger than the gap dimension. It is found that at a constant rf voltage amplitude, discharges will be similar if the gas pressure, inverse of gap distance, and rf driving frequency are all changed by the same scaling factor. The scaling relations of fundamental parameters are illustrated for rf discharges in the alpha-mode with secondary electron emission ignored, and the temporal electron kinetics are shown to have invariance in similar discharges. The results explicitly validate the scaling laws in nonlocal kinetic regimes, indicating promising application potentials of the similarity transformations across a wide range of kinetic regimes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Utah FORGE: 2024 Discrete Fracture Network Model Data

The Utah FORGE 2024 Discrete Fracture Network (DFN) Model dataset provides a set of files representing discrete fracture network modeling for the FORGE site near Milford, Utah. The dataset includes four distinct DFN model file sets, each corresponding to different time frames and modeling approaches in 2024. These models characterize both natural and induced fractures in the geothermal reservoir, which consists of crystalline granitic and metamorphic rock approximately 8,000 feet below the ground surface. The dataset includes a reference DFN model from February 2024 that incorporates planar fractures and well trajectories, as well as upscaled permeability, porosity, compressibility, and storage values on specified grids. Additionally, there are models based on new microseismic (MEQ) data from May and July 2024, including fracture planes fitted to the latest MEQ catalog datasets, tensile fractures from hydraulic stimulation, and an alternative connected DFN for modeling purposes. Coordinate data is provided in both global and local frames, with detailed instructions on the transformations used to align with principal stress orientations. The dataset also includes notes and calculation files for estimating fracture sizes and differences between various fracture sets. There are subfolders for Global Coordinates and Local Coordinates. To move from the global to the local coordinate frame, fractures and wells were a) rotated 20 degrees counterclockwise looking down about the global point (335376.400482041, 4263189.99998761, 250.093546450195) to better align with the principal stresses; and b) translated by (-335408.68, -4263010.9, 1150). Upscaled permeability values using the _XYZ suffix show directions with respect to the global XYZ coordinate frame, while those using the _IJK suffix are aligned with local coordinate frame.

15 GEOTHERMAL ENERGY↗