Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Stochastic”

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 595 records · Page 33
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Logical error rates for the surface code under a mixed coherent and stochastic circuit-level noise model inspired by trapped ions

With fault-tolerant quantum computing (FTQC) on the horizon, it is critical to understand sources of logical errors in plausible hardware implementations of quantum error-correcting codes. Detailed error modeling of computational instructions on particular FTQC architectures will enable the better prediction of error propagation in FT-encoded quantum circuits while revealing where greater attention is needed in hardware design. In this work, we consider logical error rates for the surface code implemented on a hypothetical grid-based trapped-ion quantum charge-coupled device architecture. Specifically, we construct logical channels for the idling surface code and examine its diamond error under a mixed coherent and stochastic circuit-level noise model inspired by trapped ions. We include the coherent dephasing noise that is known to accumulate during physical qubit idling and transport in these systems, determining idling and transport durations using the time-resolved output of an open-source trapped-ion surface code compiler. To estimate expectation values of logical Pauli observables following hardware circuits containing non-Clifford sources of noise, we utilize a Monte Carlo technique to sample from an underlying quasiprobability distribution of Clifford circuits that we independently simulate in a phase-sensitive fashion. We verify error suppression up to code distance 𝑑 = 11 at coherent dephasing rates near and below those of current-generation trapped-ion quantum computers and find that logical error rates align with those of analogous fully stochastic simulations in this regime. Exploring higher dephasing rates at 𝑑 = 3−5, we find evidence for growing coherent rotations about all three logical Pauli axes, increased diagonal logical error process matrix elements relative to those of stochastic simulations, and a reduced dephasing rate threshold. Overall, our work paves a way toward realistic hardware emulation of small fault-tolerant quantum processes, e.g., members of an FTQC instruction set.

Quantum benchmarking↗
DOE OSTI2025

Stochastic noise can be helpful for variational quantum algorithms

Saddle points constitute a crucial challenge for first-order gradient descent algorithms. In notions of classical machine learning, they are avoided, for example, by means of stochastic gradient descent methods. In this work, we provide evidence that the saddle-points problem can be naturally avoided in variational quantum algorithms by exploiting the presence of stochasticity. We prove convergence guarantees and present practical examples in numerical simulations and on quantum hardware. We argue that the natural stochasticity of variational algorithms can be beneficial for avoiding strict saddle points, i.e., those saddle points with at least one negative Hessian eigenvalue. This insight that some levels of shot noise could help is expected to add a new perspective to notions of near-term variational quantum algorithms. Published by the American Physical Society 2025

Liu, Junyu↗
DOE OSTI2024

Searching for cosmological stochastic backgrounds by notching out resolvable compact binary foregrounds with next-generation gravitational-wave detectors

Stochastic gravitational-wave backgrounds can be of either cosmological or astrophysical origin. The detection of an astrophysical stochastic gravitational-wave background with ground-based interferometers is expected in the near future. Perhaps even more excitingly, the detection of stochastic backgrounds of cosmological origin by future ground-based interferometers could reveal invaluable information about the early Universe. From this perspective, the astrophysical background is a foreground that can prevent the extraction of this information from the data. In this paper, we revisit a time-frequency domain notching procedure previously proposed to remove the astrophysical foreground in the context of next-generation ground-based detectors, but we consider the more realistic scenario where we remove individually detectable signals by taking into account the uncertainty in the estimation of their parameters. We find that time-frequency domain masks can still efficiently remove the astrophysical foreground and suppress it to about 5% of its original level. Further removal of the foreground formed by unresolvable events (in particular, unresolvable binary neutron stars), which is about 10 times larger than the residual foreground from realistic notching, would require detector sensitivity improvements. Therefore, the main limitation in the search for a cosmological background is the unresolvable foreground itself, and not the residual of the notching procedure.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

Search for Tensor, Vector, and Scalar Polarizations in the Stochastic Gravitational-Wave Background

The detection of gravitational waves with Advanced LIGO and Advanced Virgo has enabled new tests of general relativity, including direct study of the polarization of gravitational waves. Although general relativity allows for only two tensor gravitational-wave polarizations, general metric theories can additionally predict two vector and two scalar polarizations. The polarization of gravitational waves is encoded in the spectral shape of the stochastic gravitational-wave background, formed by the superposition of cosmological and individually unresolved astrophysical sources. Using data recorded by Advanced LIGO during its first observing run, we search for a stochastic background of generically polarized gravitational waves. We determine no evidence for a background of any polarization, and place the first direct bounds on the contributions of vector and scalar polarizations to the stochastic background. Under log-uniform priors for the energy in each polarization, we limit the energy densities of tensor, vector, and scalar modes at 95% credibility to Ω$^{T}_{0}$ < 5.58 × 10 -8 , Ω$^{V}_{0}$ < 6.35 × 10 -8 , and Ω$^{S}_{0}$ < 1.08 × 10 -7 at a reference frequency f 0 = 25 Hz.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2015

Stochastic Spectral Descent for Discrete Graphical Models

Interest in deep probabilistic graphical models has in-creased in recent years, due to their state-of-the-art performance on many machine learning applications. Such models are typically trained with the stochastic gradient method, which can take a significant number of iterations to converge. Since the computational cost of gradient estimation is prohibitive even for modestly sized models, training becomes slow and practically usable models are kept small. In this paper we propose a new, largely tuning-free algorithm to address this problem. Our approach derives novel majorization bounds based on the Schatten- norm. Intriguingly, the minimizers of these bounds can be interpreted as gradient methods in a non-Euclidean space. We thus propose using a stochastic gradient method in non-Euclidean space. We both provide simple conditions under which our algorithm is guaranteed to converge, and demonstrate empirically that our algorithm leads to dramatically faster training and improved predictive ability compared to stochastic gradient descent for both directed and undirected graphical models.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Stochastic Pricing Game for Aggregated Demand Response Considering Comfort Level

In recent years, demand response (DR) has been explored as a fundamental strategy for demand-side management due to its advantages in mediating intermittency of renewable energy generation, load shifting, etc. To engage customers in DR programs, several deterministic price-based DR strategies have been developed and implemented. However, the stochastic weather conditions and occupants' consumption behaviors often make the deterministic solution less robust to uncertainties. In this paper, with the consideration of the uncertainties, a stochastic Stackelberg game is proposed to model the price-demand negotiation between a distributed system operator and load aggregators, where the virtual battery constraints are extracted from the building thermostatically controlled loads (TCLs)‘ characteristics to guarantee comfortable TCLs' levels. Following the negotiation, a priority-based control method is used to allocate the optimal aggregated power DR profile at the building level and track the power signal. Several groups of experiments have demonstrated the effectiveness and robustness of the stochastic solutions.

Chen, Yang↗
DOE OSTI2017

Generation Expansion Planning With Large Amounts of Wind Power via Decision-Dependent Stochastic Programming

Power generation expansion planning needs to deal with future uncertainties carefully, given that the invested generation assets will be in operation for a long time. Many stochastic programming models have been proposed to tackle this challenge. However, most previous works assume predetermined future uncertainties (i.e., fixed random outcomes with given probabilities). In several recent studies of generation assets' planning (e.g., thermal versus renewable), new findings show that the investment decisions could affect the future uncertainties as well. To this end, this paper proposes a multistage decision-dependent stochastic optimization model for long-term large-scale generation expansion planning, where large amounts of wind power are involved. In the decision-dependent model, the future uncertainties are not only affecting but also affected by the current decisions. In particular, the probability distribution function is determined by not only input parameters but also decision variables. To deal with the nonlinear constraints in our model, a quasi-exact solution approach is then introduced to reformulate the multistage stochastic investment model to a mixed-integer linear programming model. The wind penetration, investment decisions, and the optimality of the decision-dependent model are evaluated in a series of multistage case studies. The results show that the proposed decision-dependent model provides effective optimization solutions for long-term generation expansion planning.

Zhan, Yiduo↗
DOE OSTI2023

Multi-Stage Modeling With Recourse Decisions for Solving Stochastic Complementarity Problems With an Application in Energy

This paper presents a multi-stage model with recourse decisions for solving complementarity problems in a competitive electricity market under uncertainty, while also considering renewable energy technologies and battery storage utilization. The model is based on a Nash-Cournot formulation of imperfect competition among power producers. We analyze the value of variable renewable energy (VRE) and battery storage under different uncertainties, such as demand level and VRE availability. To illustrate the proposed model, we apply it to three- bus five-player model and analyze different cases varying costs, including a user-optimal perspective (with market power) and a system-optimal perspective (with central planning). We also consider the potential for congestion in the system by restricting the transmission capacity between a single interface that connects two buses. Our findings show that increasing the battery storage capacity results in a decrease in the need for perfect information about future uncertainties. Additionally, as the model allows for more uncertainty, it becomes more apparent that the stochastic mixed complementarity problem (MCP) has an advantage over a deterministic equivalent. We propose the use of the Value of the Stochastic Equilibrium Solution (VSES) as a quality metric to compare the stochastic MCP with its deterministic equivalent. Overall, expanding battery storage capacity can lower the maximum, mean, and variance values of delivered prices, but there are diminishing returns to this approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Analysis and Mitigation of Cascading Failures Using a Stochastic Interaction Graph with Eigen-analysis

In studies on complex network systems using graph theory, eigen-analysis is typically performed on an undirected graph model of the network. However, when analyzing cascading failures in a power system, the interactions among failures suggest the need for a directed graph beyond the topology of the power system to model directions of failure propagation. To accurately quantify failure interactions for effective mitigation strategies, this paper proposes a stochastic interaction graph model and associated eigen-analysis. Different types of modes on failure propagations are defined and characterized by the eigenvalues of a stochastic interaction matrix, whose absolute values are unity, zero, or in between. Finding and interpreting these modes helps identify the probable patterns of failure propagation, either local or widespread, and the participating components based on eigenvectors. Then, by lowering the failure probabilities of critical components highly participating in a mode of widespread failures, cascading can be mitigated. Here, the validity of the proposed stochastic interaction graph model, eigen-analysis and the resulting mitigation strategies is demonstrated using simulated cascading failure data on an NPCC 140-bus system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2014

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↗
DOE OSTI2020

Statistical Treatment of Inverse Problems Constrained by Differential Equations-based Models with Stochastic Terms

This paper introduces a statistical treatment of inverse problems constrained by models with stochastic terms. The solution of the forward problem is given by a distribution represented numerically by an ensemble of simulations. The goal is to formulate the inverse problem, in particular the objective function, to find the closest forward distribution (i.e., the output of the stochastic forward problem) that best explains the distribution of the observations in a certain metric. We use proper scoring rules, a concept employed in statistical forecast verification, namely energy, variogram, and hybrid (i.e., combination of the two) scores. We study the performance of the proposed formulation in the context of two applications: a coefficient field inversion for subsurface flow governed by an elliptic partial differential equation with a stochastic source and a parameter inversion for power grid governed by differential-algebraic equations. In both cases we show that the variogram and the hybrid scores produce better parameter inversion results than does the energy score, whereas the energy score leads to better probabilistic predictions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Generalized Bayesian MARS: Tools for Stochastic Computer Model Emulation

The multivariate adaptive regression spline (MARS) approach of Friedman and its Bayesian counterpart are effective approaches for the emulation of computer models. The traditional assumption of Gaussian errors limits the usefulness of MARS, and many popular alternatives, when dealing with stochastic computer models. Here, we propose a generalized Bayesian MARS (GBMARS) framework which admits the broad class of generalized hyperbolic distributions as the induced likelihood function. This allows us to develop tools for the emulation of stochastic simulators which are parsimonious, scalable, and interpretable and require minimal tuning, while providing powerful predictive and uncertainty quantification capabilities. GBMARS is capable of robust regression with t distributions, quantile regression with asymmetric Laplace distributions, and a general form of “Normal-Wald” regression in which the shape of the error distribution and the structure of the mean function are learned simultaneously. We demonstrate the effectiveness of GBMARS on various stochastic computer models, and we show that it compares favorably to several popular alternatives.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Control of Networked Traffic Flow Distribution: A Stochastic Distribution System Perspective

At signalized intersections, the traffic queues are controlled by traffic signal control settings and effective traffic lights control would realize both smooth traffic flow and minimize fuel consumption. Funded by the Energy Efficient Mobility Systems (EEMS) program of the Vehicle Technologies Office of the US Department of Energy, we performed a preliminary investigation on the modelling and control framework in context of urban network of signalized intersections. In specific, we developed a recursive input-output traffic queueing models. The queue formation can be modeled as a stochastic process where the number of vehicles entering each intersection is a random number. Further, we proposed a preliminary B-Spline stochastic modelling and control for a one-way single-lane corridor traffic system based on theory of stochastic distribution control that shapes the PDF of the queue length.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2026

SPAROW: Stochastic Programming and Related Optimization Workflows

SAND2026-16703O SPAROW: Stochastic Programming and Related Optimization Workflows is a Python library tool that facilitates the development and solution of stochastic programming problems. It provides a user-friendly class structure for defining stochastic programs through scenario-based representations of uncertainties. SPAROW incorporates multiple optimization strategies, including integer programming with all scenarios, progressive hedging, Benders decomposition, and Snoglode, a novel technique developed by Carnegie Mellon University. It also features interfaces to external solvers and functions that are commonly used in analysis workflows, making it applicable to a wide range of scientific and engineering design challenges, particularly in power grid planning. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Hart, William [Sandia National Lab. (SNL-NM), Albu↗
DOE OSTI2026

Quantum Stochastic Programming [SWR-26-040]

The Quantum Stochastic Programming tool contains quantum computing algorithms for two-stage stochastic optimization, with a focus on the Unit Commitment (UC) problem in power systems. The algorithms combine Discrete Quantum Annealing (DQA) with Quantum Amplitude Estimation (QAE) to compute expected-value objective functions over a probability distribution of wind-power scenarios. Based on: arXiv 2402.15029 - "Quantum algorithms for the two-stage stochastic unit commitment problem"

Maack, Jonathan [National Laboratory of the Rockie↗
DOE OSTI2023

Robustness of the Stochastic Parameterization of Subgrid-Scale Wind Variability in Sea Surface Fluxes

Abstract High-resolution numerical models have been used to develop statistical models of the enhancement of sea surface fluxes resulting from spatial variability of sea surface wind. In particular, studies have shown that flux enhancement is not a deterministic function of the resolved state. Previous studies focused on single geographical areas or used a single high-resolution numerical model. This study extends the development of such statistical models by considering six different high-resolution models, four different geographical regions, and three different 10-day periods, allowing for a systematic investigation of the robustness of both the deterministic and stochastic parts of the data-driven parameterization. Results indicate that the deterministic part, based on regressing the unresolved normalized flux onto resolved-scale normalized flux and precipitation, is broadly robust across different models, regions, and time periods. The statistical features of the stochastic part of the model (spatial and temporal autocorrelation and parameters of a Gaussian process fit to the regression residual) are also found to be robust and not strongly sensitive to the underlying model, modeled geographical region, or time period studied. Best-fit Gaussian process parameters display robust spatial heterogeneity across models, indicating potential for improvements to the statistical model. These results illustrate the potential for the development of a generic, explicitly stochastic parameterization of sea surface flux enhancements dependent on wind variability.

Endo, Kota↗
DOE OSTI2016

Exponential stability of impulsive stochastic genetic regulatory networks with time-varying delays and reaction-diffusion

We present a mean-square exponential stability analysis for impulsive stochastic genetic regulatory networks (GRNs) with time-varying delays and reaction-diffusion driven by fractional Brownian motion (fBm). By constructing a Lyapunov functional and using linear matrix inequality for stochastic analysis we derive sufficient conditions to guarantee the exponential stability of the stochastic model of impulsive GRNs in the mean-square sense. Meanwhile, the corresponding results are obtained for the GRNs with constant time delays and standard Brownian motion. Finally, an example is presented to illustrate our results of the mean-square exponential stability analysis.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2026

Semi-Analytical Hierarchical Bayesian Inference of Nonlinear Model Structure in Stochastic Dynamics: Applied to Compartmental Models of Infectious Diseases

A Bayesian computational framework for parsimonious inference in stochastic nonlinear dynamical systems is presented. This framework enables the concurrent estimation of system states, time-varying parameters, time-invariant parameters, and the optimal sparsity structure of the model parameters. Because differential equation-based models are often simplified mechanistic or phenomenological representations, robust inference from noisy measurement data requires explicit treatment of model error and uncertainty. Model error and time-varying parameters can be represented as random processes, enabling inference while making minimal assumptions about the underlying sources of discrepancy and variability. Adopting stochastic differential equation representations affords the model significant flexibility, but can also render it susceptible to overfitting during statistical inversion, where the inferred model may track noise rather than the underlying signal. To alleviate the effects of overfitting and to enable the discovery of the optimal sparse representation of the time-invariant parameters, a Bayesian sparse learning algorithm is embedded within the framework. This sparse learning framework adopts an approximate hierarchical Bayesian setting defined by a series of semi-analytical expressions. The model structure inference framework is validated using a stochastic compartmental model for tracking and forecasting active cases of an infectious disease. Compartmental models describe population-level infectious disease dynamics through interactions among population fractions grouped by disease state. Mathematically, such models consist of a system of coupled ordinary differential equations. This example adopts an expressive compartmental model that includes multiple possible interactions between disease states, motivated by early uncertainty surrounding COVID-19 reinfection dynamics and their implications for long-term epidemic forecasting. The sparse learning exercise permits the inference of a priori unknown epidemiological dynamics from simulated public health data, discovering the nested compartmental model that optimizes the trade-off between average data-fit and model complexity. It is shown that inducing sparsity among the model parameters eliminates redundant interactions between compartments, equivalently revealing the optimal coupling structure between differential equations.

97 MATHEMATICS AND COMPUTING↗