Search NASA⌕ Search

SEARCH · Search NASA

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 217 records · Page 12

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↗

RAVEN Theory Manual

RAVEN is a software framework able to perform parametric and stochastic analysis based on the response of complex system codes. The initial development was aimed at providing dynamic risk analysis capabilities to the thermohydraulic code RELAP-7, currently under development at Idaho National Laboratory (INL). Although the initial goal has been fully accomplished, RAVEN is now a multi-purpose stochastic and uncertainty quantification platform, capable of communicating with any system code. In fact, the provided Application Programming Interfaces (APIs) allow RAVEN to interact with any code as long as all the parameters that need to be perturbed are accessible by input files or via python interfaces. RAVEN is capable of investigating system response and explore input space using various sampling schemes such as Monte Carlo, grid, or Latin hypercube. However, RAVEN strength lies in its system feature discovery capabilities such as: constructing limit surfaces, separating regions of the input space leading to system failure, and using dynamic supervised learning techniques. The development of RAVEN started in 2012 when, within the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, the need to provide a modern risk evaluation framework arose. RAVEN’s principal assignment is to provide the necessary software and algorithms in order to employ the concepts developed by the Risk Informed Safety Margin Characterization (RISMC) program. RISMC is one of the pathways defined within the Light Water Reactor Sustainability (LWRS) program. In the RISMC approach, the goal is not just to identify the frequency of an event potentially leading to a system failure, but the proximity (or lack thereof) to key safety-related events. Hence, the approach is interested in identifying and increasing the safety margins related to those events. A safety margin is a numerical value quantifying the probability that a safety metric (e.g. peak pressure in a pipe) is exceeded under certain conditions. Most of the capabilities, implemented having RELAP-7 as a principal focus, are easily deployable to other system codes. For this reason, several side activates have been employed (e.g. RELAP5-3D, any MOOSE-based App, etc.) or are currently ongoing for coupling RAVEN with several different software. The aim of this document is to provide a set of commented examples that can help the user to become familiar with the RAVEN code usage.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Stochastic Inversion of 2D Magnetotelluric Data

The algorithm is developed to invert 2D magnetotelluric (MT) data based on sharp boundary parametrization using a Bayesian framework. Within the algorithm, we consider the locations and the resistivity of regions formed by the interfaces are as unknowns. We use a parallel, adaptive finite-element algorithm to forward simulate frequency-domain MT responses of 2D conductivity structure. Those unknown parameters are spatially correlated and are described by a geostatistical model. The joint posterior probability distribution function is explored by Markov Chain Monte Carlo (MCMC) sampling methods. The developed stochastic model is effective for estimating the interface locations and resistivity. Most importantly, it provides details uncertainty information on each unknown parameter. Hardware requirements: PC, Supercomputer, Multi-platform, Workstation; Software requirements C and Fortan; Operation Systems/version is Linux/Unix or Windows

Chen, Jinsong↗

A diffusive information preservation method for small Knudsen number flows

The direct simulation Monte Carlo (DSMC) method is a powerful particle-based method for modeling gas flows. It works well for relatively large Knudsen (Kn) numbers, typically larger than 0.01, but quickly becomes computationally intensive as Kn decreases due to its time step and cell size limitations. An alternative approach was proposed to relax or remove these limitations, based on replacing pairwise collisions with a stochastic model corresponding to the Fokker–Planck equation [J. Comput. Phys., 229, 1077 (2010); J. Fluid Mech., 680, 574 (2011)]. Similar to the DSMC method, the downside of that approach suffers from computationally statistical noise. To solve the problem, a diffusion-based information preservation (D-IP) method has been developed. The main idea is to track the motion of a simulated molecule from the diffusive standpoint, and obtain the flow velocity and temperature through sampling and averaging the IP quantities. To validate the idea and the corresponding model, several benchmark problems with Kn ∼ 10{sup −3}–10{sup −4} have been investigated. It is shown that the IP calculations are not only accurate, but also efficient because they make possible using a time step and cell size over an order of magnitude larger than the mean collision time and mean free path, respectively.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

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↗

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↗

Design optimization of a scramjet under uncertainty using probabilistic learning on manifolds

Here, we demonstrate, on a scramjet combustion problem, a constrained probabilistic learning approach that augments physics-based datasets with realizations that adhere to underlying constraints and scatter. The constraints are captured and delineated through diffusion maps, while the scatter is captured and sampled through a projected stochastic differential equation. The objective function and constraints of the optimization problem are then efficiently framed as non-parametric conditional expectations. Different spatial resolutions of a large-eddy simulation filter are used to explore the robustness of the model to the training dataset and to gain insight into the significance of spatial resolution on optimal design.

42 ENGINEERING↗

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↗

Anomalous transport in disordered fracture networks: Spatial Markov model for dispersion with variable injection modes

Here we investigate tracer transport on random discrete fracture networks that are characterized by the statistics of the fracture geometry and hydraulic conductivity. While it is well known that tracer transport through fractured media can be anomalous and particle injection modes can have major impact on dispersion, the incorporation of injection modes into effective transport modeling has remained an open issue. The fundamental reason behind this challenge is that—even if the Eulerian fluid velocity is steady—the Lagrangian velocity distribution experienced by tracer particles evolves with time from its initial distribution, which is dictated by the injection mode, to a stationary velocity distribution. We quantify this evolution by a Markov model for particle velocities that are equidistantly sampled along trajectories. This stochastic approach allows for the systematic incorporation of the initial velocity distribution and quantifies the interplay between velocity distribution and spatial and temporal correlation. The proposed spatial Markov model is characterized by the initial velocity distribution, which is determined by the particle injection mode, the stationary Lagrangian velocity distribution, which is derived from the Eulerian velocity distribution, and the spatial velocity correlation length, which is related to the characteristic fracture length. This effective model leads to a time-domain random walk for the evolution of particle positions and velocities, whose joint distribution follows a Boltzmann equation. Finally, we demonstrate that the proposed model can successfully predict anomalous transport through discrete fracture networks with different levels of heterogeneity and arbitrary tracer injection modes.

54 ENVIRONMENTAL SCIENCES↗

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↗

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↗

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↗

DAKOTA Design Analysis Kit for Optimization and Terascale

The DAKOTA (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a flexible and extensible interface between simulation codes (computational models) and iterative analysis methods. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the DAKOTA toolkit provides a flexible and extensible problem-solving environment for design and analysis of computational models on high performance computers.A user provides a set of DAKOTA commands in an input file and launches DAKOTA. DAKOTA invokes instances of the computational models, collects their results, and performs systems analyses. DAKOTA contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, polynomial chaos, stochastic collocation, and epistemic methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as hybrid optimization, surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. Services for parallel computing, simulation interfacing, approximation modeling, fault tolerance, restart, and graphics are also included.

SciDAC↗

Testing of Strategies for the Acceleration of the Cost Optimization

The general problem addressed in the Nuclear-Renewable Hybrid Energy System (N-R HES) project is finding the optimum economical dispatch (ED) and capacity planning solutions for the hybrid energy systems. In the present test-problem configuration, the N-R HES unit is composed of three electrical power-generating components, i.e. the Balance of Plant (BOP), the Secondary Energy Source (SES), and the Energy Storage (ES). In addition, there is an Industrial Process (IP), which is devoted to hydrogen generation. At this preliminary stage, the goal is to find the power outputs of each one of the N-R HES unit components (BOP, SES, ES) and the IP hydrogen production level that maximizes the unit profit by simultaneously satisfying individual component operational constraints. The optimization problem is meant to be solved in the Risk Analysis Virtual Environment (RAVEN) framework. The dynamic response of the N-R HES unit components is simulated by using dedicated object-oriented models written in the Modelica modeling language. Though this code coupling provides for very accurate predictions, the ensuing optimization problem is characterized by a very large number of solution variables. To ease the computational burden and to improve the path to a converged solution, a method to better estimate the initial guess for the optimization problem solution was developed. The proposed approach led to the definition of a suitable Monte Carlo-based optimization algorithm (called the preconditioner), which provides an initial guess for the optimal N-R HES power dispatch and the optimal installed capacity for each one of the unit components. The preconditioner samples a set of stochastic power scenarios for each one of the N-R HES unit components, and then for each of them the corresponding value of a suitably defined cost function is evaluated. After having simulated a sufficient number of power histories, the configuration which ensures the highest profit is selected as the optimal one. The component physical dynamics are represented through suitable ramp constraints, which considerably simplify the numerical solving. In order to test the capabilities of the proposed approach, in the present report, the dispatch problem only is tackled, i.e. a reference unit configuration is assumed, and each one of the N-R HES unit components is assumed to have a fixed installed capacity. As for the next steps, the main improvement will concern the operation strategy of the ES facility. In particular, in order to describe a more realistic battery commitment strategy, the ES operation will be regulated according to the electricity price forecasts.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

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↗