Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 109 records · Page 6

Stochastic estimation of organized structures in turbulent channel flow

Linear stochastic estimation is used to approximate the conditional vector fields associated with high Reynolds stress producing events in numerically simulated turbulent channel flow. Joint probability density distributions of u-v are presented for y(+) between 1.35 and 180, and at each position the u-v values that make the greatest contributions to the average uv3 are used to define conditional ejection- and sweep-type events. In the y-z plane the conditional fields appear to be pairs of counter-rotating vortices. When the conditional event defined by the weighted probability density function is specified at a point close to the wall, the spacing and size of these eddies are consistent with the accepted wall streak spacing. As this point moves outwards, the eddy size increases significantly. An abrupt change in the flow angle occurs in the buffer layer and may indicate transition from streamwise oriented wall layer structures to hairpin vortices characterizing the outer layer.

Moin, P.↗

Modern CACSD using the Robust-Control Toolbox

The Robust-Control Toolbox is a collection of 40 M-files which extend the capability of PC/PRO-MATLAB to do modern multivariable robust control system design. Included are robust analysis tools like singular values and structured singular values, robust synthesis tools like continuous/discrete H(exp 2)/H infinity synthesis and Linear Quadratic Gaussian Loop Transfer Recovery methods and a variety of robust model reduction tools such as Hankel approximation, balanced truncation and balanced stochastic truncation, etc. The capabilities of the toolbox are described and illustated with examples to show how easily they can be used in practice. Examples include structured singular value analysis, H infinity loop-shaping and large space structure model reduction.

Chiang, Richard Y.↗

An X-Ray Study of Grain Evolution behind Non-Radiative Shock

We model the dynamics, the destruction by sputtering, and the infrared (IR) emission from collisionally heated dust grains in fast (>/= 400 km s(exp -1)) astrophysical shocks in order to develop IR diagnostics for the destruction of grains in these environments. The calculations take into account the feedback from sputtering and IR emission on the gas-phase abundances, the cooling, and the ionization and thermal structure of the shock. Sputtering changes the initial grain size distribution, creating a deficiency of small (radius <50 A) grains compared to their preshock abundances. The altered grain size distribution depends on shock velocity and the density of the interstellar medium. Dust particles with sizes below approximately equal 300 A are stochastically heated, undergo temperature fluctuations, and radiate an excess of near-infrared emission (i </= 40 (micron)meter) over that expected for grains in thermal equilibrium. This near-infrared excess is a measure of the abundance of small grains and therefore a powerful diagnostic for the amount of destruction the grains were subjected to in the shock. We present here IR spectra from collisionally heated dust for a variety of shocks, and depict the changes in the spectra as a function of postshock column density. Our studies compliment those of Vancura et at. that examined the effects of the release of the sputtered refractory elements on the ultraviolet and X-ray emission. Multiwavelength observations at X-ray, Ultraviolet (UV), and IR wavelengths are therefore essential in piecing together a comprehensive picture of the physics of grain destruction in fast astrophysical shocks.

Vancura, Olaf↗

Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks

For hard computational problems, stochastic local search has proven to be a competitive approach to finding optimal or approximately optimal problem solutions. Two key research questions for stochastic local search algorithms are: Which algorithms are effective for initialization? When should the search process be restarted? In the present work we investigate these research questions in the context of approximate computation of most probable explanations (MPEs) in Bayesian networks (BNs). We introduce a novel approach, based on the Viterbi algorithm, to explanation initialization in BNs. While the Viterbi algorithm works on sequences and trees, our approach works on BNs with arbitrary topologies. We also give a novel formalization of stochastic local search, with focus on initialization and restart, using probability theory and mixture models. Experimentally, we apply our methods to the problem of MPE computation, using a stochastic local search algorithm known as Stochastic Greedy Search. By carefully optimizing both initialization and restart, we reduce the MPE search time for application BNs by several orders of magnitude compared to using uniform at random initialization without restart. On several BNs from applications, the performance of Stochastic Greedy Search is competitive with clique tree clustering, a state-of-the-art exact algorithm used for MPE computation in BNs.

Mengshoel, Ole J.↗

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↗

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↗

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↗

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↗

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↗

Towards a Mass-Consistent Methodology for Realistic Melting Hydrometeor Retrieval

To address the acute challenge posed by the melting layer to accurate surface precipitation retrievals from space, we en-sure the compositional consistency in ice, liquid, and total masses of synthetic melting hydrometeors with a method of stochastic compensation. The method is applied to simulated melting hydrometeors prior to calculating their scattering properties using the discrete dipole approximation (DDA). We investigate the impact of this stochastic compensation to calculated scattering properties by contrasting it with a naïve approach and report our findings.

precipitation remote sensing↗

Guidance and Control strategies for aerospace vehicles

A neighboring optimal guidance scheme was devised for a nonlinear dynamic system with stochastic inputs and perfect measurements as applicable to fuel optimal control of an aeroassisted orbital transfer vehicle. For the deterministic nonlinear dynamic system describing the atmospheric maneuver, a nominal trajectory was determined. Then, a neighboring, optimal guidance scheme was obtained for open loop and closed loop control configurations. Taking modelling uncertainties into account, a linear, stochastic, neighboring optimal guidance scheme was devised. Finally, the optimal trajectory was approximated as the sum of the deterministic nominal trajectory and the stochastic neighboring optimal solution. Numerical results are presented for a typical vehicle. A fuel-optimal control problem in aeroassisted noncoplanar orbital transfer is also addressed. The equations of motion for the atmospheric maneuver are nonlinear and the optimal (nominal) trajectory and control are obtained. In order to follow the nominal trajectory under actual conditions, a neighboring optimum guidance scheme is designed using linear quadratic regulator theory for onboard real-time implementation. One of the state variables is used as the independent variable in reference to the time. The weighting matrices in the performance index are chosen by a combination of a heuristic method and an optimal modal approach. The necessary feedback control law is obtained in order to minimize the deviations from the nominal conditions.

Hibey, J. L.↗

Mercury’s Chaotic Secular Evolution as a Subdiffusive Process

Abstract Mercury’s orbit can destabilize, generally resulting in a collision with either Venus or the Sun. Chaotic evolution can causeg 1 to decrease to the approximately constant value ofg 5 and create a resonance. Previous work has approximated the variation ing 1 as stochastic diffusion, which leads to a phenomological model that can reproduce the Mercury instability statistics of secular andN-body models on timescales longer than 10 Gyr. Here we show that the diffusive model significantly underpredicts the Mercury instability probability on timescales less than 5 Gyr, the remaining lifespan of the solar system. This is becauseg 1 exhibits larger variations on short timescales than the diffusive model would suggest. To better model the variations on short timescales, we build a new subdiffusive phenomological model forg 1 . Subdiffusion is similar to diffusion but exhibits larger displacements on short timescales and smaller displacements on long timescales. We choose model parameters based on the behavior of theg 1 trajectories in theN-body simulations, leading to a tuned model that can reproduce Mercury instability statistics from 1–40 Gyr. This work motivates fundamental questions in solar system dynamics: why does subdiffusion better approximate the variation ing 1 than standard diffusion? Why is there an upper bound ong 1 , but not a lower bound that would prevent it from reachingg 5 ?

Astronomy & Astrophysics↗

Dynamical downfolding for localized quantum states

We introduce an approach to treat localized correlated electronic states in the otherwise weakly correlated host medium. Here, the environment is dynamically downfolded on the correlated subspace. It is captured via renormalization of one and two quasiparticle interaction terms which are evaluated using many-body perturbation theory. We outline the strategy on how to take the dynamical effects into account by going beyond the static limit approximation. Further, we introduce an efficient stochastic implementation that enables treating the host environment with a large number of electrons at a minimal computational cost. For a small explicitly correlated subspace, the dynamical effects are critical. We demonstrate the methodology by reproducing optical excitations in the negatively charged NV center defect in diamond, that agree with experimental results.

36 MATERIALS SCIENCE↗

Two- and three-meson scattering amplitudes with physical quark masses from lattice QCD

We study systems of two and three mesons composed of pions and kaons at maximal isospin using four CLS ensembles with 𝑎 ≈ 0.063 fm, including one with approximately physical quark masses. Using the stochastic Laplacian-Heaviside method, we determine the energy spectrum of these systems including many levels in different momentum frames and irreducible representations. Using the relativistic two- and three-body finite-volume formalism, we constrain the two- and three-meson K matrices, including not only the leading 𝑠 wave, but also 𝑝 and 𝑑 waves. By solving the three-body integral equations, we determine, for the first time, the physical-point scattering amplitudes for 3⁢𝜋 + , 3⁢𝐾 + , 𝜋 + ⁢𝜋 + ⁢𝐾 + , and 𝐾 + ⁢𝐾 + ⁢𝜋 + systems. These are determined for total angular momentum 𝐽 𝑃 = 0 − , 1 + , and 2 − . We also obtain accurate results for 2⁢𝜋 + , 𝜋 + ⁢𝐾 + , and 2⁢𝐾 + phase shifts. We compare our results to chiral perturbation theory and to phenomenological fits.

FOS: Physical sciences↗

Flowgraph techniques for closed systems.

Flowgraph techniques for closed systems, discussing properties, approximation method, topology equation, frequency response, constraints, oscillatory and stochastic processes, etc

HARMONIC OSCILLATOR↗

Parameter estimation for terrain modeling from gradient data

A method is developed for modeling terrain surfaces for use on an unmanned Martian roving vehicle. The modeling procedure employs a two-step process which uses gradient as well as height data in order to improve the accuracy of the model's gradient. Least square approximation is used in order to stochastically determine the parameters which describe the modeled surface. A complete error analysis of the modeling procedure is included which determines the effect of instrumental measurement errors on the model's accuracy. Computer simulation is used as a means of testing the entire modeling process which includes the acquisition of data points, the two-step modeling process and the error analysis. Finally, to illustrate the procedure, a numerical example is included.

Dangelo, K. R.↗