Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “stochastic sampling”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

STOCHASTIC OPTIMIZATION FOR LONG TERM CAPITAL STRUCTURES, SYSTEMS, AND COMPONENTS REFURBISHMENT AND REPLACEMENT

As commercial nuclear power plants (NPPs) pursue extended plant operations in the form of Second License Renewals (SLRs), opportunities exist for these plants to provide capital investments to ensure long-term, safe, and economic performance. Several utilities have already announced their intention to pursue extended operations for one or more of their NPPs via SLR2. The goal of this research is to develop a riskinformed approach to evaluate and prioritize plant capital investments made in preparation for, and during the period of, extended plant operations to support decisions in NPP operations. In order to prioritize project selection via a riskinformed approach we developed a single decision-making tool that integrates safety/reliability, cost, and stochastic optimization models to provide users with data analysis capabilities to more cost effectively manage plant assets. Both stochastic analysis methods—such as Monte Carlo-based sampling strategies—and multi-stage stochastic optimization strategies are employed to provide priority lists to decisionmakers in support of risk-informed decisions. We applied the proposed method to a trial application of projected replacement/refurbishment expenditures for plant capital assets (i.e., Structures, Systems, and Components [SSCs]). The objective is to optimize the SSC replacement/refurbishment schedule in terms of economic constraints, data uncertainties, and SSC reliability data, as well to generate a priority list for maximizing returns on investment.

42 ENGINEERING↗
DOE OSTI2026

Score-based deterministic density sampling

We propose a deterministic sampling framework using Score-Based Transport Modeling for sampling an unnormalized target density π given only its score ∇ log π. Our method approximates the Wasserstein gradient flow on KL($f_t$∥π) by learning the time-varying score ∇ log $f_t$ on the fly using score matching. While having the same marginal distribution as Langevin dynamics, our method produces smooth deterministic trajectories, resulting in monotone noise-free convergence. We prove that our method dissipates relative entropy at the same rate as the exact gradient flow, provided sufficient training. Numerical experiments validate our theoretical findings: our method converges at the optimal rate, has smooth trajectories, and is often more sample efficient than its stochastic counterpart. Experiments on high-dimensional image data show that our method produces high-quality generations in as few as 15 steps and exhibits natural exploratory behavior. The memory and runtime scale linearly in the sample size.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Partner with a Third-Party Delivery Service or Not? A Prediction-and-Decision Tool for Restaurants Facing Takeout Demand Surges During a Pandemic

Amidst the COVID-19 pandemic, restaurants become more reliant on no-contact pick-up or delivery ways for serving customers. As a result, they need to make tactical planning decisions such as whether to partner with online platforms, to form their own delivery team, or both. In this paper, we develop an integrated prediction-decision model to analyze the profit of combining the two approaches and to decide the needed number of drivers under stochastic demand. We first use the susceptible-infected-recovered (SIR) model to forecast future infected cases in a given region and then construct an autoregressive-moving-average (ARMA) regression model to predict food-ordering demand. Using predicted demand samples, we formulate a stochastic integer program to optimize food delivery plans. We conduct numerical studies using COVID-19 data and food-ordering demand data collected from local restaurants in Nuevo Leon, Mexico, from April to October 2020, to show results for helping restaurants build contingency plans under rapid market changes. Our method can be used under unexpected demand surges, various infection/vaccination status, and demand patterns. Here, our results show that a restaurant can benefit from partnering with third-party delivery platforms when (i) the subscription fee is low, (ii) customers can flexibly decide whether to order from platforms or from restaurants directly, (iii) customers require more efficient delivery, (iv) average delivery distance is long, or (v) demand variance is high.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Multistart algorithm for identifying all optima of nonconvex stochastic functions

Here, we propose a multistart algorithm to identify all local minima of a constrained, nonconvex stochastic optimization problem. The algorithm uniformly samples points in the domain and then starts a local stochastic optimization run from any point that is the "probabilistically best" point in its neighborhood. Under certain conditions, our algorithm is shown to asymptotically identify all local optima with high probability; this holds even though our algorithm is shown to almost surely start only finitely many local stochastic optimization runs. We demonstrate the performance of an implementation of our algorithm on nonconvex stochastic optimization problems, including identifying optimal variational parameters for the quantum approximate optimization algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Learning the temporal evolution of multivariate densities via normalizing flows

In this work, we propose a method to learn multivariate probability distributions using sample path data from stochastic differential equations. Specifically, we consider temporally evolving probability distributions (e.g., those produced by integrating local or nonlocal Fokker–Planck equations). Here, we analyze this evolution through machine learning assisted construction of a time-dependent mapping that takes a reference distribution (say, a Gaussian) to each and every instance of our evolving distribution. If the reference distribution is the initial condition of a Fokker–Planck equation, what we learn is the time-T map of the corresponding solution. Specifically, the learned map is a multivariate normalizing flow that deforms the support of the reference density to the support of each and every density snapshot in time. We demonstrate that this approach can approximate probability density function evolutions in time from observed sampled data for systems driven by both Brownian and Lévy noise. We present examples with two- and three-dimensional, uni- and multimodal distributions to validate the method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Adaptive Sampling Trust Region Method for Bi-fidelity Simulation Optimization [SWR-25-166]

Adaptive Sampling Trust Region Method for Bi-fidelity Simulation Optimization aims to demonstrate the effect of adaptive sampling-based bi-fidelity stochastic trust region method (ASTRO-BFDF). ASTRO-BFDF, derived from a derivative-free adaptive sampling trust-region optimization (ASTRO-DF) (Shashaani et al. 2018, Ha and Shashaani 2023), intended to efficiently solve the bi-fidelity simulation optimization.

Mueller, Juliane [National Laboratory of the Rocki↗
DOE OSTI2023

SDSS-IV MaNGA: How Galaxy Interactions Influence Active Galactic Nuclei

We present a comparative study of active galactic nuclei (AGN) between galaxy pairs and isolated galaxies with the final data release of the MaNGA integral field spectroscopic survey. We build a sample of 391 kinematic galaxy pairs within the footprint of the survey and select AGN using the survey's spectra. We use the comoving volume densities of the AGN samples to quantify the effects that tidal interactions have on the triggering of nuclear accretion. Our hypothesis is that the pair sample contains AGN that are triggered by not only stochastic accretion but also tidally induced accretion and correlated accretion. With the level of stochastically triggered AGN fixed by the control sample, we model the strength of tidally induced accretion and correlated accretion as a function of projected separation (r p ) and compare the model expectations with the observed volume densities of dual AGN and offset AGN (single AGN in a pair). At r p ~ 10 kpc, we find that tidal interactions induce ~30% more AGN than stochastic fueling and cause ~12% of the offset AGN to become dual AGN because of correlations. The strength of both these effects decreases with increasing r p . We also find that the [O III ] luminosities of the AGN in galaxy pairs are consistent with those found in isolated galaxies, likely because stochastically fed AGN dominate even among close pairs. Our results illustrate that while we can detect tidally induced effects statistically, it is challenging to separate tidally induced AGN and stochastically triggered AGN in interacting galaxies.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

A Pseudoreversible Normalizing Flow for Stochastic Dynamical Systems with Various Initial Distributions

Here, we present a pseudoreversible normalizing flow method for efficiently generating samples of the state of a stochastic differential equation (SDE) with various initial distributions. The primary objective is to construct an accurate and efficient sampler that can be used as a surrogate model for computationally expensive numerical integration of SDEs, such as those employed in particle simulation. After training, the normalizing flow model can directly generate samples of the SDE’s final state without simulating trajectories. The existing normalizing flow model for SDEs depends on the initial distribution, meaning the model needs to be retrained when the initial distribution changes. The main novelty of our normalizing flow model is that it can learn the conditional distribution of the state, i.e., the distribution of the final state conditional on any initial state, such that the model only needs to be trained once and the trained model can be used to handle various initial distributions. This feature can provide a significant computational saving in studies of how the final state varies with the initial distribution. Additionally, we propose to use a pseudoreversible network architecture to define the normalizing flow model, which has sufficient expressive power and training efficiency for a variety of SDEs in science and engineering, e.g., in particle physics. We provide a rigorous convergence analysis of the pseudoreversible normalizing flow model to the target probability density function in the Kullback–Leibler divergence metric. Numerical experiments are provided to demonstrate the effectiveness of the proposed normalizing flow model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Sensitivity analysis, surrogate modeling, and optimization of pebble-bed reactors considering normal and accident conditions

This research provides a valuable tool that streamlines the optimization process while significantly increasing its accuracy. This study creates a robust framework for reactor design optimization by incorporating comprehensive modeling using the Comprehensive Reactor Analysis Bundle, or BlueCRAB, within the Multiphysics Object-Oriented Simulation Environment (MOOSE). BlueCRAB is the United States Nuclear Regulatory Commission's code suite for non-light water reactor analysis and includes the Griffin, Pronghorn, and Bison applications. This not only improves the efficiency of the optimization process but also enhances the reliability of the results. Such a tool is essential for advancing the state-of-the-art in pebble-bed reactor technology and is critical for achieving the goals of Generation IV reactors, which aim for safe, sustainable, and economically viable nuclear energy solutions. This work presents and applies this workflow on pebble-bed reactors while considering both normal and off-normal conditions. A representative gas-cooled pebble-bed reactor at equilibrium core conditions serves as the nominal design specification for normal operation and is based on previous research. The depressurized loss-of-forced-cooling accident is deployed for off-normal conditions in this work. After defining design-related parameters and quantities of interest regarding reactor safety and performance, this multiphysics model is sampled using the MOOSE stochastic tools module. The result is a comprehensive dataset of configurations, enabling sensitivity analysis and the generation of surrogate models. Subsequently, the dataset and surrogate models are employed in two optimization studies aimed at maximizing fuel utilization and economic profit while adhering to safety and operational constraints. Performing the optimization process with fuel utilization as the metric leads to an improvement of approximately 10%, compared to engineering-judgment-based nominal conditions. The optimization on economic profit leads to an estimated increase of ~300 million USD over the lifetime of the reactor.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

On the character of turbulent-like flows in self-consistent models of core-collapse supernovae

Neutrino-driven convection plays a crucial role in the development of core-collapse supernova (CCSN) explosions. However, the complex mechanism that triggers the shock revival and the subsequent explosion has remained inscrutable for many decades. Multidimensional simulations suggest that the growth of fluid instabilities, especially development of convection, will determine the morphology of the explosion. We have performed 3D simulations using spherical-polar coordinates covering a reduced angular extent (90° computational domain), and with angular resolutions of 2°, 1°, 1/2°, and 1/4°, to study the development of turbulent-like flows in core-collapse supernova explosions on a time scale of order 100 ms. We have employed the multi-physics Chimera code that includes detailed nuclear physics and spectral neutrino transport. Coarse resolution models do not develop an inertial range, presumably due to the bottleneck effect, such that the energy is prevented from cascading down to small scales and tends to accumulate at large scales. High-resolution models instead, start to recover the k −5/3 scaling of Kolmogorov's theory. Stochasticity and few simulation samples limit our ability to predict the development of explosions. Over the simulated time period, our models show no clear trend in improving (or diminishing) conditions for explosion as the angular resolution is increased. However, we find that disordered flow provides an effective pressure, as characterized by the Reynolds stress, behind the shock. This contribution, ~40%–50% of the thermal pressure, aids shock revival and thus the development of the explosion. Finally, we show that the kinetic energy power spectrum of reduced angular extent and full 4π models are consistent, thus indicating that a 90° computational domain is an adequate configuration to study the character of turbulence in CCSNe.

Casanova Bustamante, Jordi↗
DOE OSTI2020

Production of relativistic electrons at subrelativistic laser intensities

Relativistic electron temperatures were measured from kilojoule, subrelativistic laser-plasma interactions. Experiments reflect an order of magnitude higher temperatures than expected from a ponderomotive scaling, where temperatures of up to 2.2 MeV were generated using an intensity of 1 × 10 18 W/cm 2 . Two-dimensional particle-in-cell simulations suggest that electrons gain superponderomotive energies by stochastic acceleration as they sample a large area of rapidly changing laser phase. We further demonstrate that such high temperatures are possible from subrelativistic intensities by using lasers with long pulse durations and large spatial scales.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Assignment of Freight Traffic in a Large-scale Intermodal Network under Uncertainty

This paper presents a methodology for freight traffic assignment in a large-scale road-rail intermodal network under uncertainty. Network uncertainties caused by natural disasters have dramatically increased in recent years. Several of these disasters (e.g., Hurricane Sandy, Mississippi River Flooding, and Hurricane Harvey) severely disrupted the U.S. freight transportation network, and consequently, the supply chain. To account for these network uncertainties, a stochastic freight traffic assignment model is formulated. An algorithmic framework, involving the sample average approximation and gradient projection algorithm, is proposed to solve this challenging problem. The developed methodology is tested on the U.S. intermodal network with freight flow data from the Freight Analysis Framework. The experiments consider three types of natural disasters that have different risks and impacts on transportation networks: earthquakes, hurricanes, and floods. It is found that for all disaster scenarios, freight ton-miles are higher compared to the base case without uncertainty. The increase in freight ton-miles is the highest under the flooding scenario; this is because there are more states in the flood-risk areas, and they are scattered throughout the U.S.

42 ENGINEERING↗
DOE OSTI2022

Evaluation and Optimization of Well Completion Options for the Utah FORGE Site

Orientation and completion for well pairs that have been subjected to multi-zonal stimulation play a critical role in the long-term performance of an Enhanced Geothermal Reservoir. Enhanced geothermal systems often rely on preferential flow along fractures between well injection and production locations. Modeling this preferential flow using discrete fracture networks (DNF) relies on stochastic realizations of the DFN based on geological sampling. Here we present the development of a stochastic optimization methodology to determine well completion options in a discrete fracture network based on using parallel subset simulation. Stochastic optimization will provide insight into regions where placements of the injection and production wells are optimal. An example optimization of well-pair location optimization based on a deterministic-stochastic DFN model representing FORGE follows a discussion of the theory.

15 GEOTHERMAL ENERGY↗
DOE OSTI2023

Development of Multiresolution Capabilities for the Holistic Energy Resource Optimization Network (HERON) tool A progress update

INL researchers work on technoeconomic analyses for integrated energy systems (IES) using the Framework for Optimization of ResourCes and Economics (FORCE). Within FORCE, researchers use the Holistic Energy Resource Optimization Network (HERON) tool to conduct optimization of grid portfolios under uncertain market conditions. These optimizations determine optimal capacities for all IES components and strategies for resource dispatch which maximize some economic metric (e.g., net present value). Resource dispatch occurs on finer timescales (typically hours) and thus are asked to respond to a given time series (e.g. hourly load demand profiles for a grid, or pre-determined electricity prices). Volatile and complex bidding dynamics as well as poorly forecasted weather events within deregulated markets add uncertainty to the time series; FORCE can address this uncertainty by training a reduced order model on historical time series and generate unique synthetic time series which represent individual scenarios or realizations of the market. The IES configuration can be simulated under these different sampled realizations and a stochastic optimization is conducted which optimizes the expected value of the desired economic metric. The training of a synthetic time series generator is limited by the chosen time resolution; dynamics can occur on different time scales. Seasonal demand trends can dominate faster dynamical events (such as power outages from certain sectors or severe weather events) which might not get captured correctly by the trained model. In this report, we investigate different ways of addressing the training and generation of time series on multiple time scales using three main algorithms: wavelet decomposition, dynamic mode decomposition, and generative adversarial networks for time series. We demonstrate a time series analysis that yields information on not just the frequency space but also temporal space: where a fast Fourier transform can provide what frequencies dominate, the new algorithms can provide when the frequencies dominate as well. These analyses can help improve IES optimization by allowing researchers to couple simulations at different timescales when it is most needed - seasonal, day-ahead, and real time optimization - with greater computational efficiency. Future work will include implementation of a subset of the proposed algorithms into the FORCE toolset and application of these analyses into multiple timescale optimization.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

Sensitivity Analysis, Reduced-order Modeling, and Optimization of a Gas-Cooled Pebble Bed Reactor using Equilibrium-Core and DLOFC Performance

This work presents and applies a workflow for performing design optimization on gas-cooled pebble-bed reactors. Based on previous research, a representative equilibrium core of a pebble-bed reactor and a depressurized loss-of-forced-cooling model are created. These applications are built using the Multiphysics Object-Oriented Simulation Environment (MOOSE), specifically utilizing Griffin, Pronghorn, and Bison. After defining design-related parameters and quantities of interest regarding reactor safety and efficiency, this multiphysics model is sampled using the MOOSE stochastic tools module. The result is a comprehensive dataset of configurations, enabling sensitivity analysis and the generation of reduced-order models. Subsequently, the dataset and reduced-order models are employed in an optimization study aimed at maximizing fuel utilization while adhering to safety and operational constraints. The optimization process leads to an improvement of fuel utilization by approximately 10\%, compared to engineering-judgment-based nominal conditions.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Improving statistical precision in Monte Carlo samples with negative weights via reweighting and uncertainty quantification

High statistical precision is critical for Monte Carlo (MC) samples in high energy physics and is degraded by negatively weighted events. This paper investigates a procedure to learn the relationship between the negative and positive weight distributions of any sample, allowing the reduction of statistical uncertainty by reweighting kinematically equivalent events with the same sign. A robust uncertainty quantification method is required for the practical application of such method. Two methods for the estimation of the reweighting uncertainty are developed: one at the event and another one at the final observable level. The latter method is strongly favored. The gains in statistical precision are then quantified. The method is demonstrated on Sherpa vector boson plus jets samples when using all generated events and when restricted to the signal region of a mock analysis. It is demonstrated to significantly reduce stochastic behavior in sparse MC samples while decreasing the overall uncertainty with a sufficiently well-known reweighting function.

Monte Carlo methods↗
DOE OSTI2020

A Stochastic Gradient Descent Approach for Stochastic Optimal Control

In this work, we introduce a stochastic gradient descent approach to solve the stochastic optimal control problem through stochastic maximum principle. The motivation that drives our method is the gradient of the cost functional in the stochastic optimal control problem is under expectation, and numerical calculation of such an expectation requires fully computation of a system of forward backward stochastic differential equations, which is computationally expensive. By evaluating the expectation with single-sample representation as suggested by the stochastic gradient descent type optimisation, we could save computational efforts in solving FBSDEs and only focus on the optimisation task which aims to determine the optimal control process.

97 MATHEMATICS AND COMPUTING↗