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 181 records · Page 10

A Multilevel, Hierarchical Sampling Technique for Spatially Correlated Random Fields

In this paper, we propose an alternative method to generate samples of a spatially correlated random field with applications to large-scale problems for forward propagation of uncertainty. A classical approach for generating these samples is the Karhunen--Loève (KL) decomposition. However, the KL expansion requires solving a dense eigenvalue problem and is therefore computationally infeasible for large-scale problems. Sampling methods based on stochastic partial differential equations provide a highly scalable way to sample Gaussian fields, but the resulting parametrization is mesh dependent. We propose a multilevel decomposition of the stochastic field to allow for scalable, hierarchical sampling based on solving a mixed finite element formulation of a stochastic reaction-diffusion equation with a random, white noise source function. Lastly, numerical experiments are presented to demonstrate the scalability of the sampling method as well as numerical results of multilevel Monte Carlo simulations for a subsurface porous media flow application using the proposed sampling method.

97 MATHEMATICS AND COMPUTING↗

Sampling error study for rainfall estimate by satellite using a stochastic model

In a parameter study of satellite orbits, sampling errors of area-time averaged rain rate due to temporal sampling by satellites were estimated. The sampling characteristics were studied by accounting for the varying visiting intervals and varying fractions of averaging area on each visit as a function of the latitude of the grid box for a range of satellite orbital parameters. The sampling errors were estimated by a simple model based on the first-order Markov process of the time series of area averaged rain rates. For a satellite of nominal Tropical Rainfall Measuring Mission (Thiele, 1987) carrying an ideal scanning microwave radiometer for precipitation measurements, it is found that sampling error would be about 8 to 12 pct of estimated monthly mean rates over a grid box of 5 X 5 degrees. It is suggested that an observation system based on a low inclination satellite combined with a sunsynchronous satellite simultaneously might be the best candidate for making precipitation measurements from space.

Shin, Kyung-Sup↗

THE SPARSEST CLUSTERS WITH O STARS

There is much debate on how high-mass star formation varies with environment, and whether the sparsest star-forming environments are capable of forming massive stars. To address this issue, we have observed eight apparently isolated OB stars in the Small Magellanic Cloud (SMC) using Hubble Space Telescope's Advanced Camera for Surveys. Five of these objects appear as isolated stars, two of which are confirmed to be runaways. The remaining three objects are found to exist in sparse clusters, with {approx}<10 companion stars revealed, having masses of 1-4 M{sub sun}. Stochastic effects dominate in these sparse clusters, so we perform Monte Carlo simulations to explore how our observations fit within the framework of empirical, galactic cluster properties. We generate clusters using a simplistic -2 power-law distribution for either the number of stars per cluster (N{sub *}) or cluster mass (M{sub cl}). These clusters are then populated with stars randomly chosen from a Kroupa initial mass function (IMF). We find that simulations with cluster lower-mass limits of M{sub cl,lo} {>=} 20 M{sub sun} and N{sub *,lo} {>=} 40 match best with observations of SMC and Galactic OB star populations. We examine the mass ratio of the second most massive and most massive stars m{sub max,2}/m{sub max}, finding that our observations all exist below the 20th percentile of our simulated clusters. However, all of our observed clusters lie within the parameter space spanned by the simulated clusters, although some are in the lowest 5th percentile frequency. These results suggest that clusters are built stochastically by randomly sampling stars from a universal IMF with a fixed stellar upper-mass limit. In particular, we see no evidence to suggest an m{sub max}-M{sub cl} relation. Our results may be more consistent with core accretion models of star formation than with competitive accretion models, and they are inconsistent with the proposed steepening of the integrated galactic stellar initial mass function (IGIMF).

79 ASTRONOMY AND ASTROPHYSICS↗

Determining Reduced Order Models for Optimal Stochastic Reduced Order Models

The use of parameterized reduced order models(PROMs) within the stochastic reduced order model (SROM) framework is a logical progression for both methods. In this report, five different parameterized reduced order models are selected and critiqued against the other models along with truth model for the example of the Brake-Reuss beam. The models are: a Taylor series using finite difference, a proper orthogonal decomposition of the the output, a Craig-Bampton representation of the model, a method that uses Hyper-Dual numbers to determine the sensitivities, and a Meta-Model method that uses the Hyper-Dual results and constructs a polynomial curve to better represent the output data. The methods are compared against a parameter sweep and a distribution propagation where the first four statistical moments are used as a comparison. Each method produces very accurate results with the Craig-Bampton reduction having the least accurate results. The models are also compared based on time requirements for the evaluation of each model where the Meta- Model requires the least amount of time for computation by a significant amount. Each of the five models provided accurate results in a reasonable time frame. The determination of which model to use is dependent on the availability of the high-fidelity model and how many evaluations can be performed. Analysis of the output distribution is examined by using a large Monte-Carlo simulation along with a reduced simulation using Latin Hypercube and the stochastic reduced order model sampling technique. Both techniques produced accurate results. The stochastic reduced order modeling technique produced less error when compared to an exhaustive sampling for the majority of methods.

97 MATHEMATICS AND COMPUTING↗

Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization

Here, we consider unconstrained stochastic optimization problems with no available gradient information. Such problems arise in settings from derivative-free simulation optimization to reinforcement learning. We propose an adaptive sampling quasi-Newton method where we estimate the gradients using finite differences of stochastic function evaluations within a common random number framework. We develop modified versions of a norm test and an inner product quasi-Newton test to control the sample sizes used in the stochastic approximations and provide global convergence results to the neighborhood of a locally optimal solution. We present numerical experiments on simulation optimization problems to illustrate the performance of the proposed algorithm. When compared with classical zeroth-order stochastic gradient methods, we observe that our strategies of adapting the sample sizes significantly improve performance in terms of the number of stochastic function evaluations required.

97 MATHEMATICS AND COMPUTING↗

Optimal Control via Self-Generated Stochasticity

The problem of global maxima of functionals has been examined. Mathematical roots of local maxima are the same as those for a much simpler problem of finding global maximum of a multi-dimensional function. The second problem is instability even if an optimal trajectory is found, there is no guarantee that it is stable. As a result, a fundamentally new approach is introduced to optimal control based upon two new ideas. The first idea is to represent the functional to be maximized as a limit of a probability density governed by the appropriately selected Liouville equation. Then, the corresponding ordinary differential equations (ODEs) become stochastic, and that sample of the solution that has the largest value will have the highest probability to appear in ODE simulation. The main advantages of the stochastic approach are that it is not sensitive to local maxima, the function to be maximized must be only integrable but not necessarily differentiable, and global equality and inequality constraints do not cause any significant obstacles. The second idea is to remove possible instability of the optimal solution by equipping the control system with a self-stabilizing device. The applications of the proposed methodology will optimize the performance of NASA spacecraft, as well as robot performance.

Zak, Michail↗

A stochastic covariance shrinkage approach to particle rejuvenation in the ensemble transform particle filter

Rejuvenation in particle filters is necessary to prevent the collapse of the weights when the number of particles is insufficient to properly sample the high-probability regions of the state space. Rejuvenation is often implemented in a heuristic manner by the addition of random noise that widens the support of the ensemble. This work aims at improving canonical rejuvenation methodology by the introduction of additional prior information obtained from climatological samples; the dynamical particles used for importance sampling are augmented with samples obtained from stochastic covariance shrinkage. A localized variant of the proposed method is developed. Numerical experiments with the Lorenz '63 model show that modified filters significantly improve the analyses for low dynamical ensemble sizes. Furthermore, localization experiments with the Lorenz '96 model show that the proposed methodology is extendable to larger systems.

54 ENVIRONMENTAL SCIENCES↗

A Fast Monte Carlo Method for Model-Based Prognostics Based on Stochastic Calculus

This work proposes a fast Monte Carlo method to solve differential equations utilized in model-based prognostics. The methodology is derived from the theory of stochastic calculus, and the goal of such a method is to speed up the estimation of the probability density functions describing the independent variable evolution over time. In the prognostic scenarios presented in this paper, the stochastic differential equations describe variables directly or indirectly related to the degradation of a monitored system. The method allows the estimation of the probability density functions by solving the deterministic equation and approximating the stochastic integrals using samples of the model noise. By so doing, the prognostic problem is solved without the Monte Carlo simulation based on Euler's forward method, which is typically the most time consuming task of the prediction stage. Three different prognostic scenarios are presented as proof of concept: (i) life prediction of electrolytic capacitors, (ii) remaining time to discharge of Lithium-ion batteries, and (iii) prognostic of cracked structures under fatigue loading. The paper shows how the method produces probability density functions that are statistically indistinguishable from the distributions estimated with Euler's forward Monte Carlo simulation. However, the proposed solution is orders of magnitude faster when computing the time-to-failure distribution of the monitored system. The approach may enable complex real-time prognostics and health management solutions with limited computing power.

stochastic calculus↗

Hybrid nested sampling algorithm for Bayesian model selection applied to inverse subsurface flow problems

A Hybrid Nested Sampling (HNS) algorithm is proposed for efficient Bayesian model calibration and prior model selection. The proposed algorithm combines, Nested Sampling (NS) algorithm, Hybrid Monte Carlo (HMC) sampling and gradient estimation using Stochastic Ensemble Method (SEM). NS is an efficient sampling algorithm that can be used for Bayesian calibration and estimating the Bayesian evidence for prior model selection. Nested sampling has the advantage of computational feasibility. Within the nested sampling algorithm, a constrained sampling step is performed. For this step, we utilize HMC to reduce the correlation between successive sampled states. HMC relies on the gradient of the logarithm of the posterior distribution, which we estimate using a stochastic ensemble method based on an ensemble of directional derivatives. SEM only requires forward model runs and the simulator is then used as a black box and no adjoint code is needed. The developed HNS algorithm is successfully applied for Bayesian calibration and prior model selection of several nonlinear subsurface flow problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Improving the sampling efficiency of the Grand Canonical Simulated Quenching approach

Most common atomistic simulation techniques, like molecular dynamics or Metropolis Monte Carlo, operate under a constant interatomic Hamiltonian with a fixed number of atoms. Internal (atom positions or velocities) or external (simulation cell size or geometry) variables are then evolved dynamically or stochastically to yield sampling in different ensembles, such as microcanonical (NVE), canonical (NVT), isothermal-isobaric (NPT), etc. Averages are then taken to compute relevant physical properties. At least two limitations of these standard approaches can seriously hamper their application to many important systems: (1) they do not allow for the exchange of particles with a reservoir, and (2) the sampling efficiency is insufficient to allow the obtention of converged results because of the very long intrinsic timescales associated with these quantities. To fix ideas, one might want to identify low (free) energy configurations of grain boundaries (GB). In reality, grain boundaries are in contact the grains which act as reservoirs of defects (e.g., vacancies and interstitials). Since the GB can exchange particles with its environment, the most stable configuration cannot provably be found by sampling from NVE or NVT ensembles alone: one needs to allow the number of atoms in the sample to fluctuate. The first limitation can be circumvented by working in the grand canonical ensemble (TV ) or its derivatives (such as the semi-grand-canonical ensemble useful for the study of substitutional alloys). Monte Carlo methods have been the first to adapt to this kind of system where the number of atoms is allowed to fluctuate. Many of these methods are based on the Widom insertion method [Widom63] where the chemical potential of a given chemical species can be inferred from the potential energy changes upon random insertion of a new particle within the simulation cell. Other techniques, such as the Gibbs ensemble Monte Carlo [Panagiotopoulos87] where exchanges of particles are attempted to equilibrate the chemical potential between two cells and hence allow for the calculation of coexistence curves, exploit the same idea: particle insertion (or exchange) is attempted and accepted with a Metropolis-like rule that depends exponentially on the energy change upon insertion. A well known limitation of this kind of approach is that the probability of accepting such a move decreases extremely rapidly with increasing density, due to the extremely large short-range repulsion between atoms. In response to these difficulties it became apparent that a solution to the problem might be to avoid abrupt insertions but instead to proceed gradually, so as to allow the system to react and make way for the incoming particle. In this view of things, the 'occupation' of a certain atomic site can be viewed as a continuous variable, ranging between 0 and 1, representing 'how much' of the particle is present at any given time. These ideas proved ideal in Molecular Dynamics (MD) settings because equations of motions for these occupation variables can sometimes be obtained. For example, in the case of Grand Canonical Molecular Dynamics [Cagin91], one special particle is allowed to have a fractional occupation. This can lead to either its destruction (occupation = 0) or its complex creation (occupation = 1) so as to enforce a given chemical potential. These approaches proved useful, but mostly in the liquid state where the probability of successfully inserting a new particle is sufficiently high. At higher densities, convergence proved to be hampered by very inefficient sampling. In this work, we explore the use of a related MD-based grand canonical technique, the Grand Canonical Simulated Quenching (GCSQ) of Phillpot and Rickman [Phillpot92,Phillpot94], and explore its application to the grand canonical sampling of solid state systems. We show that, in conjunction with advanced sampling techniques, GCSQ can be a useful tool to sample conformations of complex systems, such as GBs, and assist in the identification of their most stable states and/or most likely defective states.

36 MATERIALS SCIENCE↗

Local polynomial chaos expansion for linear differential equations with high dimensional random inputs

In this paper we present a localized polynomial chaos expansion for partial differential equations (PDE) with random inputs. In particular, we focus on time independent linear stochastic problems with high dimensional random inputs, where the traditional polynomial chaos methods, and most of the existing methods, incur prohibitively high simulation cost. Furthermore, the local polynomial chaos method employs a domain decomposition technique to approximate the stochastic solution locally. In each subdomain, a subdomain problem is solved independently and, more importantly, in a much lower dimensional random space. In a postprocesing stage, accurate samples of the original stochastic problems are obtained from the samples of the local solutions by enforcing the correct stochastic structure of the random inputs and the coupling conditions at the interfaces of the subdomains. Overall, the method is able to solve stochastic PDEs in very large dimensions by solving a collection of low dimensional local problems and can be highly efficient. In our paper we present the general mathematical framework of the methodology and use numerical examples to demonstrate the properties of the method.

97 MATHEMATICS AND COMPUTING↗

Stochastic room temperature creep of 316 L stainless steel

The creep behavior of 316 L stainless steel at room temperature was evaluated as a function of time and applied stress using a new high-throughput approach. Several common creep models were evaluated against the observations, leading to deeper analysis of a stress-dependent modified logarithmic creep model. Within this model, multiple sources of uncertainty were compared. Aleatoric stochastic variation between samples under nominally identical conditions was identified as the primary contributor to uncertainty in creep response. Under any particular set of conditions, the sample-to-sample variability in creep strain was as high as a factor of two, highlighting the engineering importance of characterizing large statistical datasets. The model's extrapolation capabilities were assessed by comparing predictions derived from calibration on partial, shorter-duration subsets of the data. In conclusion, these findings underscore the importance of accounting for stochastic effects in predictive modeling of aging phenomena.

High-throughput↗