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 865 records · Page 48

A tutorial introduction to the statistical theory of turbulent plasmas, a half-century after Kadomtsev’s Plasma Turbulence and the resonance-broadening theory of Dupree and Weinstock

In honour of the 50th anniversary of the influential review/monograph on plasma turbulence by B. B. Kadomtsev as well as the seminal works of T. H. Dupree and J. Weinstock on resonance-broadening theory, an introductory tutorial is given about some highlights of the statistical–dynamical description of turbulent plasmas and fluids, including the ideas of nonlinear incoherent noise, coherent damping, and self-consistent dielectric response. The statistical closure problem is introduced. Incoherent noise and coherent damping are illustrated with a solvable model of passive advection. Self-consistency introduces turbulent polarization effects that are described by the dielectric function ${\mathcal{D}}$ . Dupree’s method of using ${\mathcal{D}}$ to estimate the saturation level of turbulence is described; then it is explained why a more complete theory that includes nonlinear noise is required. The general theory is best formulated in terms of Dyson equations for the covariance $C$ and an infinitesimal response function $R$ , which subsumes ${\mathcal{D}}$ . An important example is the direct-interaction approximation (DIA). It is shown how to use Novikov’s theorem to develop an $\boldsymbol{x}$ -space approach to the DIA that is complementary to the original $\boldsymbol{k}$ -space approach of Kraichnan. A dielectric function is defined for arbitrary quadratically nonlinear systems, including the Navier–Stokes equation, and an algorithm for determining the form of ${\mathcal{D}}$ in the DIA is sketched. The independent insights of Kadomtsev and Kraichnan about the problem of the DIA with random Galilean invariance are described. The mixing-length formula for drift-wave saturation is discussed in the context of closures that include nonlinear noise (shielded by ${\mathcal{D}}$ ). The role of $R$ in the calculation of the symmetry-breaking (zonostrophic) instability of homogeneous turbulence to the generation of inhomogeneous mean flows is addressed. The second-order cumulant expansion and the stochastic structural stability theory are also discussed in that context. In conclusion, various historical research threads are mentioned and representative entry points to the literature are given. In addition, some outstanding conceptual issues are enumerated.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Photoinduced correlations in stochastic dynamics of a solid-state ionic conductor

Photoexcitation by ultrashort laser pulses plays a crucial role in controlling reaction pathways, creating nonequilibrium material properties, and probing complex molecular dynamics. The photoresponse following a laser pulse is generally nonidentical between exposures due to spatiotemporal fluctuations or the stochastic nature of dynamical pathways. However, most ultrafast pump-probe experiments struggle to distinguish intrinsic sample fluctuations from extrinsic apparatus noise, often missing deviations from the averaged response. Leveraging the stability and high photon flux of time-resolved X-ray micro-diffraction at a synchrotron, we characterized stochastic photoinduced dynamics in a solid-state ionic conductor. By analyzing temporal evolutions of the lattice parameter of a single grain, we found that shot-to-shot fluctuations are not independent. Instead, correlations exist between nonequilibrium lattice trajectories following adjacent shots, with a characteristic correlation length of approximately 1500 shots, corresponding to an energy barrier of 0.4 ± 0.1 eV, close to the activation energy of lithium-ion diffusion.

36 MATERIALS SCIENCE↗

A General Framework for Bounding Approximate Dynamic Programming Schemes

For years, there has been interest in approximation methods for solving dynamic programming problems, because of the inherent complexity in computing optimal solutions characterized by Bellman’s principle of optimality. A wide range of approximate dynamic programming (ADP) methods now exists. It is of great interest to guarantee that the performance of an ADP scheme be at least some known fraction, say ß , of optimal. This letter introduces a general approach to bounding the performance of ADP methods, in this sense, in the stochastic setting. The approach is based on new results for bounding greedy solutions in string optimization problems, where one has to choose a string (ordered set) of actions to maximize an objective function. This bounding technique is inspired by submodularity theory, but submodularity is not required for establishing bounds. Instead, the bounding is based on quantifying certain notions of curvature of string functions; the smaller the curvatures the better the bound. The key insight is that any ADP scheme is a greedy scheme for some surrogate string objective function that coincides in its optimal solution and value with those of the original optimal control problem. The ADP scheme then yields to the bounding technique mentioned above, and the curvatures of the surrogate objective determine the value ß of the bound. The surrogate objective and its curvatures depend on the specific ADP.

discrete event systems↗

Balanced Excitatory and Inhibitory Synaptic Currents Promote Efficient Coding and Metabolic Efficiency

A balance between excitatory and inhibitory synaptic currents is thought to be important for several aspects of information processing in cortical neurons in vivo, including gain control, bandwidth and receptive field structure. These factors will affect the firing rate of cortical neurons and their reliability, with consequences for their information coding and energy consumption. Yet how balanced synaptic currents contribute to the coding efficiency and energy efficiency of cortical neurons remains unclear. We used single compartment computational models with stochastic voltage-gated ion channels to determine whether synaptic regimes that produce balanced excitatory and inhibitory currents have specific advantages over other input regimes. Specifically, we compared models with only excitatory synaptic inputs to those with equal excitatory and inhibitory conductances, and stronger inhibitory than excitatory conductances (i.e. approximately balanced synaptic currents). Using these models, we show that balanced synaptic currents evoke fewer spikes per second than excitatory inputs alone or equal excitatory and inhibitory conductances. However, spikes evoked by balanced synaptic inputs are more informative (bits/spike), so that spike trains evoked by all three regimes have similar information rates (bits/s). Consequently, because spikes dominate the energy consumption of our computational models, approximately balanced synaptic currents are also more energy efficient than other synaptic regimes. Thus, by producing fewer, more informative spikes approximately balanced synaptic currents in cortical neurons can promote both coding efficiency and energy efficiency.

59 BASIC BIOLOGICAL SCIENCES↗

Analysis of bilinear noise models in circuits and devices

There are a number of applications in which linear noise models are inappropriate. In the paper, the use of bilinear noise models in circuits and devices is considered. Several physical problems are studied in this framework. These include circuits involving varying parameters (such as variable resistance circuits constructed using field-effect transistors), the effect of switching jitter on sampled data system performance and communication systems involving voltage-controlled oscillators and phase-lock loops. In addition, several types of analytical techniques for stochastic bilinear systems are considered. Specifically, the moment equations of Brockett for bilinear systems driven by white noise are discussed, and closed-form expressions for certain bilinear systems (those that evolve an Abelian or solvable Lie groups) driven by white or colored noise are derived. In addition, an approximate statistical technique involving the use of harmonic expansions is described.

Willsky, A. S.↗

Optical Properties of Quantum Vacuum. Space-Time Engineering

The propagation of electromagnetic waves in the vacuum is considered taking into account quantum fluctuations in the limits of Maxwell-Langevin (ML) type stochastic differential equations. For a model of fluctuations, type of 'white noise', using ML equations a partial differential equation of second order is obtained which describes the quantum distribution of virtual particles in vacuum. It is proved that in order to satisfy observed facts, the Lamb Shift etc, the virtual particles should be quantized in unperturbed vacuum. It is shown that the quantized virtual particles in toto (approximately 86 percent) are condensed on the 'ground state' energy level. It is proved that the extension of Maxwell electrodynamics with inclusion of quantum vacuum fluctuations may be constructed on a 6D space-time continuum, where 4D is Minkowski space-time and 2D is a compactified subspace. In detail is studied of vacuum's refraction indexes under the influence of external electromagnetic fields.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

PLANETESIMAL AND PROTOPLANET DYNAMICS IN A TURBULENT PROTOPLANETARY DISK: IDEAL UNSTRATIFIED DISKS

The dynamics of planetesimals and planetary cores may be strongly influenced by density perturbations driven by magneto-rotational turbulence in their natal protoplanetary gas disks. Using the local shearing box approximation, we perform numerical simulations of planetesimals moving as massless particles in a turbulent, magnetized, unstratified gas disk. Our fiducial disk model shows turbulent accretion characterized by a Shakura-Sunyaev viscosity parameter of alpha approx 10{sup -2}, with rms density perturbations of approx10%. We measure the statistical evolution of particle orbital properties in our simulations including mean radius, eccentricity, and velocity dispersion. We confirm random walk growth in time of all three properties, the first time that this has been done with direct orbital integration in a local model. We find that the growth rate increases with the box size used at least up to boxes of eight scale heights in horizontal size. However, even our largest boxes show velocity dispersions sufficiently low that collisional destruction of planetesimals should be unimportant in the inner disk throughout its lifetime. Our direct integrations agree with earlier torque measurements showing that type I migration dominates over diffusive migration by stochastic torques for most objects in the planetary core and terrestrial planet mass range. Diffusive migration remains important for objects in the mass range of kilometer-sized planetesimals. Discrepancies in the derived magnitude of turbulence between local and global simulations of magneto-rotationally unstable disks remains an open issue, with important consequences for planet formation scenarios.

79 ASTRONOMY AND ASTROPHYSICS↗

Comparison between microscopic methods for finite-temperature Bose gases

We analyze the equilibrium properties of a weakly interacting, trapped quasi-one-dimensional Bose gas at finite temperatures and compare different theoretical approaches. We focus in particular on two stochastic theories: a number-conserving Bogoliubov (NCB) approach and a stochastic Gross-Pitaevskii equation (SGPE) that have been extensively used in numerical simulations. Equilibrium properties like density profiles, correlation functions, and the condensate statistics are compared to predictions based upon a number of alternative theories. We find that due to thermal phase fluctuations, and the corresponding condensate depletion, the NCB approach loses its validity at relatively low temperatures. This can be attributed to the change in the Bogoliubov spectrum, as the condensate gets thermally depleted, and to large fluctuations beyond perturbation theory. Although the two stochastic theories are built on different thermodynamic ensembles (NCB, canonical; SGPE, grand-canonical), they yield the correct condensate statistics in a large Bose-Einstein condensate (BEC) (strong enough particle interactions). For smaller systems, the SGPE results are prone to anomalously large number fluctuations, well known for the grand-canonical, ideal Bose gas. Based on the comparison of the above theories to the modified Popov approach, we propose a simple procedure for approximately extracting the Penrose-Onsager condensate from first- and second-order correlation functions that is both computationally convenient and of potential use to experimentalists. This also clarifies the link between condensate and quasicondensate in the Popov theory of low-dimensional systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Distribution-Agnostic Stochastic Optimal Power Flow for Distribution Grids

This paper outlines a data-driven, distributionally robust approach to solve chance-constrained AC optimal power flow problems in distribution networks. Uncertain forecasts for loads and power generated by photovoltaic (PV) systems are considered, with the goal of minimizing PV curtailment while meeting power flow and voltage regulation constraints. A data- driven approach is utilized to develop a distributionally robust conservative convex approximation of the chance-constraints; particularly, the mean and covariance matrix of the forecast errors are updated online, and leveraged to enforce voltage regulation with predetermined probability via Chebyshev-based bounds. By combining an accurate linear approximation of the AC power flow equations with the distributionally robust chance constraint reformulation, the resulting optimization problem becomes convex and computationally tractable.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Social network structure and the spread of complex contagions from a population genetics perspective

Ideas, behaviors, and opinions spread through social networks. If the probability of spreading to a new individual is a non-linear function of the fraction of the individuals’ affected neighbors, such a spreading process becomes a “complex contagion”. This non-linearity does not typically appear with physically spreading infections, but instead can emerge when the concept that is spreading is subject to game theoretical considerations (e.g. for choices of strategy or behavior) or psychological effects such as social reinforcement and other forms of peer influence (e.g. for ideas, preferences, or opinions). Here we study how the stochastic dynamics of such complex contagions are affected by the underlying network structure. Motivated by simulations of complex contagions on real social networks, we present a framework for analyzing the statistics of contagions with arbitrary non-linear adoption probabilities based on the mathematical tools of population genetics. The central idea is to use an effective lower-dimensional diffusion process to approximate the statistics of the contagion. This leads to a tradeoff between the effects of ”selection” (microscopic tendencies for an idea to spread or die out), random drift, and network structure. Our framework illustrates intuitively several key properties of complex contagions: stronger community structure and network sparsity can significantly enhance the spread, while broad degree distributions dampen the effect of selection compared to random drift. Finally, we show that some structural features can exhibit critical values that demarcate regimes where global contagions become possible for networks of arbitrary size. Our results draw parallels between the competition of genes in a population and memes in a world of minds and ideas. Our tools provide insight into the spread of information, behaviors, and ideas via social influence, and highlight the role of macroscopic network structure in determining their fate.

59 BASIC BIOLOGICAL SCIENCES↗

Physically consistent simulation of mesoscale chemical kinetics: The non-negative FIS-{alpha} method

Biochemical pathways involving chemical kinetics in medium concentrations (i.e., at mesoscale) of the reacting molecules can be approximated as chemical Langevin equations (CLE) systems. We address the physically consistent non-negative simulation of the CLE sample paths as well as the issue of non-Lipschitz diffusion coefficients when a species approaches depletion and any stiffness due to faster reactions. The non-negative Fully Implicit Stochastic {alpha} (FIS {alpha}) method in which stopped reaction channels due to depleted reactants are deleted until a reactant concentration rises again, for non-negativity preservation and in which a positive definite Jacobian is maintained to deal with possible stiffness, is proposed and analysed. The method is illustrated with the computation of active Protein Kinase C response in the Protein Kinase C pathway.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sequential Learning of Active Subspaces

This study shows that in recent years, active subspace methods (ASMs) have become a popular means of performing subspace sensitivity analysis on black-box functions. Naively applied, however, ASMs require gradient evaluations of the target function. In the event of noisy, expensive, or stochastic simulators, evaluating gradients via finite differencing may be infeasible. In such cases, often a surrogate model is employed, on which finite differencing is performed. When the surrogate model is a Gaussian process (GP), we show that the ASM estimator is available in closed form, rendering the finite-difference approximation unnecessary. We use our closed-form solution to develop acquisition functions focused on sequential learning tailored to sensitivity analysis on top of ASMs. We also show that the traditional ASM estimator may be viewed as a method of moments estimator for a certain class of GPs. We demonstrate how uncertainty on GP hyperparameters may be propagated to uncertainty on the sensitivity analysis, allowing model-based confidence intervals on the active subspace. Our methodological developments are illustrated on several examples.

97 MATHEMATICS AND COMPUTING↗

Optimal Proactive Vehicle Relocation for On-Demand Mobility Service with Deep Convolution-LSTM Network

This study develops an innovative model for inferring optimal proactive relocation strategy for empty vehicles of on-demand mobility service (OMS) directly from past observations of passenger demand. The output of our model is a row stochastic relocation matrix which gives the probability that an empty vehicle should be relocated from location i to location j at any given time. The matrix itself is high-dimensional and therefore challenging to obtain accurate estimation with traditional machine learning approach. Our model proposes the low-rank approximation of the relocation matrix, and introduces the deep convolution-LSTM network which extracts low-level spatial and temporal features from past demand observations for best restoration of the actual low rank approximation vector. The model is trained by deriving the optimal matching strategies from one year of real-world trip data. The results show that our model is able to predict the low-rank approximation of the relocation matrix with 4% of mean absolute error, may reduce the relocation cost by 20%-45% as compared to the real-world observations and is 50% optimal as compared to the global optimal matching with perfect information.

Lei, Zengxiang↗

Strategic Analysis of Complex Security Scenarios

Many advanced technical tools are available to prevent attacks on national infrastructure. Nevertheless, while traditional analyses of security problems have succeeded in producing good technical solutions, they have often ignored the human factor integral to these problems. Human attackers (who may be individuals or state-level attackers) expend substantial effort to breach security because they have the incentive for doing so. People involved in implementing security follow individual incentives, which need not align with global security concerns; consequently, desired security solutions are often implemented poorly, or not at all. This complex interplay between individual incentives and global (organizational and/or national) goals can be modeled and analyzed using game theoretic techniques. By analyzing not only what is possible, but also what is motivated, a holistic approach to security problems can be developed, informing policy and providing tools to policy makers. We study game theoretic models that unify several current incentive-based approaches to security, and develop simulation-based and mathematical optimization methods for analyzing such models that exploit the high-performance computing capabilities at Sandia. Our first model studies security in interdependent settings, offering a scalable local search heuristic to approximate optimal security decisions in general, and a linear programming approach, coupled with simulations of consequences, to optimally compute security in an important special case. Our second class of models addresses security patrolling problems when an adversary gets to observe the patrol location. We present a general framework, based on stochastic games, for computing optimal security policies in such settings, and present more scalable tools that apply in the important special cases. Our third contribution is a model of security that involves many defenders, but only models non-adaptive attackers (or natural disasters, inadvertent errors, etc). In this model, we demonstrate that the security decisions of many players result in global security configuration that is not very far from optimal, and is much more resilient to environment changes that an optimal solution. This positive effect dissipates, however, when the number of decision makers becomes too large.

Vorobeychik, Yevgeniy↗

Improving Project Management with Simulation and Completion Distribution Functions

Despite the critical importance of project completion timeliness, management practices in place today remain inadequate for addressing the persistent problem of project completion tardiness. A major culprit in late projects is uncertainty, which most, if not all, projects are inherently subject to. This uncertainty resides in the estimates for activity durations, the occurrence of unplanned and unforeseen events, and the availability of critical resources. In response to this problem, this research developed a comprehensive simulation based methodology for conducting quantitative project completion time risk analysis. It is called the Project Assessment by Simulation Technique (PAST). This new tool enables project stakeholders to visualize uncertainty or risk, i.e. the likelihood of their project completing late and the magnitude of the lateness, by providing them with a completion time distribution function of their projects. Discrete event simulation is used within PAST to determine the completion distribution function for the project of interest. The simulation is populated with both deterministic and stochastic elements. The deterministic inputs include planned project activities, precedence requirements, and resource requirements. The stochastic inputs include activity duration growth distributions, probabilities for events that can impact the project, and other dynamic constraints that may be placed upon project activities and milestones. These stochastic inputs are based upon past data from similar projects. The time for an entity to complete the simulation network, subject to both the deterministic and stochastic factors, represents the time to complete the project. Repeating the simulation hundreds or thousands of times allows one to create the project completion distribution function. The Project Assessment by Simulation Technique was demonstrated to be effective for the on-going NASA project to assemble the International Space Station. Approximately $500 million per month is being spent on this project, which is scheduled to complete by 2010. NASA project stakeholders participated in determining and managing completion distribution functions produced from PAST. The first result was that project stakeholders improved project completion risk awareness. Secondly, using PAST, mitigation options were analyzed to improve project completion performance and reduce total project cost.

Cates, Grant R.↗

Optimization of structures undergoing harmonic or stochastic excitation

The optimal design was investigated of simple structures subjected to dynamic loads, with constraints on the structures' responses. Optimal designs were examined for one dimensional structures excited by harmonically oscillating loads, similar structures excited by white noise, and a wing in the presence of continuous atmospheric turbulence. The first has constraints on the maximum allowable stress while the last two place bounds on the probability of failure of the structure. Approximations were made to replace the time parameter with a frequency parameter. For the first problem, this involved the steady state response, and in the remaining cases, power spectral techniques were employed to find the root mean square values of the responses. Optimal solutions were found by using computer algorithms which combined finite elements methods with optimization techniques based on mathematical programming. It was found that the inertial loads for these dynamic problems result in optimal structures that are radically different from those obtained for structures loaded statically by forces of comparable magnitude.

Johnson, E. H.↗

Quantum Package 2.0: An Open-Source Determinant-Driven Suite of Programs

Quantum chemistry is a discipline which relies heavily on very expensive numerical computations. The scaling of correlated wave function methods lies, in their standard implementation, between O(N-5) and O(e(N)), where N is proportional to the system size. Therefore, performing accurate calculations on chemically meaningful systems requires (i) approximations that can lower the computational scaling and (ii) efficient implementations that take advantage of modern massively parallel architectures. QUANTUM PACKAGE is an open-source programming environment for quantum chemistry specially designed for wave function methods. Its main goal is the development of determinant-driven selected configuration interaction (sCI) methods and multireference second-order perturbation theory (PT2). The determinant-driven framework allows the programmer to include any arbitrary set of determinants in the reference space, hence providing greater methodological freedom. The sCI method implemented in QUANTUM PACKAGE is based on the CIPSI (Configuration Interaction using a Perturbative Selection made Iteratively) algorithm which complements the variational sCI energy with a PT2 correction. Additional external plugins have been recently added to perform calculations with multireference coupled cluster theory and range-separated density-functional theory. All the programs are developed with the IRPF90 code generator, which simplifies collaborative work and the development of new features. QUANTUM PACKAGE strives to allow easy implementation and experimentation of new methods, while making parallel computation as simple and efficient as possible on modern supercomputer architectures. Currently, the code enables, routinely, to realize runs on roughly 2 000 CPU cores, with tens of millions of determinants in the reference space. Moreover, we have been able to push up to 12 288 cores in order to test its parallel efficiency. In the present manuscript, we also introduce some key new developments: (i) a renormalized second-order perturbative correction for efficient extrapolation to the full CI limit and (ii) a stochastic version of the CIPSI selection performed simultaneously to the PT2 calculation at no extra cost.

Garniron, Yann↗

EELS Studies of Cerium Electrolyte Reveal Substantial Solute Concentration Effects in Graphene Liquid Cells

Graphene liquid cell transmission electron microscopy is a powerful technique to visualize nanoscale dynamics and transformations at atomic resolution. However, the solution in liquid cells is known to be affected by radiolysis, and the stochastic formation of graphene liquid cells raises questions about the solution chemistry in individual pockets. In this study, electron energy loss spectroscopy (EELS) was used to evaluate a model encapsulated solution, aqueous CeCl 3 . First, the ratio between the O K-edge and Ce M-edge was used to approximate the concentration of cerium salt in the graphene liquid cell. It was determined that the ratio between oxygen and cerium was orders of magnitude lower than what is expected for a dilute solution, indicating that the encapsulated solution is highly concentrated. To probe how this affects the chemistry within graphene liquid cells, the oxidation of Ce 3+ was measured using time-resolved parallel EELS. Here, it was determined that Ce 3+ oxidizes faster under high electron fluxes, but reaches the same steady-state Ce 4+ concentration regardless of flux. The time-resolved concentration profiles enabled direct comparison to radiolysis models, which indicate rate constants and g-values of certain molecular species are substantially different in the highly concentrated environment. Finally, electron flux-dependent gold nanocrystal etching trajectories showed that gold nanocrystals etch faster at higher electron fluxes, correlating well with the Ce 3+ oxidation kinetics. Understanding the effects of the highly concentrated solution in graphene liquid cells will provide new insight on previous studies and may open up opportunities to systematically study systems in highly concentrated solutions at high resolution.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗