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 343 records · Page 19

Fully consistent Eulerian Monte Carlo fields method for solving probability density function transport equations in turbulence modeling

The probability density function (PDF) transport equation method is a sophisticated model for the closure of turbulent mixing and turbulent reactive flows. An efficient solution approach for solving the PDF transport equation has been vital for the method to be widely used in applications. The Eulerian Monte Carlo fields (EMCF) method has been developed to solve the PDF transport equation efficiently for decades. A recent work by Wang et al. revealed a serious issue of the EMCF method for not being fully consistent with the PDF transport equation for which the method is designed to solve. This work advances the state of the art by introducing fully consistent EMCF methods for solving the PDF transport equation. The fully consistent EMCF formulations are derived for two different PDF equation forms. The consistency of the EMCF formulations is mathematically confirmed by examining the derived moment transport equations from the EMCF formulations and from the PDF transport equation. The method of manufactured solutions is employed to further verify the consistency and convergence of the different EMCF formulations numerically. The newly introduced EMCF formulations bring the EMCF method to full consistency with the PDF transport equations for the first time.

42 ENGINEERING↗

Pedestal-to-wall 3D fluid transport simulations on DIII-D

The 3D fluid-plasma edge transport code EMC3-EIRENE is used to test several magnetic field models with and without plasma response against DIII-D experimental data for even and odd-parity n = 3 magnetic field perturbations. The field models include ideal and extended MHD equilibria, and the vacuum approximation. Plasma response is required to reduce the stochasticity in the pedestal region for even-parity fields, however too much screening suppresses the measured splitting of the downstream T-e profile. Odd-parity perturbations result in weak tearing and only small additional peaks in the downstream measurements. In this case plasma response is required to increase the size of the lobe structure. No single model is able to simultaneously reproduce the upstream and downstream characteristics for both odd and even-parity perturbations.

3D transport↗

Rare-event Simulation for Stochastic Korteweg-de Vries Equation

An asymptotic analysis of the tail probabilities for the dynamics of a soliton wave $U(x,t)$ under a stochastic time-dependent force is developed. The dynamics of the soliton wave $U(x,t)$ is described by the Korteweg-de Vries Equation with homogeneous Dirichlet boundary conditions under a stochastic time-dependent force, which is modeled as a time-dependent Gaussian noise with amplitude $\epsilon$. The tail probability we considered is $w(b) :=P(\sup_{t\in [0,T]} U(x,t) > b ),$ as $b\rightarrow \infty,$ for some constant $T>0$ and a fixed $x$, which can be interpreted as tail probability of the amplitude of water wave on shallow surface of a fluid or long internal wave in a density-stratified ocean. Our goal is to characterize the asymptotic behaviors of $w(b)$ and to evaluate the tail probability of the event that the soliton wave exceeds a certain threshold value under a random force term. Such rare-event calculation of $w(b)$ is very useful for fast estimation of the risk of the potential damage that could caused by the water wave in a density-stratified ocean modeled by the stochastic KdV equation. In this work, the asymptotic approximation of the probability that the soliton wave exceeds a high-level $b$ is derived. In addition, we develop a provably efficient rare-event simulation algorithm to compute $w(b)$. The efficiency of the algorithm only requires mild conditions and therefore it is applicable to a general class of Gaussian processes and many diverse applications.

Xu, Gongjun↗

Analysis of Integrated Vapor Transport Biases

Abstract High-fidelity analyses and forecasts of integrated vapor transport (VT) are central to the study of Earth’s hydrological cycle as well as high-impact phenomena such as monsoons and atmospheric rivers. The impact of the in-line analysis correction-based additive inflation (ACAI) on IVT biases and forecast errors is examined within the Navy Earth System Prediction Capability (Navy ESPC) global coupled system. The ACAI technique uses atmospheric analysis corrections from the data assimilation system to approximate model bias and as a representation of stochastic model error to simultaneously reduce systematic and random errors and improve ensemble performance. ACAI reduces the global average magnitude of the 7- and 14-day IVT bias by 16%–17% during Northern Hemisphere summer, reaching 70% reductions in some tropical regions. The global average IVT bias reduction is similar to the bias reduction for low-level wind speed bias and considerably smaller than the bias reduction in total precipitable water. The localized regions where ACAI increases IVT bias occur where the control IVT biases change sign and structure with increasing forecast lead time, such as the South Asian monsoon region. Substituting analyzed wind or moisture fields for the forecast fields when calculating the forecast IVT confirms that, on average, wind errors dominate the IVT error calculation in the tropics, although wind and moisture error contributions are comparable in the extratropics. The existence of regions where using either analyzed winds or analyzed moisture increases IVT bias or mean absolute error reveals areas with compensating errors.

Reynolds, Carolyn A.↗

Closures and Simulation for Thermal Radiation Transport in Stochastic Media with Nonlinear Temperature Dependence

Because of the practical challenge of rendering very complex realistic spatial structures for numerical work, it is common practice to resort to characterizing such media as stochastic mixtures of materials, ideally parametrized with low order statistics such as the mean, variance, and correlation functions of the now random material properties. This enables realizations of the medium to be repeatedly generated and radiation transport computations to, in principle, be performed for a large ensemble of these realizations to obtain a statistically well-characterized radiation field. Statistical post-processing yields desired quantities such as conditional and unconditional mean radiation flux and probability distributions of transmitted radiation. However, such computations prove expensive for all but the simplest stochastic geometries and are most suited for benchmarking approximate models. The most common approximations lead to homogenized media so that transport computations are required only on a single medium realization but by construct provide only limited statistical information on the radiation field. Almost all approximate approaches to this problem attempt to develop equations for low order moments of the radiation intensity (mean, second moment, correlation function) but inevitably encounter a closure problem: the equation for any statistical moment will contain terms depending on unknown higher-order moments. Thus, the challenge shifts to one of developing closure relations that relate the unknown moments to the lower order moments. Under very special conditions, an exact closure can be derived but in general closures are heuristically stated constitutive relations. Also, closure approaches depend on whether the mixing statistics are spatially and/or temporally continuous as in fluctuating turbulent fields, or discontinuous as in randomly mixed solid chunks of material. Thus, unconditional averaging is generally applied in the former case but conditional averaging is more appropriate when the mixing is discontinuous. In this work, the emphasis is on binary statistical mixtures of immiscible fluids as as such the quantities of interest are averages (flux, temperature) conditioned on the material type.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Probabilistic Structural Analysis Theory Development

The objective of the Probabilistic Structural Analysis Methods (PSAM) project is to develop analysis techniques and computer programs for predicting the probabilistic response of critical structural components for current and future space propulsion systems. This technology will play a central role in establishing system performance and durability. The first year's technical activity is concentrating on probabilistic finite element formulation strategy and code development. Work is also in progress to survey critical materials and space shuttle mian engine components. The probabilistic finite element computer program NESSUS (Numerical Evaluation of Stochastic Structures Under Stress) is being developed. The final probabilistic code will have, in the general case, the capability of performing nonlinear dynamic of stochastic structures. It is the goal of the approximate methods effort to increase problem solving efficiency relative to finite element methods by using energy methods to generate trial solutions which satisfy the structural boundary conditions. These approximate methods will be less computer intensive relative to the finite element approach.

Burnside, O. H.↗

ecode - Electron Transport Algorithm Testing v. 1.0

ecode is a Monte Carlo code used for testing algorithms related to electron transport. The code can read basic physics parameters, such as energy-dependent stopping powers and screening parameters. The code permits simple planar geometries of slabs or cubes. Parallelization consists of domain replication, with work distributed at the start of the calculation and statistical results gathered at the end of the calculation. Some basic routines (such as input parsing, random number generation, and statistics processing) are shared with the Integrated Tiger Series codes. A variety of algorithms for uncertainty propagation are incorporated based on the stochastic collocation and stochastic Galerkin methods. These permit uncertainty only in the total and angular scattering cross sections. The code contains algorithms for simulating stochastic mixtures of two materials. The physics is approximate, ranging from mono-energetic and isotropic scattering to screened Rutherford angular scattering and Rutherford energy-loss scattering (simple electron transport models). No production of secondary particles is implemented, and no photon physics is implemented.

Franke, Brian C.↗

Bi-fidelity approximation for uncertainty quantification and sensitivity analysis of irradiated particle-laden turbulence

Particle-laden turbulent flows subject to radiative heating are relevant in many applications, for example concentrated solar power receivers. Efficient and accurate simulations provide valuable insights and enable optimization of such systems. However, as there are many uncertainties inherent in such flows, uncertainty quantification is fundamental to improve the predictive capabilities of the numerical simulations. For large-scale, multi-physics problems exhibiting high-dimensional uncertainty, characterizing the stochastic solution presents a significant computational challenge as most strategies require a large number of high-fidelity solves. This requirement might result in an infeasible number of simulations when a typical converged high-fidelity simulation requires intensive computational resources. To reduce the cost of quantifying high-dimensional uncertainties, we investigate the application of a non-intrusive, bi-fidelity approximation to estimate statistics of quantities of interest associated with an irradiated particle-laden turbulent flow. This method exploits the low-rank structure of the solution to accelerate the stochastic sampling and approximation processes by means of cheaper-to-run, lower fidelity representations. Here, the application of this bi-fidelity approximation results in accurate estimates of the quantities of interest statistics, while requiring a small number of high-fidelity model evaluations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Bi-fidelity approximation for uncertainty quantification and sensitivity analysis of irradiated particle-laden turbulence.

Efficiently performing predictive studies of irradiated particle-laden turbulent flows has the potential of providing significant contributions towards better understanding and optimizing, for example, concentrated solar power systems. As there are many uncertainties inherent in such flows, conducting uncertainty quantification analyses is fundamental to improve the predictive capabilities of the numerical simulations. For largescale, multi-physics problems exhibiting high-dimensional uncertainty, characterizing the stochastic solution presents a significant computational challenge as many methods require a large number of high-fidelity, forward model solves. This requirement results in the need for a possibly infeasible number of simulations when a typical converged high-fidelity simulation requires intensive computational resources. To reduce the cost of quantifying high-dimensional uncertainties, we investigate the application of a non-intrusive, bi-fidelity approximation to estimate statistics of quantities of interest associated with an irradiated particle-laden turbulent flow. This method relies on exploiting the low-rank structure of the solution to accelerate the stochastic sampling and approximation processes by means of cheaper-to-run, lower fidelity representations. The application of this bi-fidelity approximation results in accurate estimates of the QoI statistics while requiring a small number of high-fidelity model evaluations. It also enables efficient computation of sensitivity analyses which highlight that epistemic uncertainty plays an important role in the solution of irradiated, particle-laden turbulent flow.

42 ENGINEERING↗

A Two-Stage Approach for Routing Multiple Unmanned Aerial Vehicles with Stochastic Fuel Consumption

The past decade has seen a substantial increase in the use of small unmanned aerial vehicles (UAVs) in both civil and military applications. This article addresses an important aspect of refueling in the context of routing multiple small UAVs to complete a surveillance or data collection mission. Specifically, this article formulates a multiple-UAV routing problem with the refueling constraint of minimizing the overall fuel consumption for all the vehicles as a two-stage stochastic optimization problem with uncertainty associated with the fuel consumption of each vehicle. The two-stage model allows for the application of sample average approximation (SAA). Although the SAA solution asymptotically converges to the optimal solution for the two-stage model, the SAA run time can be prohibitive for medium- and large-scale test instances. Hence, we develop a tabu search-based heuristic that exploits the model structure while considering the uncertainty in fuel consumption. Extensive computational experiments corroborate the benefits of the two-stage model compared to a deterministic model and the effectiveness of the heuristic for obtaining high-quality solutions.

42 ENGINEERING↗

Variational Monte Carlo Calculations of A ≤ 4 Nuclei with an Artificial Neural-Network Correlator Ansatz

Here, the complexity of many-body quantum wave functions is a central aspect of several fields of physics and chemistry where nonperturbative interactions are prominent. Artificial neural networks (ANNs) have proven to be a flexible tool to approximate quantum many-body states in condensed matter and chemistry problems. In this work we introduce a neural-network quantum state ansatz to model the ground-state wave function of light nuclei, and approximately solve the nuclear many-body Schrodinger equation. Using efficient stochastic sampling and optimization schemes, our approach extends pioneering applications of ANNs in the field, which present exponentially scaling algorithmic complexity. We compute the binding energies and point-nucleon densities of A ≤ 4 nuclei as emerging from a leading-order pionless effective field theory Hamiltonian. We successfully benchmark the ANN wave function against more conventional parametrizations based on two- and three-body Jastrow functions, and virtually exact Green's function Monte Carlo results.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Preconditioned Low-Rank Projection Method with a Rank-Reduction Scheme for Stochastic Partial Differential Equations

Herein, we consider the numerical solution of large systems of linear equations obtained from the stochastic Galerkin formulation of stochastic partial differential equations. We propose an iterative algorithm that exploits the Kronecker product structure of the linear systems. The proposed algorithm efficiently approximates the solutions in low-rank tensor format. Using standard Krylov subspace methods for the data in tensor format is computationally prohibitive due to the rapid growth of tensor ranks during the iterations. To keep tensor ranks low over the entire iteration process, we devise a rank-reduction scheme that can be combined with the iterative algorithm. The proposed rank-reduction scheme identifies an important subspace in the stochastic domain and compresses tensors of high rank on-the-fly during the iterations. The proposed reduction scheme is a coarse-grid method in that the important subspace can be identified inexpensively in a coarse spatial grid setting. The efficiency of the present method is displayed by numerical experiments on benchmark problems.

97 MATHEMATICS AND COMPUTING↗

Learning effective stochastic differential equations from microscopic simulations: Linking stochastic numerics to deep learning

We identify effective stochastic differential equations (SDEs) for coarse observables of fine-grained particle- or agent-based simulations; these SDEs then provide useful coarse surrogate models of the fine scale dynamics. We approximate the drift and diffusivity functions in these effective SDEs through neural networks, which can be thought of as effective stochastic ResNets. The loss function is inspired by, and embodies, the structure of established stochastic numerical integrators (here, Euler–Maruyama and Milstein); our approximations can thus benefit from backward error analysis of these underlying numerical schemes. They also lend themselves naturally to “physics-informed” gray-box identification when approximate coarse models, such as mean field equations, are available. Existing numerical integration schemes for Langevin-type equations and for stochastic partial differential equations can also be used for training; we demonstrate this on a stochastically forced oscillator and the stochastic wave equation. Our approach does not require long trajectories, works on scattered snapshot data, and is designed to naturally handle different time steps per snapshot. We consider both the case where the coarse collective observables are known in advance, as well as the case where they must be found in a data-driven manner.

97 MATHEMATICS AND COMPUTING↗

A Heuristic Approach to the Post-disturbance and Stochastic Pre-disturbance Microgrid Formation Problem

Microgrid formation is a potential solution in post-disaster electric grid recovery efforts. Recent works propose distribution level microgrid formation models using mixed-integer linear programming techniques. However, these models can only be solved for small and medium size power systems due to their computational intractability. In this article we introduce a heuristic approach that allows to approximately solve the post-disturbance microgrid formation problem for medium to large, more realistic, instances. Furthermore, the proposed approach allows to approximately solve the pre-disturbance microgrid formation problem (a stochastic version of the post-disturbance problem), in which the aim is to allocate extra generation capacity to the network to immunize it, as best as possible, against an uncertain cascading failure. Our results are illustrated by solving versions of the problem on ten test cases with up to 3012 buses.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Modulating terrestrial impacts from Oort cloud comets by the adiabatically changing galactic tides

Time modulation of the flux of new Jupiter-dominated Oort cloud comets is the subject of interest here. The major perturbation of these comets during the present epoch is due to the tidal field of the relatively smooth distribution of matter in the galactic disk. A secondary source of the near-parabolic comet flux are stars penetrating the inner Oort cloud and providing impulses that create brief comet showers. Substantial stellar-induced showers occur approximately every 100 m.y. Less frequent (but stronger) impulses due to giant molecular clouds can also perturb comets from the inner cloud. These occur on timescales of approximately equal to 500 m.y. In contrast to these infrequent stochastic shower phenomena is the continuously varying tidal-induced flux due to the galaxy. As the Sun orbits the galactic center it undergoes quasiharmonic motion about the galactic midplane, which is superimposed on the small eccentricity, near-Keplerian motion in the plane having epicycle period approximately equal to 150 m.y. In the process the galactic tidal field on the Sun/cloud system will vary causing a modulation of the observable Oort cloud flux. We have created a model of the galactic matter distribution as it affects the solar motion over a time interval ranging from 300 m.y. in the past to 100 m.y. into the future. As constraints on the disk's compact dark matter component we require consistency with the following: (1) the observed galactic rotation curve, (2) today's flux distribution of new comets, (3) the studies of K-giant distributions, and (4) the periodicity found in the terrestrial cratering record. The adiabatically varying galactic tidal torque is then determined and used to predict the time dependence of the flux. We find that a model in which approximately half the disk matter is compact is consistent with these constraints. Under such circumstances the peak-to-trough flux variation will be approx. equal to 5:1 with a full width of 9 m.y. This variability will manifest in the terrestrial cratering record and is consistent with the observed cratering periodicity, if over half of the impacts on Earth are caused by comets or asteroids that originate in the outer Oort cloud.

Matese, J. J.↗

Analytical Voltage Sensitivity Analysis for Unbalanced Power Distribution System

Large scale integration of distributed energy resources and electric vehicles in a transactive energy environment present new challenges in terms of voltage stability and fluctuations in a power distribution system. The impact of different level of DER/EV penetration on the voltages across the network is typically quantified through voltage sensitivity analyses. Existing methods of voltage sensitivity analysis are computationally expensive and prior efforts to develop analytical approximation lacks generality and have not been effectively validated. The objective of this work is to provide a new analytical method of voltage sensitivity analysis that has low computational cost and also allows for stochastic analysis of voltage change. This paper first derives an analytical approximation of change in voltage at a particular bus due to change in power consumption at other bus in a radial three phase unbalanced power distribution system. Then, the proposed method is shown to be valid for different load configurations, which demonstrates its generality. The results from our analytical approach is validated via classical load flow simulation of the test system based on IEEE 37 bus network. The proposed method is shown to have good accuracy, and computation complexity is of order O(1), compared to O(n3) in classical sensitivity analysis approaches.

Munikoti, Sai↗

Adaptive multi-index collocation for uncertainty quantification and sensitivity analysis

In this paper, we present an adaptive algorithm to construct response surface approximations of high-fidelity models using a hierarchy of lower fidelity models. Our algorithm is based on multiindex stochastic collocation and automatically balances physical discretization error and response surface error to construct an approximation of model outputs. This surrogate can be used for uncertainty quantification (UQ) and sensitivity analysis (SA) at a fraction of the cost of a purely high-fidelity approach. We demonstrate the effectiveness of our algorithm on a canonical test problem from the UQ literature and a complex multi-physics model that simulates the performance of an integrated nozzle for an unmanned aerospace vehicle. We find that when the input-output response is sufficiently smooth our algorithm produces approximations that can be up to orders of magnitude more accurate than single fidelity approximations for a fixed computational budget.

97 MATHEMATICS AND COMPUTING↗

Stochastic Evolutionary Algorithms for Planning Robot Paths

A computer program implements stochastic evolutionary algorithms for planning and optimizing collision-free paths for robots and their jointed limbs. Stochastic evolutionary algorithms can be made to produce acceptably close approximations to exact, optimal solutions for path-planning problems while often demanding much less computation than do exhaustive-search and deterministic inverse-kinematics algorithms that have been used previously for this purpose. Hence, the present software is better suited for application aboard robots having limited computing capabilities (see figure). The stochastic aspect lies in the use of simulated annealing to (1) prevent trapping of an optimization algorithm in local minima of an energy-like error measure by which the fitness of a trial solution is evaluated while (2) ensuring that the entire multidimensional configuration and parameter space of the path-planning problem is sampled efficiently with respect to both robot joint angles and computation time. Simulated annealing is an established technique for avoiding local minima in multidimensional optimization problems, but has not, until now, been applied to planning collision-free robot paths by use of low-power computers.

Fink, Wolfgang↗