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 271 records · Page 15

Adaptive hybrid simulations for multiscale stochastic reaction networks

The probability distribution describing the state of a Stochastic Reaction Network (SRN) evolves according to the Chemical Master Equation (CME). It is common to estimate its solution using Monte Carlo methods such as the Stochastic Simulation Algorithm (SSA). In many cases, these simulations can take an impractical amount of computational time. Therefore, many methods have been developed that approximate sample paths of the underlying stochastic process and estimate the solution of the CME. A prominent class of these methods include hybrid methods that partition the set of species and the set of reactions into discrete and continuous subsets. Such a partition separates the dynamics into a discrete and a continuous part. Simulating such a stochastic process can be computationally much easier than simulating the exact discrete stochastic process with SSA. Moreover, the quasi-stationary assumption to approximate the dynamics of fast subnetworks can be applied for certain classes of networks. However, as the dynamics of a SRN evolves, these partitions may have to be adapted during the simulation. We develop a hybrid method that approximates the solution of a CME by automatically partitioning the reactions and species sets into discrete and continuous components and applying the quasi-stationary assumption on identifiable fast subnetworks. Our method does not require any user intervention and it adapts to exploit the changing timescale separation between reactions and/or changing magnitudes of copy-numbers of constituent species. We demonstrate the efficiency of the proposed method by considering examples from systems biology and showing that very good approximations to the exact probability distributions can be achieved in significantly less computational time. This is especially the case for systems with oscillatory dynamics, where the system dynamics change considerably throughout the time-period of interest.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Wind power prediction models

Investigations were performed to predict the power available from the wind at the Goldstone, California, antenna site complex. The background for power prediction was derived from a statistical evaluation of available wind speed data records at this location and at nearby locations similarly situated within the Mojave desert. In addition to a model for power prediction over relatively long periods of time, an interim simulation model that produces sample wind speeds is described. The interim model furnishes uncorrelated sample speeds at hourly intervals that reproduce the statistical wind distribution at Goldstone. A stochastic simulation model to provide speed samples representative of both the statistical speed distributions and correlations is also discussed.

Levy, R.↗

Signal analysis of NEMS sensors at the output of a chromatography column

This article introduces a joined Bayesian estimation of gas samples issued from a gas chromatography column (GC) coupled with a NEMS sensor based on Giddings Eyring microscopic molecular stochastic model. The posterior distribution is sampled using a Monte Carlo Markov Chain and Gibbs sampling. Parameters are estimated using the posterior mean. This estimation scheme is finally applied on simulated and real datasets using this molecular stochastic forward model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ESTIMATING BLACK HOLE MASSES IN HUNDREDS OF QUASARS

We explore the practical feasibility of active galactic nucleus (AGN) broadband reverberation mapping and present first results. We lay out and apply a rigorous approach for the stochastic reverberation mapping of unevenly sampled multi-broadband flux measurements, assuming that the broad-line region (BLR) line flux is contributing up to 15% in some bands, and is directly constrained by one spectroscopical epoch. The approach describes variations of the observed flux as the continuum, modeled as a stochastic Gaussian process, and emission line contribution, modeled as a scaled, smoothed, and delayed version of the continuum. This approach can be used not only to interpolate in time between measurements, but also to determine confidence limits on continuum—line emission delays. This approach is applied to Sloan Digital Sky Survey observations in Stripe 82 (S82), providing flux measurements that are precise to 2% at ∼60 epochs over ∼10 yr. The strong annual variations in the epoch sampling prove a serious limitation in practice. In addition, suitable redshift ranges must be identified where strong, broad emission lines contribute to one filter, but not to another. By generating and evaluating problem-specific mock data, we verify that S82-like data can constrain τ{sub delay} for a simple transfer function model. In application to real data, we estimate τ{sub delay} for 323 AGNs with 0.225 < z < 0.846, combining information for different objects through the ensemble-scaling relationships for BLR size and black hole mass. Our analysis tentatively indicates a 1.7 times larger BLR size of Hα and Mg II compared to Kaspi et al. and Vestergaard, but the seasonal data sampling casts doubt on the robustness of the inference.

79 ASTRONOMY AND ASTROPHYSICS↗

Semi-stochastic full configuration interaction quantum Monte Carlo: Developments and application

We expand upon the recent semi-stochastic adaptation to full configuration interaction quantum Monte Carlo (FCIQMC). We present an alternate method for generating the deterministic space without a priori knowledge of the wave function and present stochastic efficiencies for a variety of both molecular and lattice systems. The algorithmic details of an efficient semi-stochastic implementation are presented, with particular consideration given to the effect that the adaptation has on parallel performance in FCIQMC. We further demonstrate the benefit for calculation of reduced density matrices in FCIQMC through replica sampling, where the semi-stochastic adaptation seems to have even larger efficiency gains. We then combine these ideas to produce explicitly correlated corrected FCIQMC energies for the beryllium dimer, for which stochastic errors on the order of wavenumber accuracy are achievable.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Using intrusive approaches as a step towards accounting for stochasticity in wind turbine design

Current wind turbine design methods require tens of thousands of time-domain simulations and use different random seeds to account for the stochasticity of the environmental conditions. The account of stochasticity is nonintrusive because the sampling method calls a deterministic model multiple times without changing its underlying equations. In this work, we investigate and demonstrate using simple proof of concepts how intrusive approaches can be used to directly account for stochasticity in the equations representing a mechanical system. Our long term goal is to apply such methodology to the design of wind turbines without requiring an excessive number of simulations. Intrusive methods manipulate stochastic variables directly to provide the probability density functions (PDFs) of the states and outputs at any time as functions of the PDFs of the inputs. We illustrate how different methods can be used with a reduced-order model of a wind turbine with one degree of freedom and for linear and nonlinear models. We discuss how the methods can be extended and what it will take to apply them to a level of fidelity similar to current state-of-the-art wind turbine design tools.

17 WIND ENERGY↗

Windowed multipole representation of R -matrix cross sections

Nuclear cross sections are basic inputs to any nuclear computation. Campaigns of experiments are fitted with the parametric R-matrix model of quantum nuclear interactions, and the resulting cross sections are documented—both pointwise and as resonance parameters (with uncertainties)—in standard evaluated nuclear data libraries (ENDF, JEFF, BROND, JENDL, CENDL, TENDL): these constitute our common knowledge of fundamental low-energy nuclear cross sections. In the past decade, a collaborative effort has been deployed to establish a new nuclear cross-section library format—the Windowed Multipole Library—with the goal of considerably reducing the computational cost of cross-section calculations in nuclear transport simulations. This work lays the theoretical foundations underpinning these efforts. From general R-matrix scattering theory, we derive the windowed multipole representation of nuclear cross sections. Though physically and mathematically equivalent to R-matrix cross sections, the windowed multipole representation is particularly well suited for subsequent temperature treatment of angle-integrated cross sections, in particular Doppler broadening, which is the averaging of cross sections over the thermal motion of the target atoms. Doppler broadening is of critical importance in neutron transport applications, as it ensures the stability of many nuclear reactors (negative thermal reactivity). Yet, Doppler broadening of nuclear cross sections has been a considerable bottleneck for nuclear transport computations, often requiring memory-costly pretabulations. We show that the windowed multipole representation can perform accurate Doppler broadening analytically (up to the first reaction threshold), from which we derive cross-section temperature derivatives to any order—all computable on the fly (without precalculations stored in memory). Furthermore, we here establish a way of converting the R-matrix resonance parameters uncertainty (covariance matrices) into windowed multipole parameters uncertainty. We show that generating stochastic nuclear cross sections by sampling from the resulting windowed multipole covariance matrix can reproduce the cross-section uncertainty in the original nuclear data file. The windowed multipole representation is therefore a novel nuclear physics formalism able to generate Doppler broadened stochastic nuclear cross sections on the fly, unlocking breakthrough computational gains for nuclear computations. Through this foundational paper, we hope to make the windowed multipole representation accessible, reproducible, and usable for the nuclear physics community, as well as provide the theoretical basis for future research on expanding its capabilities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Monte Carlo goodness-of-fit tests for degree corrected and related stochastic blockmodels

Abstract We construct Bayesian and frequentist finite-sample goodness-of-fit tests for three different variants of the stochastic blockmodel for network data. Since all of the stochastic blockmodel variants are log-linear in form when block assignments are known, the tests for the latent block model versions combine a block membership estimator with the algebraic statistics machinery for testing goodness-of-fit in log-linear models. We describe Markov bases and marginal polytopes of the variants of the stochastic blockmodel and discuss how both facilitate the development of goodness-of-fit tests and understanding of model behaviour. The general testing methodology developed here extends to any finite mixture of log-linear models on discrete data, and as such is the first application of the algebraic statistics machinery for latent-variable models.

Karwa, Vishesh↗

Kernel Density Estimators for SAMPLER Analyses [Slides]

This presentation discusses Sampler, specifically in terms of uncertainty quantification and states that for many simulation tasks nominal input parameters have complicated influence on the uncertainty in the final result. Sampler provides a convenient means to perform stochastic uncertainty quantification, brute force sampling parameter space and tallying changes in outputs, and it can be coupled with any SCALE modules. Perturbed responses can be collected and analyzed with standard statistical measures; however, two problems have been identified. The first problem is that for Monte Carlo simulations the individual response uncertainties are ignored, and the second problem is that features of distributions are easily hidden in histograms. They found that the solution is to add Kernel Density Estimator (KDE) analysis to the Sampler output. In conclusion, Sampler is a unique tool for stochastic uncertainty propagation, and it can be coupled with any module in SCALE. Current functionality is limited to histograms, and it may not adequately account for sample uncertainties and/or not adequately display underlying distribution features. Work is in progress to implement KDE in the Sampler module and no additional flagging is needed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Efficient Uncertainty Quantification in Stochastic Economic Dispatch

Stochastic economic dispatch models usually address uncertainties in forecasts of renewable generation output by considering a finite number of realizations drawn from a stochastic process model, typically via Monte Carlo sampling. Accurate evaluations of expectations or higher order moments for quantities of interest, e.g., generating cost, can require a prohibitively large number of samples. We propose an alternative to Monte Carlo sampling based on polynomial chaos expansions. These representations enable efficient and accurate propagation of uncertainties in model parameters, using sparse quadrature methods. Furthermore, we use Karhunen-Loève expansions for efficient representation of uncertain renewable energy generation that follows geographical and temporal correlations derived from historical data at each wind farm. Considering expected production cost, we show that the proposed approach can yield several orders of magnitude reduction in computational cost for solving stochastic economic dispatch relative to Monte Carlo sampling, for a given target error threshold.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Sampling errors for satellite-derived tropical rainfall - Monte Carlo study using a space-time stochastic model

Estimates of monthly average rainfall based on satellite observations from a low earth orbit will differ from the true monthly average because the satellite observes a given area only intermittently. This sampling error inherent in satellite monitoring of rainfall would occur even if the satellite instruments could measure rainfall perfectly. The size of this error is estimated for a satellite system being studied at NASA, the Tropical Rainfall Measuring Mission (TRMM). First, the statistical description of rainfall on scales from 1 to 1000 km is examined in detail, based on rainfall data from the Global Atmospheric Research Project Atlantic Tropical Experiment (GATE). A TRMM-like satellite is flown over a two-dimensional time-evolving simulation of rainfall using a stochastic model with statistics tuned to agree with GATE statistics. The distribution of sampling errors found from many months of simulated observations is found to be nearly normal, even though the distribution of area-averaged rainfall is far from normal. For a range of orbits likely to be employed in TRMM, sampling error is found to be less than 10 percent of the mean for rainfall averaged over a 500 x 500 sq km area.

Bell, Thomas L.↗

Stochastic Gradients for Large-Scale Tensor Decomposition

Tensor decomposition is a well-known tool for multiway data analysis. This work proposes using stochastic gradients for efficient generalized canonical polyadic (GCP) tensor decomposition of large-scale tensors. GCP tensor decomposition is a recently proposed version of tensor decomposition that allows for a variety of loss functions such as Bernoulli loss for binary data or Huber loss for robust estimation. Here, the stochastic gradient is formed from randomly sampled elements of the tensor and is efficient because it can be computed using the sparse matricized-tensor times Khatri--Rao product tensor kernel. For dense tensors, we simply use uniform sampling. For sparse tensors, we propose two types of stratified sampling that give precedence to sampling nonzeros. Numerical results demonstrate the advantages of the proposed approach and its scalability to large-scale problems.

97 MATHEMATICS AND COMPUTING↗

Importance sampling variance reduction for the Fokker–Planck rarefied gas particle method

The Fokker–Planck approximation to the Boltzmann equation, solved numerically by stochastic particle schemes, is used to provide estimates for rarefied gas flows. This paper presents a variance reduction technique for a stochastic particle method that is able to greatly reduce the uncertainty of the estimated flow fields when the characteristic speed of the flow is small in comparison to the thermal velocity of the gas. The method relies on importance sampling, requiring minimal changes to the basic stochastic particle scheme. We test the importance sampling scheme on a homogeneous relaxation, planar Couette flow and a lid-driven-cavity flow, and find that our method is able to greatly reduce the noise of estimated quantities. Significantly, we find that as the characteristic speed of the flow decreases, the variance of the noisy estimators becomes independent of the characteristic speed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Probability Density Function Control for Stochastic Nonlinear Systems using Monte Carlo Simulation

This paper presents a fast implementation framework of output probability density function (PDF) control for a class of stochastic nonlinear systems which are subjected to non-Gaussian noises. The statistical properties of the system outputs can be adjusted by shaping the dynamic output probability density function to track the reference stochastic distribution. However, the dynamic probability density function evolution is very difficult to obtain analytically even if the system model and the stochastic distributions of the noises are known. Motivated by Monte Carlo simulation, the dynamic probability density function can be estimated by sampling data which forms the contribution of this paper. In particular, the sampling points are generated following the stochastic distribution of the noise for each instant. These points go through the system would generate the histogram for system outputs, then the dynamic model can be established based on the dynamic histogram which reflects the randomness and the nonlinear dynamics of the investigated system. Based on the established model, the output probability density function tracking can be achieved and the simulation results and discussions show the effectiveness and benefits of the presented framework.

Zhang, Qichun↗

Scalable Techniques for Stochastic Power Flow Problems (Final Report)

The proposed research focuses on developing scalable algorithms for two-stage security-constrained OPF problems with AC power flow constraints, a class of problems complicated by (i) scale arising from a scenario representation; and (ii) the presence of nonlinearity, nonconvexity, and possibly second-stage discreteness or complementarity. Unfortunately, most existing solvers cannot contend with both challenges simultaneously; accordingly, the proposed research focuses on developing solution techniques that can both scale with the number of scenarios and contend with nonconvexity and second-stage complementarity. We consider three avenues for addressing such problems: (i) Variable sample-size SQP (VS-SQP) methods that combine sparse Quasi-Newton updates with a scalable variance-reduced stochastic gradient scheme for stochastic QP subproblems, allowing for contending with second-stage complementarity via regularization; (ii) Variable sample-size stochastic Interior-point (VS-sIP) schemes that propose a sampling-based regularized (to allow for contending with complementarity) interior-point schemes in which a Schur-complement technique is employed for decomposing the Newton direction computation step; (iii) Variable sample-size tractable ADMM (VS-tADMM) schemes combine variable sample-sizes with carefully designed techniques for resolving each of the nonconvex updates (by leveraging the QCQP structures). We intend to compare the three schemes using performance profiles in terms of solution quality, scalability, etc. and then select one scheme which will then be developed and further refined in Python for purposes of the GO competition.

42 ENGINEERING↗

Role of atomistic structure in the stochastic nature of conductivity in substoichiometric tantalum pentoxide

First-principles calculations of electrical conductivity (σ{sub o}) are revisited to determine the atomistic origin of its stochasticity in a distribution generated from sampling 14 ab-initio molecular dynamics configurations from 10 independently quenched models (n = 140) of substoichiometric amorphous Ta{sub 2}O{sub 5}, where each structure contains a neutral O monovacancy (V{sub O}{sup 0}). Structural analysis revealed a distinct minimum Ta-Ta separation (dimer/trimer) corresponding to each V{sub O}{sup 0} location. Bader charge decomposition using a commonality analysis approach based on the σ{sub o} distribution extremes revealed nanostructural signatures indicating that both the magnitude and distribution of cationic charge on the Ta subnetwork have a profound influence on σ{sub o}. Furthermore, visualization of local defect structures and their electron densities reinforces these conclusions and suggests σ{sub o} in the amorphous oxide is best suppressed by a highly charged, compact Ta cation shell that effectively screens and minimizes localized V{sub O}{sup 0} interaction with the a-Ta{sub 2}O{sub 5} network; conversely, delocalization of V{sub O}{sup 0} corresponds to metallic character and high σ{sub o}. The random network of a-Ta{sub 2}O{sub 5} provides countless variations of an ionic configuration scaffold in which small perturbations affect the electronic charge distribution and result in a fixed-stoichiometry distribution of σ{sub o}; consequently, precisely controlled and highly repeatable oxide fabrication processes are likely paramount for advancement of resistive memory technologies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Enabling probabilistic learning on manifolds through double diffusion maps

Here, we present a generative learning framework for probabilistic sampling that extends Probabilistic Learning on Manifolds (PLoM), which is designed to generate statistically consistent realizations of a random vector in a finite-dimensional Euclidean space, informed by a (representative) set of observations. In its original form, PLoM constructs a reduced-order probabilistic model by combining three main components: (a) kernel density estimation to approximate the underlying probability measure, (b) Diffusion Maps to characterize the manifold of the data, and (c) a reduced-order Itô Stochastic Differential Equation (ISDE) to sample from the learned distribution. However, its sampling dynamics are posed in the ambient space and the retained number of reduced coordinates is chosen by projection-reconstruction error. In practice, this often (i) requires more coordinates than the data’s intrinsic dimension to achieve stable sampling and (ii) lacks a smooth, basis-independent lifting back to the data domain; moreover, standard Diffusion Maps emphasize harmonic eigenfunctions and can miss non-harmonic latent structure. We address these limitations by decoupling geometry learning from sampling: a first Diffusion Maps pass identifies non-harmonic coordinates on which we formulate a full-order ISDE directly in the latent space, while Double Diffusion Maps captures multiscale geometric features and Geometric Harmonics (GH) learns a smooth lifting map to the ambient variables that is independent of the particular diffusion basis. This hybrid design preserves the system’s dynamical richness with a compact geometric representation and enables principled out-of-sample inference. The effectiveness and robustness of the proposed method are illustrated through two numerical studies: one based on data generated from two-dimensional Hermite polynomial functions and another based on high-fidelity simulations of a detonation wave in a reactive flow.

Double diffusion maps↗