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 793 records · Page 44

Polynomial Chaos Surrogate Construction for Random Fields with Parametric Uncertainty

Engineering and applied science rely on computational experiments to rigorously study physical systems. The mathematical models used to probe these systems are highly complex, and sampling-intensive studies often require prohibitively many simulations for acceptable accuracy. Surrogate models provide a means of circumventing the high computational expense of sampling such complex models. In particular, polynomial chaos expansions (PCEs) have been successfully used for uncertainty quantification studies of deterministic models where the dominant source of uncertainty is parametric. We discuss an extension to conventional PCE surrogate modeling to enable surrogate construction for stochastic computational models that have intrinsic noise in addition to parametric uncertainty. We develop a PCE surrogate on a joint space of intrinsic and parametric uncertainty, enabled by Rosenblatt transformations, which are evaluated via kernel density estimation of the associated conditional cumulative distributions. Furthermore, we extend the construction to random field data via the Karhunen–Loève expansion. We then take advantage of closed-form solutions for computing PCE Sobol indices to perform a global sensitivity analysis of the model which quantifies the intrinsic noise contribution to the overall model output variance. Additionally, the resulting joint PCE is generative in the sense that it allows generating random realizations at any input parameter setting that are statistically approximately equivalent to realizations from the underlying stochastic model. The method is demonstrated on a chemical catalysis example model and a synthetic example controlled by a parameter that enables a switch from unimodal to bimodal response distributions.

97 MATHEMATICS AND COMPUTING↗

Generating moment matching scenarios using optimization techniques

An optimization based method is proposed to generate moment matching scenarios for numerical integration and its use in stochastic programming. The main advantage of the method is its flexibility: it can generate scenarios matching any prescribed set of moments of the underlying distribution rather than matching all moments up to a certain order, and the distribution can be defined over an arbitrary set. This allows for a reduction in the number of scenarios and allows the scenarios to be better tailored to the problem at hand. The method is based on a semi-infinite linear programming formulation of the problem that is shown to be solvable with polynomial iteration complexity. A practical column generation method is implemented. The column generation subproblems are polynomial optimization problems; however, they need not be solved to optimality. It is found that the columns in the column generation approach can be efficiently generated by random sampling. The number of scenarios generated matches a lower bound of Tchakaloff's. The rate of convergence of the approximation error is established for continuous integrands, and an improved bound is given for smooth integrands. Extensive numerical experiments are presented in which variants of the proposed method are compared to Monte Carlo and quasi-Monte Carlo methods on both numerical integration problems and stochastic optimization problems. The benefits of being able to match any prescribed set of moments, rather than all moments up to a certain order, is also demonstrated using optimization problems with 100-dimensional random vectors. Here, empirical results show that the proposed approach outperforms Monte Carlo and quasi-Monte Carlo based approaches on the tested problems.

97 MATHEMATICS AND COMPUTING↗

Generative Ensemble Regression: Learning Particle Dynamics from Observations of Ensembles with Physics-informed Deep Generative Models

Here, we propose a new method for inferring the governing stochastic ordinary differential equations (SODEs) by observing particle ensembles at discrete and sparse time instants, i.e., multiple “snapshots.” Particle coordinates at a single time instant, possibly noisy or truncated, are recorded in each snapshot but are unpaired across the snapshots. By training a physics-informed generative model that generates “fake” sample paths, we aim to fit the observed particle ensemble distributions with a curve in the probability measure space, which is induced from the inferred particle dynamics. We employ different metrics to quantify the differences between distributions, e.g., the sliced Wasserstein distances and the adversarial losses in generative adversarial networks. We refer to this method as generative “ensemble-regression” (GER), in analogy to the classic “point-regression,” where we infer the dynamics by performing regression in the Euclidean space. We illustrate the GER by learning the drift and diffusion terms of particle ensembles governed by SODEs with Brownian motions and Lévy processes up to 100 dimensions. We also discuss how to treat cases with noisy or truncated observations. Apart from systems consisting of independent particles, we also tackle nonlocal interacting particle systems with unknown interaction potential parameters by constructing a physics-informed loss function. Finally, we investigate scenarios of paired observations and discuss how to reduce the dimensionality in such cases by proving a convergence theorem that provides theoretical support.

97 MATHEMATICS AND COMPUTING↗

A hybrid method for hydrodynamic-kinetic flow Part I: A particle-grid method for reducing stochastic noise in kinetic regimes

In this work we present a hybrid particle-grid Monte Carlo method for the Boltzmann equation, which is characterized by a significant reduction of the stochastic noise in the kinetic regime. The hybrid method is based on a first order splitting in time to separate the transport from the relaxation step. The transport step is solved by a deterministic scheme, while a hybrid DSMC-based method is used to solve the collision step. Such a hybrid scheme is based on splitting the solution in a collisional and a non-collisional part at the beginning of the collision step, and the DSMC method is used to solve the relaxation step for the collisional part of the solution only. This is accomplished by sampling only the fraction of particles candidate for collisions from the collisional part of the solution, performing collisions as in a standard DSMC method, and then projecting the particles back onto a velocity grid to compute a piecewise constant reconstruction for the collisional part of the solution. The latter is added to a piecewise constant reconstruction of the non-collisional part of the solution, which in fact remains unchanged during the relaxation step. Numerical results show that the stochastic noise is significantly reduced at large Knudsen numbers with respect to the standard DSMC method. Indeed in this algorithm, the particle scheme is applied only on the collisional part of the solution, so only this fraction of the solution is affected by stochastic fluctuations. But since the collisional part of the solution reduces as the Knudsen number increases, stochastic noise reduces as well at large Knudsen numbers.

97 MATHEMATICS AND COMPUTING↗

Extending the computational reach of a superconducting qutrit processor

Quantum computing with qudits is an emerging approach that exploits a larger, more connected computational space, providing advantages for many applications, including quantum simulation and quantum error correction. Nonetheless, qudits are typically afflicted by more complex errors and suffer greater noise sensitivity which renders their scaling difficult. In this work, we introduce techniques to tailor arbitrary qudit Markovian noise to stochastic Weyl–Heisenberg channels and mitigate noise that commutes with our Clifford and universal two-qudit gate in generic qudit circuits. We experimentally demonstrate these methods on a superconducting transmon qutrit processor, and benchmark their effectiveness for multipartite qutrit entanglement and random circuit sampling, obtaining up to 3× improvement in our results. To the best of our knowledge, this constitutes the first-ever error mitigation experiment performed on qutrits. Our work shows that despite the intrinsic complexity of manipulating higher-dimensional quantum systems, noise tailoring and error mitigation can significantly extend the computational reach of today’s qudit processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Studying rare nonadiabatic dynamics with transition path sampling quantum jump trajectories

We present a method to study rare nonadiabatic dynamics in open quantum systems using transition path sampling and quantum jump trajectories. As with applications of transition path sampling to classical dynamics, the method does not rely on prior knowledge of transition states or reactive pathways and thus can provide mechanistic insight into ultrafast relaxation processes in addition to their associated rates. In particular, we formulate a quantum path ensemble using the stochastic realizations of an unravelled quantum master equation, which results in trajectories that can be conditioned on starting and ending in particular quantum states. Because the dynamics rigorously obeys detailed balance, rate constants can be evaluated from reversible work calculations in this conditioned ensemble, allowing for branching ratios and yields to be computed in an unbiased manner. We illustrate the utility of this method with three examples: energy transfer in a donor-bridge-acceptor model, and models of photo-induced proton-coupled electron transfer and thermally activated electron transfer. These examples demonstrate the efficacy of path ensemble methods and pave the way for their use in studying complex reactive quantum dynamics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An Online Approach to Solve the Dynamic Vehicle Routing Problem with Stochastic Trip Requests for Paratransit Services

Many transit agencies operating paratransit and microtransit services have to respond to trip requests that arrive in real-time, which entails solving hard combinatorial and sequential decision-making problems under uncertainty. To avoid decisions that lead to significant inefficiency in the long term, vehicles should be allocated to requests by optimizing a non-myopic utility function or by batching requests together and optimizing a myopic utility function. While the former approach is typically offline, the latter can be performed online. We point out two major issues with such approaches when applied to paratransit services in practice. First, it is difficult to batch paratransit requests together as they are temporally sparse. Second, the environment in which transit agencies operate changes dynamically (e.g., traffic conditions can change over time), causing the estimates that are learned offline to become stale. To address these challenges, we propose a fully online approach to solve the dynamic vehicle routing problem (DVRP) with time windows and stochastic trip requests that is robust to changing environmental dynamics by construction. We focus on scenarios where requests are relatively sparse—our problem is motivated by applications to paratransit services. We formulate DVRP as a Markov decision process and use Monte Carlo tree search to evaluate actions for any given state. Accounting for stochastic requests while optimizing a non-myopic utility function is computationally challenging; indeed, the action space for such a problem is intractably large in practice. To tackle the large action space, we leverage the structure of the problem to design heuristics that can sample promising actions for the tree search. Our experiments using real-world data from our partner agency show that the proposed approach outperforms existing state-of-the-art approaches both in terms of performance and robustness.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Frequent ultraviolet brightenings observed in a solar active region with solar maximum mission

Observations of the temporal behavior of ultraviolet emission from bright points within an active region of the sun are reported. Frequent and rapid brightenings in Si IV and O IV line emission are seen. The observations suggest that intermittent heating events of modest amplitude are occurring at many sites within an active region. By selecting the brightest site at any given time within an active region and then sampling its behavior in detail within a 120 s interval, it is found that about two-thirds of the samples show variations of the Si IV line intensity. The brightenings typically last about 40-60 s; intensity increases of about 20-100 percent are frequently observed. The results suggest that heating due to magnetic field reconnection within an active region is proceeding almost stochastically. Events involving only a modest release of energy occur the most frequently.

Porter, J. G.↗

Monte Carlo simulation of launchsite winds at Kennedy Space Center

This paper develops and validates an easily implemented model for simulating random horizontal wind profiles over the Kennedy Space Center (KSC) at Cape Canaveral, Florida. The model is intended for use in Monte Carlo launch vehicle simulations of the type employed in mission planning, where the large number of profiles needed for statistical fidelity of such simulation experiments makes the use of actual wind measurements impractical. The model is based on measurements made at KSC and represents vertical correlations by a decaying exponential model which is parameterized via least-squares parameter optimization against the sample data. The validity of the model is evaluated by comparing two Monte Carlo simulations of an asymmetric, heavy-lift launch vehicle. In the first simulation, the measured wind profiles are used, while in the second, the wind profiles are generated using the stochastic model. The simulations indicate that the use of either the measured or simulated wind field results in similar launch vehicle performance.

Queen, Eric M.↗

New bounding and decomposition approaches for MILP investment problems: Multi-area transmission and generation planning under policy constraints

A novel two-phase bounding and decomposition approach to compute optimal and near-optimal solutions to large-scale mixed-integer investment planning problems is proposed and it considers a large number of operating subproblems, each of which is a convex optimization. Our motivating application is the planning of power transmission and generation in which policy constraints are designed to incentivize high amounts of intermittent generation in electric power systems. The bounding phase exploits Jensen’s inequality to define a lower bound, which we extend to stochastic programs that use expected-value constraints to enforce policy objectives. The decomposition phase, in which the bounds are tightened, improves upon the standard Benders’ algorithm by accelerating the convergence of the bounds. The lower bound is tightened by using a Jensen’s inequality-based approach to introduce an auxiliary lower bound into the Benders master problem. Upper bounds for both phases are computed using a sub-sampling approach executed on a parallel computer system. Numerical results show that only the bounding phase is necessary if loose optimality gaps are acceptable. But, the decomposition phase is required to attain optimality gaps. Moreover, use of both phases performs better, in terms of convergence speed, than attempting to solve the problem using just the bounding phase or regular Benders decomposition separately.

97 MATHEMATICS AND COMPUTING↗

Calculating uncertainty on K-effective with MONK10 - 14583

Criticality safety assessments require a demonstration that a particular configuration of fissile material has an adequate sub-critical margin (k-effective sufficiently below unity) to ensure that the risk of criticality under normal operation and accident conditions is acceptable. The required sub-critical margin depends upon the uncertainty in the estimated value of k-effective. The uncertainty in the calculated value of k-effective arises from a number of sources, including: manufacturing tolerances on input data to the code (affecting geometry, compositions and densities), uncertainty in the nuclear data used by the code, stochastic uncertainty resulting from Monte Carlo simulation and modelling approximations/errors, including the inevitable bugs in the software. The ANSWERS Software Service, in collaboration with industrial partners, is developing a number of techniques to better understand and quantify uncertainty on predicted values of k-effective, using MONK. The SPRUCE utility code has been developed to allow uncertainty to be estimated using sampling methods. This can include the sampling of input parameters (including dimensions, compositions and densities) from statistical distributions. It can also include sampling different nuclear data libraries. A set of nuclear data libraries has been generated for this purpose by sampling from statistical distributions that represent the uncertainties in the published nuclear data evaluated files; a set of libraries has been produced for Latin Hypercube Sampling. By varying the input data and nuclear data, separate and combined uncertainties due to manufacturing tolerances and nuclear data can be derived. By performing least squares fitting on the results it is also possible to estimate the contribution of each of the uncertain inputs and a sensitivity method in MONK can break down the nuclear data uncertainty. (authors)

42 ENGINEERING↗

A Predictive Prescription Framework for Stochastic Unit Commitment Using Boosting Ensemble Learning Algorithms

To take unit commitment (UC) decisions under uncertain load, most existing stochastic optimization (SO) frameworks adopt a generic representation of uncertainty. While load levels that materialize on a particular day are influenced by various covariates (such as the day of the week or temperature), SO frameworks typically disregard such side observations, wasting actionable information that could significantly enhance decision quality. Here, this article proposes a contextual SO (CSO) framework for UC under uncertain load, which can effectively exploit covariate observations in conjunction with a class of machine learning (ML) algorithms to improve the out-of-sample performance of UC decisions. It shows how three ML algorithms, adaptive boosting, gradient boosted trees, and extreme gradient boosting, can be used to this end, constituting the first application of these algorithms in any CSO framework. Using real-world data harvested from the New York ISO grid, we measure the out-of-sample performance of the framework in terms of total operation cost, shed load values, locational marginal prices, and total payments by the loads, against several benchmark methods proposed in the literature. The article has an online companion (Yurdakul et al.), wherein we present additional results and lay out further mathematical formulations used in this work.

42 ENGINEERING↗

Full-dispersion Monte Carlo simulation of phonon transport in micron-sized graphene nanoribbons

We simulate phonon transport in suspended graphene nanoribbons (GNRs) with real-space edges and experimentally relevant widths and lengths (from submicron to hundreds of microns). The full-dispersion phonon Monte Carlo simulation technique, which we describe in detail, involves a stochastic solution to the phonon Boltzmann transport equation with the relevant scattering mechanisms (edge, three-phonon, isotope, and grain boundary scattering) while accounting for the dispersion of all three acoustic phonon branches, calculated from the fourth-nearest-neighbor dynamical matrix. We accurately reproduce the results of several experimental measurements on pure and isotopically modified samples [S. Chen et al., ACS Nano 5, 321 (2011);S. Chen et al., Nature Mater. 11, 203 (2012); X. Xu et al., Nat. Commun. 5, 3689 (2014)]. We capture the ballistic-to-diffusive crossover in wide GNRs: room-temperature thermal conductivity increases with increasing length up to roughly 100 μm, where it saturates at a value of 5800 W/m K. This finding indicates that most experiments are carried out in the quasiballistic rather than the diffusive regime, and we calculate the diffusive upper-limit thermal conductivities up to 600 K. Furthermore, we demonstrate that calculations with isotropic dispersions overestimate the GNR thermal conductivity. Zigzag GNRs have higher thermal conductivity than same-size armchair GNRs, in agreement with atomistic calculations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Modeling and simulation of vascular tumors embedded in evolving capillary networks

Here in this work, we present a coupled 3D–1D model of solid tumor growth within a dynamically changing vascular network to facilitate realistic simulations of angiogenesis. Additionally, the model includes erosion of the extracellular matrix, interstitial flow, and coupled flow in blood vessels and tissue. We employ continuum mixture theory with stochastic Cahn–Hilliard type phase-field models of tumor growth. The interstitial flow is governed by a mesoscale version of Darcy’s law. The flow in the blood vessels is controlled by Poiseuille flow, and Starling’s law is applied to model the mass transfer in and out of blood vessels. The evolution of the network of blood vessels is orchestrated by the concentration of the tumor angiogenesis factors (TAFs); blood vessels grow towards the increasing TAFs concentrations. This process is not deterministic, allowing random growth of blood vessels and, therefore, due to the coupling of nutrients in tissue and vessels, makes the growth of tumors stochastic. We demonstrate the performance of the model by applying it to a variety of scenarios. Numerical experiments illustrate the flexibility of the model and its ability to generate satellite tumors. Simulations of the effects of angiogenesis on tumor growth are presented as well as sample-independent features of cancer.

3D–1D coupled blood flow models↗

Controlling process instability for defect lean metal additive manufacturing

The process instabilities intrinsic to the localized laser-powder bed interaction cause the formation of various defects in laser powder bed fusion (LPBF) additive manufacturing process. Particularly, the stochastic formation of large spatters leads to unpredictable defects in the as-printed parts. Here we report the elimination of large spatters through controlling laser-powder bed interaction instabilities by using nanoparticles. The elimination of large spatters results in 3D printing of defect lean sample with good consistency and enhanced properties. We reveal that two mechanisms work synergistically to eliminate all types of large spatters: (1) nanoparticle-enabled control of molten pool fluctuation eliminates the liquid breakup induced large spatters; (2) nanoparticle-enabled control of the liquid droplet coalescence eliminates liquid droplet colliding induced large spatters. The nanoparticle-enabled simultaneous stabilization of molten pool fluctuation and prevention of liquid droplet coalescence discovered here provide a potential way to achieve defect lean metal additive manufacturing.

36 MATERIALS SCIENCE↗

Impact of Spherical Inclusion Mean Chord Length and Radius Distribution on Three-Dimensional Binary Stochastic Medium Particle Transport

We describe a parallel benchmark procedure and numerical results for a three-dimensional binary stochastic medium particle transport benchmark problem. The binary stochastic medium is composed of optically thick spherical inclusions distributed in an optically thin background matrix material. We investigate three sphere mean chord lengths, three distributions for the sphere radii (constant, uniform, and exponential), and six sphere volume fractions ranging from 0.05 to 0.3. For each sampled independent material realization, we solve the associated transport problem using the Mercury Monte Carlo particle transport code. We compare the ensemble-averaged benchmark fiducial tallies of reflection from and transmission through the spatial domain as well as absorption in the spherical inclusion and background matrix materials. For the parameter values investigated, we find a significant dependence of the ensemble-averaged fiducial tallies on both sphere mean chord length and sphere volume fraction, with the most dramatic variation occurring for the transmission through the spatial domain. We find a weaker dependence of most benchmark tally quantities on the distribution describing the sphere radii, provided the sphere mean chord length used is the same in the different distributions. The exponential distribution produces larger differences from the constant distribution than the uniform distribution produces. The transmission through the spatial domain does exhibit a significant variation when an exponential radius distribution is used.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive Dynamic Event Tree in RAVEN code

RAVEN is a software tool that is focused on performing statistical analysis of stochastic dynamic systems. RAVEN has been designed in a high modular and pluggable way in order to enable easy integration of different programming languages (i.e., C++, Python) and coupling with other applications (system codes). Among the several capabilities currently present in RAVEN, there are five different sampling strategies: Monte Carlo, Latin Hyper Cube, Grid, Adaptive and Dynamic Event Tree (DET) sampling methodologies. The scope of this paper is to present a new sampling approach, currently under definition and implementation: an evolution of the DET me

Dynamic Event Tree↗

The principal component analysis method used with polynomial Chaos expansion to propagate uncertainties through critical transport problems

A critical neutron transport problem with random material properties is introduced. The total cross section and the average neutron multiplicity are assumed to be uncertain, characterized by the mean and variance with a log-normal distribution. The average neutron multiplicity and the total cross section are assumed to be uncorrected and the material properties for differing materials are also assumed to be uncorrected. The principal component analysis method is used to decompose the covariance matrix into eigenvalues and eigenvectors and then 'realizations' of the material properties can be computed. A simple Monte Carlo brute force sampling of the decomposed covariance matrix is employed to obtain a benchmark result for each test problem. In order to save computational time and to characterize the moments and probability density function of the multiplication factor the polynomial chaos expansion method is employed along with the stochastic collocation method. A Gauss-Hermite quadrature set is convolved into a multidimensional tensor product quadrature set and is successfully used to compute the polynomial chaos expansion coefficients of the multiplication factor. Finally, for a particular critical fuel pin assembly the appropriate number of random variables and polynomial expansion order are investigated. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗