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 991 records · Page 55

On stochastic control and optimal measurement strategies

The control of stochastic dynamic systems is studied with particular emphasis on those which influence the quality or nature of the measurements which are made to effect control. Four main areas are discussed: (1) the meaning of stochastic optimality and the means by which dynamic programming may be applied to solve a combined control/measurement problem; (2) a technique by which it is possible to apply deterministic methods, specifically the minimum principle, to the study of stochastic problems; (3) the methods described are applied to linear systems with Gaussian disturbances to study the structure of the resulting control system; and (4) several applications are considered.

Kramer, L. C.↗

Parameter-induced stochastic resonance based on spectral entropy and its application to weak signal detection

The parameter-induced stochastic resonance based on spectral entropy (PSRSE) method is introduced for the detection of a very weak signal in the presence of strong noise. The effect of stochastic resonance on the detection is optimized using parameters obtained in spectral entropy analysis. Upon processing employing the PSRSE method, the amplitude of the weak signal is enhanced and the noise power is reduced, so that the frequency of the signal can be estimated with greater precision through spectral analysis. While the improvement in the signal-to-noise ratio is similar to that obtained using the Duffing oscillator algorithm, the computational cost reduces from O(N{sup 2}) to O(N). The PSRSE approach is applied to the frequency measurement of a weak signal made by a vortex flow meter. The results are compared with those obtained applying the Duffing oscillator algorithm.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Inexact fuzzy-stochastic constraint-softened programming - A case study for waste management

In this study, an inexact fuzzy-stochastic constraint-softened programming method is developed for municipal solid waste (MSW) management under uncertainty. The developed method can deal with multiple uncertainties presented in terms of fuzzy sets, interval values and random variables. Moreover, a number of violation levels for the system constraints are allowed. This is realized through introduction of violation variables to soften system constraints, such that the model's decision space can be expanded under demanding conditions. This can help generate a range of decision alternatives under various conditions, allowing in-depth analyses of tradeoffs among economic objective, satisfaction degree, and constraint-violation risk. The developed method is applied to a case study of planning a MSW management system. The uncertain and dynamic information can be incorporated within a multi-layer scenario tree; revised decisions are permitted in each time period based on the realized values of uncertain events. Solutions associated with different satisfaction degree levels have been generated, corresponding to different constraint-violation risks. They are useful for supporting decisions of waste flow allocation and system-capacity expansion within a multistage context.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

A stochastic thermostat algorithm for coarse-grained thermomechanical modeling of large-scale soft matters: Theory and application to microfilaments

As all-atom molecular dynamics method is limited by its enormous computational cost, various coarse-grained strategies have been developed to extend the length scale of soft matters in the modeling of mechanical behaviors. However, the classical thermostat algorithm in highly coarse-grained molecular dynamics method would underestimate the thermodynamic behaviors of soft matters (e.g. microfilaments in cells), which can weaken the ability of materials to overcome local energy traps in granular modeling. Based on all-atom molecular dynamics modeling of microfilament fragments (G-actin clusters), a new stochastic thermostat algorithm is developed to retain the representation of thermodynamic properties of microfilaments at extra coarse-grained level. The accuracy of this stochastic thermostat algorithm is validated by all-atom MD simulation. This new stochastic thermostat algorithm provides an efficient way to investigate the thermomechanical properties of large-scale soft matters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Advanced Dynamically Adaptive Algorithms for Stochastic Simulations on Extreme Scales

The focus of the project is the development of mathematical methods and high-performance com- putational tools for stochastic simulations, with a particular emphasis on computations on extreme scales. The core of the project revolves around the design of highly e cient and scalable numer- ical algorithms that can adaptively and accurately, in high dimensional spaces, resolve stochastic problems with limited smoothness, even containing discontinuities.

97 MATHEMATICS AND COMPUTING↗

OpenMC In Situ Source Convergence Detection

We designed and implemented an in situ version of particle source convergence for the OpenMC particle transport simulator. OpenMC is a Monte Carlo based-particle simulator for neutron criticality calculations. For the transport simulation to be accurate, source particles must converge on a spatial distribution. Typically, convergence is obtained by iterating the simulation by a user-settable, fixed number of steps, and it is assumed that convergence is achieved. We instead implement a method to detect convergence, using the stochastic oscillator for identifying convergence of source particles based on their accumulated Shannon Entropy. Using our in situ convergence detection, we are able to detect and begin tallying results for the full simulation once the proper source distribution has been confirmed. Our method ensures that the simulation is not started too early, by a user setting too optimistic parameters, or too late, by setting too conservative a parameter.

42 ENGINEERING↗

Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets

We study multistage distributionally robust mixed-integer programs under endogenous uncertainty, where the probability distribution of stage-wise uncertainty depends on the decisions made in previous stages. We first consider two ambiguity sets defined by decision-dependent bounds on the first and second moments of uncertain parameters and by mean and covariance matrix that exactly match decision-dependent empirical ones, respectively. For both sets, we show that the subproblem in each stage can be recast as a mixed-integer linear program (MILP). Moreover, we extend the general moment-based ambiguity set in to the multistage decision-dependent setting, and derive mixed-integer semidefinite programming (MISDP) reformulations of stage-wise subproblems. We develop methods for attaining lower and upper bounds of the optimal objective value of the multistage MISDPs, and approximate them using a series of MILPs. We deploy the Stochastic Dual Dynamic integer Programming (SDDiP) method for solving the problem under the three ambiguity sets with risk-neutral or risk-averse objective functions, and conduct numerical studies on multistage facility-location instances having diverse sizes under different parameter and uncertainty settings. Furthermore, our results show that the SDDiP quickly finds optimal solutions for moderate-sized instances under the first two ambiguity sets, and also finds good approximate bounds for the multistage MISDPs derived under the third ambiguity set. We also demonstrate the efficacy of incorporating decision-dependent distributional ambiguity in multistage decision-making processes.

97 MATHEMATICS AND COMPUTING↗

A NUMERICAL SIMULATION OF COSMIC RAY MODULATION NEAR THE HELIOPAUSE. II. SOME PHYSICAL INSIGHTS

Cosmic ray (CR) transport near the heliopause (HP) is studied using a hybrid transport model, with the parameters constrained by observations from the Voyager 1 spacecraft. We simulate the CR radial flux along different directions in the heliosphere. There is no well-defined thin layer between the solar wind region and the interstellar region along the tail and polar directions of the heliosphere. By analyzing the radial flux curve along the direction of Voyager 2 , together with its trajectory information, the crossing time of the HP by Voyager 2 is predicted to be in 2017.14. We simulate the CR radial flux for different energy values along the direction of Voyager 1 . We find that there is only a modest modulation region of about 10 au wide beyond the HP, so that Voyager 1 observing the Local Interstellar Spectra is justified in numerical modeling. We analyze the heliospheric exit information of pseudo-particles in our stochastic numerical (time-backward) method, conjecturing that they represent the behavior of CR particles, and we find that pseudo-particles that have been traced from the nose region exit in the tail region. This implies that many CR particles diffuse directly from the heliospheric tail region to the nose region near the HP. In addition, when pseudo-particles were traced from the Local Interstellar Medium (LISM), it is found that their exit location (entrance for real particles) from the simulation domain is along the prescribed Interstellar Magnetic Field direction. This indicates that parallel diffusion dominates CR particle transport in the LISM.

79 ASTRONOMY AND ASTROPHYSICS↗

Stochastic models for software project management

A method for determining the number and characteristics of milestones to be achieved during a development project is presented in order that effective monitors of progress can be provided. Projections of progress data lead to estimates of the completion with determinable accuracy, but accuracy imposes a requirement that the number of milestones be inversely proportional to the estimate-error variance, and that the milestones themselves be defined in such a way that each represents approximately the same level of effort to complete.

Tausworthe, R. C.↗

Feedback control for unsteady flow and its application to the stochastic Burgers equation

The study applies mathematical methods of control theory to the problem of control of fluid flow with the long-range objective of developing effective methods for the control of turbulent flows. Model problems are employed through the formalism and language of control theory to present the procedure of how to cast the problem of controlling turbulence into a problem in optimal control theory. Methods of calculus of variations through the adjoint state and gradient algorithms are used to present a suboptimal control and feedback procedure for stationary and time-dependent problems. Two types of controls are investigated: distributed and boundary controls. Several cases of both controls are numerically simulated to investigate the performances of the control algorithm. Most cases considered show significant reductions of the costs to be minimized. The dependence of the control algorithm on the time-descretization method is discussed.

Choi, Haecheon↗

Data-driven optimal charging decision making for connected and automated electric vehicles: A personal usage scenario

This study introduces an optimal charging decision making framework for connected and automated electric vehicles under a personal usage scenario. This framework aims to provide charging strategies, i.e. the choice of charging station and the amount of charged energy, by considering constraints from personal daily itineraries and existing charging infrastructure. A data-driven method is introduced to establish a stochastic energy consumption prediction model with consideration of realistic uncertainties. This is performed by analyzing a large scale electric vehicle data set. A real-time updating method is designed to construct this prediction model from new consecutive data points in an adaptive way for real-world applications. Based on this energy cost prediction framework from real electric vehicle data, multistage optimal charging decision making models are introduced, including a deterministic model for average outcome decision making and a robust model for safest charging strategies. A dynamic programming algorithm is proposed to find the optimal charging strategies. Detailed simulations and case studies demonstrate the performance of the proposed algorithms to find optimal charging strategies. They also show the potential capability of connected and automated electric vehicles to reduce the range anxiety and charging infrastructure dependency.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Galactic cosmic-ray modulation near the heliopause

We investigate the modulation of galactic cosmic rays in the inner and outer heliosheaths using three-dimensional numerical simulations. The model is based on the Parker transport equation integrated using a stochastic phase-space trajectory method. Integration is performed on a plasma background obtained from a global three-dimensional magnetohydrodynamic simulations. Our results predict a negligible amount of modulation in the outer heliosheath because of weak scattering of cosmic ray ions owing to very low levels of magnetic fluctuation power at wavenumbers relevant to the transport of cosmic rays with MeV to GeV energies. This means that the heliopause may be treated as a Dirichlet-type boundary for the purpose of energetic particle modeling. We present models with and without drift velocity to facilitate comparison with papers published earlier. We also attempt to reproduce the sudden step-like increases of cosmic-ray intensity observed by Voyager 1 before its encounter with the heliopause. Our results indicate that very slow cross-field diffusion in the outer heliosheath could produce a large gradient of cosmic rays inside the heliospheric boundary. The resulting large gradient in cosmic-ray intensity near the heliopause qualitatively agrees with recent Voyager 1 observations.

79 ASTRONOMY AND ASTROPHYSICS↗

Time dependent solution for acceleration of tau-leaping

The tau-leaping method is often effective for speeding up discrete stochastic simulation of chemically reacting systems. However, when fast reactions are involved, the speed-up for this method can be quite limited. One way to address this is to apply a stochastic quasi-steady state assumption. However we must be careful when using this assumption. If the fast subsystem cannot reach a steady distribution fast enough, the quasi-steady-state assumption will propagate error into the simulation. To avoid these errors, we propose to use the time dependent solution rather than the quasi-steady-state. Generally speaking, the time dependent solution is not easy to derive for an arbitrary network. However, for some common motifs we do have time dependent solutions. We derive the time dependent solutions for these motifs, and then show how they can be used with tau-leaping to achieve substantial speed-ups, including for a realistic model of blood coagulation. Although the method is complicated, we have automated it.

97 MATHEMATICS AND COMPUTING↗

A Pseudoreversible Normalizing Flow for Stochastic Dynamical Systems with Various Initial Distributions

Here, we present a pseudoreversible normalizing flow method for efficiently generating samples of the state of a stochastic differential equation (SDE) with various initial distributions. The primary objective is to construct an accurate and efficient sampler that can be used as a surrogate model for computationally expensive numerical integration of SDEs, such as those employed in particle simulation. After training, the normalizing flow model can directly generate samples of the SDE’s final state without simulating trajectories. The existing normalizing flow model for SDEs depends on the initial distribution, meaning the model needs to be retrained when the initial distribution changes. The main novelty of our normalizing flow model is that it can learn the conditional distribution of the state, i.e., the distribution of the final state conditional on any initial state, such that the model only needs to be trained once and the trained model can be used to handle various initial distributions. This feature can provide a significant computational saving in studies of how the final state varies with the initial distribution. Additionally, we propose to use a pseudoreversible network architecture to define the normalizing flow model, which has sufficient expressive power and training efficiency for a variety of SDEs in science and engineering, e.g., in particle physics. We provide a rigorous convergence analysis of the pseudoreversible normalizing flow model to the target probability density function in the Kullback–Leibler divergence metric. Numerical experiments are provided to demonstrate the effectiveness of the proposed normalizing flow model.

97 MATHEMATICS AND COMPUTING↗

The dust in the hydrogen-poor ejecta of Abell 30

We present new optical and near-infrared images of the hydrogen-poor planetary nebula Abell 30 and produce detailed models that account for the major observed morphological and IR properties. By imaging the nebula in the K band, we confirm the presence of hot dust in an expanding equatorial ring of H-poor gas. No emission was detected from the H-poor polar knots, suggesting a dust deficiency htere relative to the equatorial ring. The near-IR emission is attributed to small carbonaceous dust grains which are stochastically heated by stellar ultraviolet photons. Using an adaptive version of a matrix method devised by Guhathakurta & Draine (1989) to model stochastic heating, we find that the near-IR spectrum observed by Dinerstein & Lester (1984) requires the presence of dust grains down to approximately 0.0007 microns in radius. This minimum grain radius is in excellent agreement with our calculations of the grain destruction by energetic stellar UV photons: we find that carbon clusters with less than approximately 140 atoms (0.0007 microns in radius) are destroyed by stellar UV photons in approximately 1000 yr, the kinematic age of H-poor ejecta. Modeling of the far-IR dust emission implies that the bulk of the dust mass in A30 must reside at distances several times greater than the distance of the equatorial ring from the central star. This spatial dust distribution is attributed to the interaction of the stellar wind with the inhomogeneous H-poor ejecta. Most of the H-poor gas and dust has been apparently carried outward by the stellar wind, leaving behing dense, H-poor knots with prominent wind-blown tails in the equatorial ring and in the polar knots. This picture is supported by the presence of a stellar wind-blown bubble within the H-rich envelope in our optical images.

Borkowski, Kazimierz J.↗

Approximate Bayesian Model Inversion for PDEs with Heterogeneous and State-Dependent Coefficients

We present two approximate Bayesian inference methods for parameter estimation in partial differential equation (PDE) models with space-dependent and state-dependent parameters. We demonstrate that these methods provide accurate and cost-effective alternatives to Markov Chain Monte Carlo simulation. We assume a parameterized Gaussian prior on the unknown functions, and approximate the posterior density by a parameterized multivariate Gaussian density. The parameters of the prior and posterior are estimated from sparse observations of the PDE model's states and the unknown functions themselves by maximizing the evidence lower bound (ELBO), a lower bound on the log marginal likelihood of the observations. The first method, Laplace-EM, employs the expectation maximization algorithm to maximize the ELBO, with a Laplace approximation of the posterior on the E-step, and minimization of a Kullback-Leibler divergence on the M-step. The second method, DSVI-EB, employs the doubly stochastic variational inference (DSVI) algorithm, in which the ELBO is maximized via gradient-based stochastic optimization, with nosiy gradients computed via simple Monte Carlo sampling and Gaussian backpropagation. We apply these methods to identifying diffusion coefficients in linear and nonlinear diffusion equations, and we find that both methods provide accurate estimates of posterior densities and the hyperparameters of Gaussian priors. While the Laplace-EM method is more accurate, it requires computing Hessians of the physics model. The DSVI-EB method is found to be less accurate but only requires gradients of the physics model.

approximate Bayesian inference, model inversion, v↗

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↗

Quantum optimization algorithms: Energetic implications

Since the dawn of quantum computing (QC), theoretical developments like Shor's algorithm proved the conceptual superiority of QC over traditional computing. However, such quantum supremacy claims are difficult to achieve in practice because of the technical challenges of realizing noiseless qubits. In the near future, QC applications will need to rely on noisy quantum devices that offload part of their work to classical devices. One way to achieve this is by using parameterized quantum circuits in optimization or even in machine learning tasks. The energy requirements of quantum algorithms have not yet been studied extensively. Here in this article, we explore several optimization algorithms using both theoretical insights and numerical experiments to understand their impact on energy consumption. Specifically, we highlight why and how algorithms like quantum natural gradient descent, simultaneous perturbation stochastic approximations or circuit learning methods, are at least 2x to 4x more energy efficient than their classical counterparts; why feedback-based quantum optimization is energy-inefficient; and how techniques like Rosalin can improve the energy efficiency of other algorithms by a factor of ≥2 0 x. Finally, we use the NchooseK high-level programming model to run optimization problems on both gate-based quantum computers and quantum annealers. Empirical data indicate that these optimization problems run faster, have better success rates, and consume less energy on quantum annealers than on their gate-based counterparts.

97 MATHEMATICS AND COMPUTING↗