Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic methods”

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 433 records · Page 24

A stochastic mixed finite element heterogeneous multiscale method for flow in porous media

A computational methodology is developed to efficiently perform uncertainty quantification for fluid transport in porous media in the presence of both stochastic permeability and multiple scales. In order to capture the small scale heterogeneity, a new mixed multiscale finite element method is developed within the framework of the heterogeneous multiscale method (HMM) in the spatial domain. This new method ensures both local and global mass conservation. Starting from a specified covariance function, the stochastic log-permeability is discretized in the stochastic space using a truncated Karhunen-Loeve expansion with several random variables. Due to the small correlation length of the covariance function, this often results in a high stochastic dimensionality. Therefore, a newly developed adaptive high dimensional stochastic model representation technique (HDMR) is used in the stochastic space. This results in a set of low stochastic dimensional subproblems which are efficiently solved using the adaptive sparse grid collocation method (ASGC). Numerical examples are presented for both deterministic and stochastic permeability to show the accuracy and efficiency of the developed stochastic multiscale method.

97 MATHEMATICS AND COMPUTING↗

Application of adaptive hierarchical sparse grid collocation to the uncertainty quantification of nuclear reactor simulators

Recent efforts in the application of uncertainty quantification to nuclear systems have utilized methods based on generalized perturbation theory and stochastic sampling. While these methods have proven to be effective they both have major drawbacks that may impede further progress. A relatively new approach based on spectral elements for uncertainty quantification is applied in this paper to several problems in reactor simulation. Spectral methods based on collocation attempt to couple the approximation free nature of stochastic sampling methods with the determinism of generalized perturbation theory. The specific spectral method used in this paper employs both the Smolyak algorithm and adaptivity by using Newton-Cotes collocation points along with linear hat basis functions. Using this approach, a surrogate model for the outputs of a computer code is constructed hierarchically by adaptively refining the collocation grid until the interpolant is converged to a user-defined threshold. The method inherently fits into the framework of parallel computing and allows for the extraction of meaningful statistics and data that are not within reach of stochastic sampling and generalized perturbation theory. This paper aims to demonstrate the advantages of spectral methods-especially when compared to current methods used in reactor physics for uncertainty quantification-and to illustrate their full potential. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Calculation of Dynamical Response Functions Using a Bound-State Method

Abstract We investigate a method to extract response functions (dynamical polarisabilities) directly from a bound-state approach applied to calculations of perturbation-induced reactions. The use of a square-integrable basis leads to a response in the form of a sum of $$\delta $$ δ functions. We integrate this over energy and fit a smooth function to the resulting stepwise-continuous one. Its derivative gives the final approximation to the physical response function. We show that the method reproduces analytical results where known, and analyse the details for a variety of models. We apply it to some simple models, using the stochastic variational method as the numerical method. Albeit we find that this approach, and other numerical techniques, have some difficulties with the threshold behavior in coupled-channel problems with multiple thresholds, its stochastic nature allows us to extract robust results even for such cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient gradient estimation using finite differencing and likelihood ratios for kinetic Monte Carlo simulations

While many optimization and control methods for stochastic processes require gradient information from the process of interest, obtaining gradient information from experiments is prohibitively expensive and time-consuming. As a result, such information is often obtained from stochastic process simulations. Computing gradients efficiently and accurately from stochastic simulations is challenging, especially for simulations involving computationally expensive models with significant inherent noise. In this work, we analyze and characterize the applicability of two gradient estimation methods for kinetic Monte Carlo simulations: finite differencing and likelihood ratio. We developed a systematic method for choosing an optimal perturbation size for finite differencing and discuss, for both methods, important implementation issues such as scaling with respect to the number of elements in the gradient vector. Through a series of numerical experiments, the methods were compared across different time and size regimes to characterize the precision and accuracy associated with each method. We determined that the likelihood ratio method is appropriate for estimating gradients at short (transient) times or for systems with small population sizes, whereas finite differencing is better-suited for gradient estimation at long times (steady state) or for systems with large population sizes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the evaluation of expected performance cost for partially observed closed-loop stochastic systems

New methods are presented for evaluating the expected performance cost of partially observed closed-loop stochastic systems. When the variances of the process statistics are small, a linearized model of the closed-loop stochastic system is defined for which the expected cost can be evaluated by recursion on a set of purely deterministic difference equations. When the variances of the process statistics are large, the linearized model can be used in the control variate method of variance reduction for reducing the number of sample paths required for effective Monte Carlo estimation.

Bayard, D. S.↗

Planning to fail: mission design for modular repairable robot teams

This paper presents a method using stochastic simulation to evaluate the reliability of robot teams consisting of modular robots. For an example planetary exploration mission we use this method to compare the performance of a repairable robot team with spare modules versus nonrepairable robot teams.

mission planning↗

Two critical issues in Langevin simulation of gas flows

A stochastic algorithm based on the Langevin equation has been recently proposed to simulate rarefied gas flows. Compared with the direct simulation Monte Carlo (DSMC) method, the Langevin method is more efficient in simulating small Knudsen number flows. While it is well-known that the cell sizes and time steps should be smaller than the mean free path and the mean collision time, respectively, in DSMC simulations, the Langevin equation uses a drift term and a diffusion term to describe molecule movements, so no direct molecular collisions have to be modeled. This enables the Langevin simulation to proceed with a much larger time step than that in the DSMC method. Two critical issues in Langevin simulation are addressed in this paper. The first issue is how to reproduce the transport properties as that described by kinetic theory. Transport coefficients predicted by Langevin equation are obtained by using Green-Kubo formulae. The second issue is numerical scheme with boundary conditions. We present two schemes corresponding to small time step and large time step, respectively. For small time step, the scheme is similar to DSMC method as the update of positions and velocities are uncoupled; for large time step, we present an analytical solution of the hitting time, which is the crucial factor for accurate simulation. Velocity-Couette flow, thermal-Couette flow, Rayleigh-Bénard flow and wall-confined problem are simulated by using these two schemes. Our study shows that Langevin simulation is a promising tool to investigate small Knudsen number flows.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic quantization of real-time thermal field theory

We use the stochastic quantization method to obtain the free scalar propagator of a finite temperature field theory formulated in the Minkowski space-time. First, we use the Markovian stochastic quantization approach to present the two-point function of the theory. Second, we assume a Langevin equation with a memory kernel and a colored noise. The convergence of the Markovian and non-Markovian stochastic processes in the asymptotic limit of the fictitious time is obtained. Our formalism can be the starting point to discuss systems at finite temperature out of equilibrium.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Exploring Heterogeneous Multicore Architectures for Advanced Embedded Uncertainty Quantification

We explore rearrangements of classical uncertainty quantification methods with the aim of achieving higher aggregate performance for uncertainty quantification calculations on emerging multicore and many core architectures. We show a rearrangement of the stochastic Galerkin method leads to improved performance and scalability on several computational architectures whereby uncertainty information is propagated at the lowest levels of the simulation code improving memory access patterns, exposing new dimensions of fine grained parallelism, and reducing communication. We also develop a general framework for implementing such rearrangements for a diverse set of uncertainty quantification algorithms as well as computational simulation codes to which they are applied.

97 MATHEMATICS AND COMPUTING↗

Progress Report on Computing Excited-State Hadron Masses in Lattice QCD

Our progress in computing the spectrum of excited baryons and mesons in lattice QCD is described. Sets of spatially-extended hadron operators with a variety of different momenta are used. A new method of stochastically estimating the low-lying effects of quark propagation is utilized which allows reliable determinations of temporal correlations of both single-hadron and multi-hadron operators. The method is tested on the isoscalar mesons in the scalar, pseudoscalar, and vector channels, and on the two-pion system of total isospin I = 0,1,2.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Data-Driven Preemptive Voltage Monitoring and Control Using Probabilistic Voltage Sensitivities

Increased penetration levels of distributed variable renewable generation can cause random voltage fluctuations and violations at multiple nodes. Traditional methods of voltage control typically involve reactionary responses of capacitor banks, tap changers, and recently even smart inverters. But because of the lack of foresight in voltage violations, these controls are ineffective to completely mitigate the issue. Therefore, new methods of predicting voltage violations subject to random power injection changes in the distribution network are needed, which can be used to guide optimal and dynamic methods of voltage control. This work lays the foundation for such preemptive voltage monitoring and control by proposing an analytical and sensor data-driven voltage sensitivity analysis method. Driven by stochastic data and forecasts, the method can be used to develop probabilistic voltage sensitivities and consequently to predict system nodes with high likelihood of voltage limit violations. The effectiveness of this method is tested on IEEE 69-node distribution system integrated with distributed solar. The results demonstrate the proposed method's ability to successfully predict nodes with high probability of voltage violations for a specific time-series simulation. The results also demonstrate the ability to guide timely power injection control actions to mitigate future voltage violations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Data-Driven Preemptive Voltage Monitoring and Control Using Probabilistic Voltage Sensitivities: Preprint

Increased penetration of distributed variable re-newable generation may cause random voltage fluctuations and violations at multiple nodes. Traditional methods of voltage control typically involve reactionary responses of capacitor banks, tap changers, and recently even smart inverters. But due to the lack of foresight in voltage violations, these controls are ineffective to completely mitigate the issue. Therefore, new methods of predicting voltage violations subject to random power injection changes in the distribution network is needed, which can be used to guide optimal and dynamic methods of voltage control. This work lays the foundation for such preemptive voltage monitoring and control by proposing an analytical and sensor data-driven voltage sensitivity analysis method. Driven by stochastic data and forecasts, the method can be used to develop probabilistic voltage sensitivities and consequently to predict system nodes with high likelihood of voltage limit violations. The effectiveness of this method is tested on IEEE 69 node distribution system integrated with distributed solar. The results demonstrate the proposed method's ability to successfully predict nodes with high probability of voltage violations for a specific time series simulation. The results also demonstrate the ability to guide timely power injection control actions to mitigate future voltage violations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Variance-Reduced Accelerated First-Order Methods: Central Limit Theorems and Confidence Statements

In this paper, we consider a strongly convex stochastic optimization problem and propose three classes of variable sample-size stochastic first-order methods: (i) the standard stochastic gradient descent method, (ii) its accelerated variant, and (iii) the stochastic heavy-ball method. In each scheme, the exact gradients are approximated by averaging across an increasing batch size of sampled gradients. We prove that when the sample size increases at a geometric rate, the generated estimates converge in mean to the optimal solution at an analogous geometric rate for schemes (i)–(iii). Based on this result, we provide central limit statements, whereby it is shown that the rescaled estimation errors converge in distribution to a normal distribution with the associated covariance matrix dependent on the Hessian matrix, the covariance of the gradient noise, and the step length. If the sample size increases at a polynomial rate, we show that the estimation errors decay at a corresponding polynomial rate and establish the associated central limit theorems (CLTs). Under certain conditions, we discuss how both the algorithms and the associated limit theorems may be extended to constrained and nonsmooth regimes. As a result, we provide an avenue to construct confidence regions for the optimal solution based on the established CLTs and test the theoretical findings on a stochastic parameter estimation problem.

Lei, Jinlong↗

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↗

The matrix product approximation for the dynamic cavity method

Stochastic dynamics of classical degrees of freedom, defined on vertices of locally tree-like graphs, can be studied in the framework of the dynamic cavity method which is exact for tree graphs. Such models correspond for example to spin-glass systems, Boolean networks, neural networks, and other technical, biological, and social networks. The central objects in the cavity method are edge messages—conditional probabilities of two vertex variable trajectories. In this paper, we discuss a rather pedagogical derivation for the dynamic cavity method, give a detailed account of the novel matrix product edge message (MPEM) algorithm for the solution of the dynamic cavity equation as introduced, and present optimizations and extensions. Matrix product approximations of the edge messages are constructed recursively in an iteration over time. Computation costs and precision can be tuned by controlling the matrix dimensions of the MPEM in truncations. Without truncations, the dynamics is exact. Data for Glauber–Ising dynamics shows a linear growth of computation costs in time. In contrast to Monte Carlo simulations, the approach has a much better error scaling. Hence, it gives for example access to low probability events and decaying observables like temporal correlations. Here, we discuss optimized truncation schemes and an extension that allows to capture models which have a continuum time limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗