Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic approximation”

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 253 records · Page 14

Modelling the Fluctuations of Reactive Shock Waves in Heterogeneous Solid Explosives as Stochastic Processes

Although current phenomenological burn models are useful for describing the average or bulk reactive flow behaviour of heterogeneous explosives, one fundamental weakness inherent to these models is the loss of detailed microstructural information at the scale of the calculation. In order to include the effects of the microstructure, and in particular the underlying material heterogeneities that influence the build-up to detonation, a new paradigm is put forth for modelling sub-grid, reaction-induced fluctuations (i.e. “hot spots”) at the continuum level. This modelling approach assumes that the reaction rate is stochastic, rather than deterministic, and it uses Langevin-type equations with a mathematical framework built upon Itô calculus and Lambourn's CIM model for shocked heterogeneous explosives. This approach follows directly from our previous letter, Ref. [1], and is inspired by the probability density function (pdf) methods used in turbulent reactive flows. Here, the stochastic burn model is derived, implemented, and exercised far beyond what has been shown in previous work. New hydrocode simulation results demonstrate the role of stochastic fluctuations during shock initiation; these fluctuations are approximated by collections of discrete particles, that evolve with drift (i.e. deterministic) and diffusion (i.e. stochastic) coefficients. Furthermore, the particle values are propagated and averaged to calculate the heat release, yield strength, and material impedance in each computational cell. Hydrocode simulation results further show how the fluctuating hot spot energy may or may not be transmitted to the wave front, and result in a detonation wave-like structure. The fundamental stochastic nature of this model permits simulations to have varying outcomes with the same initial conditions; this allows for go/no-go estimation (e.g., marginal or failed detonations), which might possibly be calibrated using the statistical distributions from real materials. Mesoscale calculations of shocked heterogeneous explosives also show that these fluctuations are physically justified (i.e., Ref. [2]), and it is hypothesized that the pdf functions provide a link between the meso(grain) and continuum scales for practical engineering calculations. Hence, our approach is a paradigm shift for building efficient, reduced order continuum burn models, that represent the sub-grid stochastic behaviour of shocked heterogeneous solid explosives.

42 ENGINEERING↗

On random fuzzy fractional partial integro-differential equations under Caputo generalized Hukuhara differentiability

This paper is devoted to the study of the solvability of random fuzzy fractional partial integro-differential equations under Caputo generalized Hukuhara differentiability. The notions of random fuzzy variables and fuzzy stochastic processes are developed for multivariable functions. The existence and uniqueness of two types of integral solutions generated from Darboux problem for nonlinear wave equations are proved using the successive approximations method and Gronwall’s inequality for stochastic processes. The continuous dependence on the data, the boundedness, and the stability with probability one of integral solutions are established to confirm the well posedness of our model. Some computational examples are presented to illustrate the theoretical results.

97 MATHEMATICS AND COMPUTING↗

Gaussian Process Emulators for Volcanic Ash Dispersion Model Tephra2

It is necessary to predict volcanic ash deposition since falling ash is harmful to human activities. Because simulators built for this purpose are computationally expensive, it is popular to use statistical emulators for geophysical hazard analyses, where a large number of simulations are required. Gaussian stochastic process emulators are able to approximate expensive simulations in an accurate and efficient way. Using a relatively small number of simulation runs, a well-trained emulator can accurately predict simulation outputs at massive new input points in a few seconds. Under different explosive eruption conditions, we constructed Gaussian stochastic process emulators for Tephra2, a simulation tool for estimating the accumulation of volcanic ash over a region. Historical wind records are used as input wind data, without assuming a Gaussian wind speed profile or common wind direction among elevations. While there are several inputs for Tephra2, we use no more than three physically motivated variables as emulator inputs to reduce the computational cost of emulations. The emulator outputs predict the mass of tephra per unit area at 50281 grid points around a predetermined vent location.

58 GEOSCIENCES↗

Hierarchical fractional-step approximations and parallel kinetic Monte Carlo algorithms

We present a mathematical framework for constructing and analyzing parallel algorithms for lattice kinetic Monte Carlo (KMC) simulations. The resulting algorithms have the capacity to simulate a wide range of spatio-temporal scales in spatially distributed, non-equilibrium physiochemical processes with complex chemistry and transport micro-mechanisms. Rather than focusing on constructing exactly the stochastic trajectories, our approach relies on approximating the evolution of observables, such as density, coverage, correlations and so on. More specifically, we develop a spatial domain decomposition of the Markov operator (generator) that describes the evolution of all observables according to the kinetic Monte Carlo algorithm. This domain decomposition corresponds to a decomposition of the Markov generator into a hierarchy of operators and can be tailored to specific hierarchical parallel architectures such as multi-core processors or clusters of Graphical Processing Units (GPUs). Based on this operator decomposition, we formulate parallel Fractional step kinetic Monte Carlo algorithms by employing the Trotter Theorem and its randomized variants; these schemes, (a) are partially asynchronous on each fractional step time-window, and (b) are characterized by their communication schedule between processors. The proposed mathematical framework allows us to rigorously justify the numerical and statistical consistency of the proposed algorithms, showing the convergence of our approximating schemes to the original serial KMC. The approach also provides a systematic evaluation of different processor communicating schedules. We carry out a detailed benchmarking of the parallel KMC schemes using available exact solutions, for example, in Ising-type systems and we demonstrate the capabilities of the method to simulate complex spatially distributed reactions at very large scales on GPUs. Finally, we discuss work load balancing between processors and propose a re-balancing scheme based on probabilistic mass transport methods.

97 MATHEMATICS AND COMPUTING↗

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↗

Accelerating Hamiltonian Monte Carlo for Bayesian inference in neural networks and neural operators

Hamiltonian Monte Carlo (HMC) is a powerful and accurate method to sample from the posterior distribution in Bayesian inference. However, HMC techniques are computationally demanding for Bayesian neural networks due to the high dimensionality of the network’s parameter space and the non-convexity of their posterior distributions. Therefore, various approximation techniques, such as variational inference (VI) or stochastic gradient MCMC, are often employed to infer the posterior distribution of the network parameters. Such approximations introduce inaccuracies in the inferred distributions, resulting in unreliable uncertainty estimates. In this work, we propose a hybrid approach that combines inexpensive VI and accurate HMC methods to efficiently and accurately quantify uncertainties in neural networks and neural operators. The proposed approach leverages an initial VI training on the full network. We examine the influence of individual parameters on the prediction uncertainty, which shows that a large proportion of the parameters do not contribute substantially to uncertainty in the network predictions. This information is then used to significantly reduce the dimension of the parameter space, and HMC is performed only for the subset of network parameters that strongly influence prediction uncertainties. This yields a framework for accelerating the full batch HMC for posterior inference in neural networks. We demonstrate the efficiency and accuracy of the proposed framework on deep neural networks and operator networks, showing that inference can be performed for large networks with tens to hundreds of thousands of parameters. Finally, we show that this method can effectively learn surrogates for complex physical systems by modeling the operator that maps from upstream conditions to wall-pressure data on a cone in hypersonic flow.

Bayesian inference↗

Surrogate Hessian accelerated structural optimization for stochastic electronic structure theories

In this work, we present an efficient energy-based method for structural optimization with stochastic electronic structure theories, such as diffusion quantum Monte Carlo (DMC). This method is based on robust line-search energy minimization in reduced parameter space, exploiting approximate but accurate Hessian information from a surrogate theory, such as density functional theory. The surrogate theory is also used to characterize the potential energy surface, allowing for simple but reliable ways to maximize statistical efficiency while retaining controllable accuracy. We demonstrate the method by finding the minimum DMC energy structures of the selected flake-like aromatic molecules, such as benzene, coronene, and ovalene, represented by 2, 6, and 19 structural parameters, respectively. In each case, the energy minimum is found within two parallel line-search iterations. The method is near-optimal for a line-search technique and suitable for a broad range of applications. It is easily generalized to any electronic structure method where forces and stresses are still under active development and implementation, such as diffusion Monte Carlo, auxiliary-field Monte Carlo, and stochastic configuration interaction, as well as deterministic approaches such as the random-phase approximation. Accurate and efficient means of geometry optimization could shed light on a broad class of materials and molecules, showing high sensitivity of induced properties to structural variables.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Data-based stochastic model reduction for the Kuramoto–Sivashinsky equation

In this paper, the problem of constructing data-based, predictive, reduced models for the Kuramoto–Sivashinsky equation is considered, under circumstances where one has observation data only for a small subset of the dynamical variables. Accurate prediction is achieved by developing a discrete-time stochastic reduced system, based on a NARMAX (Nonlinear Autoregressive Moving Average with eXogenous input) representation. The practical issue, with the NARMAX representation as with any other, is to identify an efficient structure, i.e., one with a small number of terms and coefficients. This is accomplished here by estimating coefficients for an approximate inertial form. Finally, the broader significance of the results is discussed.

97 MATHEMATICS AND COMPUTING↗

Moderate deviations-based importance sampling for stochastic recursive equations

Subsolutions to the Hamilton–Jacobi–Bellman equation associated with a moderate deviations approximation are used to design importance sampling changes of measure for stochastic recursive equations. Analogous to what has been done for large deviations subsolution-based importance sampling, these schemes are shown to be asymptotically optimal under the moderate deviations scaling. Here, we present various implementations and numerical results to contrast their performance, and also discuss the circumstances under which a moderate deviation scaling might be appropriate.

97 MATHEMATICS AND COMPUTING↗

A hybrid stochastic-deconvolution model for large-eddy simulation of particle-laden flow

We develop a hybrid model for large-eddy simulation of particle-laden turbulent flow, which is a combination of the approximate deconvolution model for the resolved scales and a stochastic model for the sub-grid scales. The stochastic model incorporates a priori results of direct numerical simulation of turbulent channel flow, which showed that the parameters in the stochastic model are quite independent of Reynolds and Stokes number. In order to correctly predict the flux of particles towards the walls an extra term should be included in the stochastic model, which corresponds to the term related to the well-mixed condition in Langevin models for particle dispersion in inhomogeneous turbulent flow. The model predictions are compared with results of direct numerical simulation of channel flow at a frictional Reynolds number of 950. The inclusion of the stochastic forcing is shown to yield a significant improvement over the approximate deconvolution model for the particles alone when combined with a Stokes dependent weight-factor for the well-mixed term.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A high-fidelity approach towards simulation of pool boiling

A novel numerical approach is developed to simulate the multiscale problem of pool-boiling phase change. The particular focus is to develop a simulation technique that is capable of predicting the heat transfer and hydrodynamic characteristics of nucleate boiling and the transition to critical heat flux on surfaces of arbitrary shape and roughness distribution addressing a critical need to design enhanced boiling heat transfer surfaces. The macro-scale of the phase change and bubble dynamics is addressed through employing off-the-shelf Computational Fluid Dynamics (CFD) methods for interface tracking and interphase mass and energy transfer. The micro-scale of the microlayer, which forms at early stage of bubble nucleation near the wall, is resolved through asymptotic approximation of the thin-film theory which provides a closed-form solution for the distribution of the micro-layer and its influence on the evaporation process. In addition, the sub-grid surface roughness is represented stochastically through probabilistic density functions and its role in bubble nucleation and growth is then represented based on the thermodynamics of nucleation process. This combination of deterministic CFD, local approximation, and stochastic representation allows the simulation of pool boiling on any surface with known roughness and enhancement characteristics. The numerical model is validated for dynamics and hydrothermal characteristics of a single nucleated bubble on a flat surface against available literature data. In addition, the prediction of pool-boiling heat transfer coefficient is verified against experimental measurements as well as reputable correlations for various roughness distributions and different surface orientations. Finally, the model is employed to demonstrate pool-boiling phenomenon on enhanced structures with reentrance cavities and to explore the effect of enhancement feature design on thermal and hydrodynamic characteristics of these surfaces.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Snell Envelope with Small Probability Criteria

We present a new algorithm to compute the Snell envelope in the specific case where the criteria to optimize is associated with a small probability or a rare event. This new approach combines the Stochastic Mesh approach of Broadie and Glasserman with a particle approximation scheme based on a specific change of measure designed to concentrate the computational effort in regions pointed out by the criteria. The theoretical analysis of this new algorithm provides non asymptotic convergence estimates. Finally, the numerical tests confirm the practical interest of this approach.

97 MATHEMATICS AND COMPUTING↗

Modeling information flow in a computer processor with a multi-stage queuing model

In this paper, we introduce a nonlinear stochastic model to describe the propagation of information inside a computer processor. In this model, a computational task is divided into stages, and information can flow from one stage to another. The model is formulated as a spatially-extended, continuous-time Markov chain where space represents different stages. This model is equivalent to a spatially-extended version of the M/M/s queue. The main modeling feature is the throttling function which describes the processor slowdown when the amount of information falls below a certain threshold. We derive the stationary distribution for this stochastic model and develop a closure for a deterministic ODE system that approximates the evolution of the mean and variance of the stochastic model. In conclusion, we demonstrate the validity of the closure with numerical simulations.

97 MATHEMATICS AND COMPUTING↗

Uncertainty Quantification in Scale-Dependent Models of Flow in Porous Media

Equations governing flow and transport in heterogeneous porous media are scale-dependent. We demonstrate that it is possible to identify a support scale $\eta^*$, such that the typically employed approximate formulations of Moment Equations (ME) yield accurate (statistical) moments of a target environmental state variable. Under these circumstances, the ME approach can be used as an alternative to the Monte Carlo (MC) method for Uncertainty Quantification in diverse fields of Earth and environmental sciences. MEs are directly satisfied by the leading moments of the quantities of interest and are defined on the same support scale as the governing stochastic partial differential equations (PDEs). Computable approximations of the otherwise exact MEs can be obtained through perturbation expansion of moments of the state variables in orders of the standard deviation of the random model parameters. As such, their convergence is guaranteed only for the standard deviation smaller than one. Furthermore, we demonstrate our approach in the context of steady-state groundwater flow in a porous medium with a spatially random hydraulic conductivity.

42 ENGINEERING↗

Correspondence between open bosonic systems and stochastic differential equations

Bosonic mean-field theories can approximate the dynamics of systems of $n$ bosons provided that $n \gg 1$. Here, we show that there can also be an exact correspondence at finite $n$ when the bosonic system is generalized to include interactions with the environment and the mean-field theory is replaced by a stochastic differential equation. When the $n \to \infty$ limit is taken, the stochastic terms in this differential equation vanish, and a mean-field theory is recovered. Besides providing insight into the differences between the behavior of finite quantum systems and their classical limits given by $n \to \infty$, the developed mathematics can provide a basis for quantum algorithms that solve some stochastic nonlinear differential equations. We discuss conditions on the efficiency of these quantum algorithms, with a focus on the possibility for the complexity to be polynomial in the log of the stochastic system size. A particular system with the form of a stochastic discrete nonlinear Schrödinger equation is analyzed in more detail.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Experimental Validation of Approximate Dynamic Programming Based Optimization and Convergence on Microgrid Applications

Stochastic optimization can better address uncertainties in power system problems. However, when state space and action space become large, many existing approaches become computationally expensive and even infeasible. Approximate dynamic programming (ADP) attracts researchers’ attention as a powerful tool for solving power system optimization problems with reduced computational cost. In this paper, in light of the existing literature, we investigate how the ADP approach with post-decision value function approximation converges to the nearly optimal solution with improved computational speed and experimentally validate the performance of the approach for a microgrid energy optimization problem. The approximation error versus the number of iteration is studied for convergence analysis of the post-decision ADP. A flowchart is provided to illustrate the proposed ADP algorithm for a microgrid energy optimization problem. The performance of ADP and dynamic programming (DP) is compared in terms of optimization error and computational time. It has found that the post-decision ADP approach can achieve competitive optimality with improved computational speed compared to the traditional DP.

Das, Avijit↗

Fluctuations and Stochastic Processes in One-Dimensional Many-Body Quantum Systems

We study the fluctuation properties of a one-dimensional many-body quantum system composed of interacting bosons and investigate the regimes where quantum noise or, respectively, thermal excitations are dominant. For the latter, we develop a semiclassical description of the fluctuation properties based on the Ornstein-Uhlenbeck stochastic process. As an illustration, we analyze the phase correlation functions and the full statistical distributions of the interference between two one-dimensional systems, either independent or tunnel-coupled, and compare with the Luttinger-liquid theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

How good are learning-based control v.s. model-based control for load shifting? Investigations on a single zone building energy system

Both model predictive control (MPC) and deep reinforcement learning control (DRL) have been presented as a way to approximate the true optimality of a dynamic programming problem, and these two have shown significant operational cost saving potentials for building energy systems. Furthermore, there is still a lack of in-depth quantitative studies on their approximation levels to the true optimality, especially in the building energy domain. To fill in the gap, this paper provides a numerical framework that enables the evaluation of the optimality levels of different controllers for building energy systems. This framework is then used to comprehensively compare the optimal control performance of both MPC and DRL controllers with given computation budgets for a single zone fan coil unit system. Note the optimality is estimated based on a user-specific selection of trade-off weights among energy costs, thermal comfort and control slew rates. Compared with the best optimality we can find through expensive optimization simulations, the best DRL agent can maximally approximate the optimality by 96.54%, which outperforms the best MPC whose optimality level is 90.11%. However, due to the stochasticity, the DRL agent is only expected to approximate the optimality by 90.42%, which is almost equivalent to the best MPC. Except for Proximal Policy Optimization (PPO), all DRL agents can have a better approximation to the optimality than the best MPC, and are expected to have better approximation than the MPC with a prediction horizon of 32 steps (15 min per step). In terms of reducing energy cost and thermal discomfort, MPC can outperform the rule-based control (RBC) by 18.47%–25.44%. DRL can be expected to outperform RBC by 18.95%–25.65% ,and the best DRL control policy can outperform RBC by 20.29%–29.72%. Although the comparison of the optimality level is performed in a perfect setting, e.g., MPC assumes perfect models, and DRL assumes a perfect offline training process and online deployment process, this can shed insight on their capabilities of approximating to the original dynamic programming problem.

24 POWER TRANSMISSION AND DISTRIBUTION↗