Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “STOCHASTIC PROCESSES”

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
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 OSTI2022

Controlling the breakdown delay time in pulsed gas discharge

Abstract In experiment and 2D3V PIC MCC simulations, the breakdown development in a pulsed discharge in helium is studied for U = 3.2 kV and 10 kV and P = 100 Torr. The breakdown process is found to have a stochastic nature, and the electron avalanche develops in different experimental and simulation runs with time delays ranging from 0.3 to 8 μ s. Nevertheless our experiments demonstrate that the breakdown delay time distribution can be controlled with a change of the pulse discharge frequency. The simulation results show that the breakdown process can be distinguished in three stages with (a) the ionization by seed electrons, (b) the ions drift to the cathode and (c) the enhanced ionization within the cathode sheath by the electrons emitted from the cathode. The effects of variation of seed electron concentrations, voltage rise times, voltage amplitudes and ion–electron emission coefficients on the breakdown development in the pulsed gas discharge are reported.

Schweigert, I. V. (ORCID:0000000223641228)↗
DOE OSTI2021

Evaluating Gaussian process metamodels and sequential designs for noisy level set estimation

Abstract We consider the problem of learning the level set for which a noisy black-box function exceeds a given threshold. To efficiently reconstruct the level set, we investigate Gaussian process (GP) metamodels. Our focus is on strongly stochastic simulators, in particular with heavy-tailed simulation noise and low signal-to-noise ratio. To guard against noise misspecification, we assess the performance of three variants: (i) GPs with Student- t observations; (ii) Student- t processes (TPs); and (iii) classification GPs modeling the sign of the response. In conjunction with these metamodels, we analyze several acquisition functions for guiding the sequential experimental designs, extending existing stepwise uncertainty reduction criteria to the stochastic contour-finding context. This also motivates our development of (approximate) updating formulas to efficiently compute such acquisition functions. Our schemes are benchmarked by using a variety of synthetic experiments in 1–6 dimensions. We also consider an application of level set estimation for determining the optimal exercise policy of Bermudan options in finance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Insight on electrolyte infiltration of lithium ion battery electrodes by means of a new three-dimensional-resolved lattice Boltzmann model

Electrolyte filling takes place between sealing and formation in Lithium Ion Battery (LIB) manufacturing process. This step is crucial as it is directly linked to LIB quality and affects the subsequent time consuming electrolyte wetting process. Although having fast, homogeneous and complete wetting is of paramount importance, this process has not been sufficiently examined and fully understood. For instance, experimentally available data is insufficient to fully capture the complex interplay upon filling between electrolyte and air inside the porous electrode. We report here for the first time a 3D-resolved Lattice Boltzmann Method (LBM) model able to simulate electrolyte filling upon applied pressure of LIB porous electrodes obtained both from experiments (micro X-ray tomography) and computations (stochastic generation, simulation of the manufacturing process using Coarse Grained Molecular Dynamics and Discrete Element Method). The model allows obtaining advanced insights about the impact of the electrode mesostructures on the speed of electrolyte impregnation and wetting, highlighting the importance of porosity, pore size distribution and pores interconnectivity on the filling dynamics. Furthermore, we identify scenarios where volumes with trapped air (dead zones) appear and evaluate the impact of those on the electrochemical behavior of the electrodes.

25 ENERGY STORAGE↗
DOE OSTI2020

Evolutionary reinforcement learning of dynamical large deviations

In this work, we show how to bound and calculate the likelihood of dynamical large deviations using evolutionary reinforcement learning. An agent, a stochastic model, propagates a continuous-time Monte Carlo trajectory and receives a reward conditioned upon the values of certain path-extensive quantities. Evolution produces progressively fitter agents, potentially allowing the calculation of a piece of a large-deviation rate function for a particular model and path-extensive quantity. For models with small state spaces, the evolutionary process acts directly on rates, and for models with large state spaces, the process acts on the weights of a neural network that parameterizes the model's rates. This approach shows how path-extensive physics problems can be considered within a framework widely used in machine learning.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Bayesian inference of structured latent spaces from neural population activity with the orthogonal stochastic linear mixing model

The brain produces diverse functions, from perceiving sounds to producing arm reaches, through the collective activity of populations of many neurons. Determining if and how the features of these exogenous variables (e.g., sound frequency, reach angle) are reflected in population neural activity is important for understanding how the brain operates. Often, high-dimensional neural population activity is confined to low-dimensional latent spaces. However, many current methods fail to extract latent spaces that are clearly structured by exogenous variables. This has contributed to a debate about whether or not brains should be thought of as dynamical systems or representational systems. Here, we developed a new latent process Bayesian regression framework, the orthogonal stochastic linear mixing model (OSLMM) which introduces an orthogonality constraint amongst time-varying mixture coefficients, and provide Markov chain Monte Carlo inference procedures. We demonstrate superior performance of OSLMM on latent trajectory recovery in synthetic experiments and show superior computational efficiency and prediction performance on several real-world benchmark data sets. We primarily focus on demonstrating the utility of OSLMM in two neural data sets: μ ECoG recordings from rat auditory cortex during presentation of pure tones and multi-single unit recordings form monkey motor cortex during complex arm reaching. We show that OSLMM achieves superior or comparable predictive accuracy of neural data and decoding of external variables (e.g., reach velocity). Most importantly, in both experimental contexts, we demonstrate that OSLMM latent trajectories directly reflect features of the sounds and reaches, demonstrating that neural dynamics are structured by neural representations. Together, these results demonstrate that OSLMM will be useful for the analysis of diverse, large-scale biological time-series datasets.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Assimilating partial observation to enhance feedback control of stochastic dynamical systems

Here, in this paper, we present a novel methodology to tackle feedback optimal control problems in scenarios where the exact state of the controlled process is unknown. It integrates data assimilation techniques and optimal control solvers to manage partial observation of the state process, a common occurrence in practical scenarios. Traditional stochastic optimal control methods assume full state observation, which is often not feasible in real-world fluid dynamics control problems. Our approach underscores the significance of utilizing observational data to inform control policy design. Specifically, we introduce a kernel learning backward stochastic differential equation (SDE) filter to enhance data assimilation efficiency and propose a sample-wise stochastic optimization method within the stochastic maximum principle framework. We demonstrate the efficacy and accuracy of our method in the control of advection-diffusion-reaction flow problem and the Dubins airplane maneuvering problem with model uncertainty.

data driven↗
DOE OSTI2020

Stochastic gradient descent algorithm for stochastic optimization in solving analytic continuation problems

We propose a stochastic gradient descent based optimization algorithm to solve the analytic continuation problem in which we extract real frequency spectra from imaginary time Quantum Monte Carlo data. The procedure of analytic continuation is an ill-posed inverse problem which is usually solved by regularized optimization methods, such like the Maximum Entropy method, or stochastic optimization methods. The main contribution of this work is to improve the performance of stochastic optimization approaches by introducing a supervised stochastic gradient descent algorithm to solve a flipped inverse system which processes the random solutions obtained by a type of Fast and Efficient Stochastic Optimization Method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Phase transitions in Schloegl's second model for autocatalysis on a Bethe lattice

Schloegl's second model (also known as the quadratic contact process) on a lattice involves spontaneous particle annihilation at rate p and autocatalytic particle creation at empty sites with n ≥ 2 occupied neighbors. The particle creation rate for exactly n occupied neighbors is selected here as n(n - 1)/[z(z - 1)] for lattice coordination number z. We analyze this model on a Bethe lattice. Precise behavior for stochastic models on regular periodic infinite lattices is usually surmised from kinetic Monte Carlo simulation on a finite lattice with periodic boundary conditions. However, the persistence of boundary effects for a Bethe lattice complicates this process, e.g., by inducing spatially heterogenous states. This motivates the exploration of various boundary conditions and unconventional simulation ensembles on the Bethe lattice to predict behavior for infinite size. Here, we focus on z = 3, and predict a discontinuous transition to the vacuum state on the infinite lattice when p exceeds a threshold value of around 0.053.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Spin-squeezed Gottesman-Kitaev-Preskill codes for quantum error correction in atomic ensembles

Gottesman-Kitaev-Preskill (GKP) codes encode a qubit in displaced phase-space combs of a continuous-variable (CV) quantum system and are useful for correcting a variety of high-weight photonic errors. Here we propose atomic ensemble analogs of the single-mode CV GKP code by using the quantum central limit theorem to pull back the phase-space structure of a CV system to the compact phase space of a quantum spin system. We study the optimal recovery performance of these codes under error channels described by stochastic relaxation and isotropic ballistic dephasing processes using the diversity combining approach for calculating channel fidelity. Additionally, we find that the spin GKP codes outperform other spin system codes such as cat codes or binomial codes. Our spin GKP codes based on the two-axis countertwisting interaction and superpositions of SU(2) coherent states are direct spin analogs of the finite-energy CV GKP codes, whereas our codes based on one-axis twisting do not yet have well-studied CV analogs. A state preparation scheme for the spin GKP codes is proposed which uses the linear-combination-of-unitaries method, applicable to both the CV and spin GKP settings. Finally, we discuss a fault-tolerant approximate gate set for quantum computing with spin-GKP-encoded qubits, obtained by translating gates from the CV GKP setting using the quantum central limit theorem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Restoration Strategy for Active Distribution Systems Considering Endogenous Uncertainty in Cold Load Pickup

Cold load pickup (CLPU) phenomenon is identified as the persistent power inrush upon a sudden load pickup after an outage. Under the active distribution system (ADS) paradigm, where distributed energy resources (DERs) are extensively installed, the decreased outage duration can induce a strong interdependence between CLPU pattern and load pickup decisions. In this paper, we propose a novel modelling technique to tractably capture the decision-dependent uncertainty (DDU) inherent in the CLPU process. Subsequently, a two-stage stochastic decision-dependent service restoration (SDDSR) model is constructed, where first stage searches for the optimal switching sequences to decide step-wise network topology, and the second stage optimizes the detailed generation schedule of DERs as well as the energization of switchable loads. Further, to tackle the computational burdens introduced by mixed-integer recourse, the progressive hedging algorithm (PHA) is utilized to decompose the original model into scenario-wise subproblems that can be solved in parallel. The numerical test on modified IEEE 123-node test feeders has verified the efficiency of our proposed SDDSR model and provided fresh insights into the monetary and secure values of DDU quantification.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Two-Stage Estimation and Variance Modeling for Latency-Constrained Variational Quantum Algorithms

The quantum approximate optimization algorithm (QAOA) has enjoyed increasing attention in noisy, intermediate-scale quantum computing with its application to combinatorial optimization problems. QAOA has the potential to demonstrate a quantum advantage for NP-hard combinatorial optimization problems. As a hybrid quantum-classical algorithm, the classical component of QAOA resembles a simulation optimization problem in which the simulation outcomes are attainable only through a quantum computer. The simulation that derives from QAOA exhibits two unique features that can have a substantial impact on the optimization process: (i) the variance of the stochastic objective values typically decreases in proportion to the optimality gap, and (ii) querying samples from a quantum computer introduces an additional latency overhead. In this paper, we introduce a novel stochastic trust-region method derived from a derivative-free, adaptive sampling trust-region optimization method intended to efficiently solve the classical optimization problem in QAOA by explicitly taking into account the two mentioned characteristics. The key idea behind the proposed algorithm involves constructing two separate local models in each iteration: a model of the objective function and a model of the variance of the objective function. Exploiting the variance model allows us to restrict the number of communications with the quantum computer and also helps navigate the nonconvex objective landscapes typical in QAOA optimization problems. In conclusion, we numerically demonstrate the superiority of our proposed algorithm using the SimOpt library and Qiskit when we consider a metric of computational burden that explicitly accounts for communication costs.

Derivative-free Optimization↗
DOE OSTI2025

Joint Modeling of Quasar Variability and Accretion Disk Reprocessing Using Latent Stochastic Differential Equations

Quasars are bright active galactic nuclei powered by the accretion of matter around supermassive black holes at the center of galaxies. Their stochastic brightness variability depends on the physical properties of the accretion disk and black hole. The upcoming Rubin Observatory Legacy Survey of Space and Time (LSST) is expected to observe tens of millions of quasars, so there is a need for efficient techniques like machine learning that can handle the large volume of data. Quasar variability is believed to be driven by an X-ray corona, which is reprocessed by the accretion disk and emitted as UV/optical variability. We are the first to introduce an auto-differentiable simulation of the accretion disk and reprocessing. We use the simulation as a direct component of our neural network to jointly model the driving variability and reprocessing, trained with supervised learning on simulated LSST-like 10 yr quasar light curves. We encode the light curves using a transformer encoder, and the driving variability is reconstructed using latent stochastic differential equations, a physically motivated generative deep learning method that can model continuous-time stochastic dynamics. By embedding the physical processes of the driving signal and reprocessing into our network, we achieve a model that is more robust and interpretable. We demonstrate that our model outperforms a Gaussian process regression baseline and can infer accretion disk parameters and time delays between wave bands, even for out-of-distribution driving signals. Our approach provides a powerful framework that can be adapted to solve other inverse problems in multivariate time series.

Fagin, Joshua [City Univ. of New York (CUNY), NY (↗
DOE OSTI2020

Characterization of flow and transport in a fracture network at the EGS Collab field experiment through stochastic modeling of tracer recovery

Energy extraction from subsurface reservoirs is important for addressing the increasing energy demand and environmental concerns such as global warming. However, the characterization of subsurface reservoirs, particularly reservoirs dominated by fracture networks remains a challenge due to the lack of means to directly observe subsurface processes. This study explores the feasibility and efficacy of characterizing fracture flow and transport processes in an enhanced geothermal system (EGS) testbed through stochastic tracer modeling. There are two enabling factors that allow application of stochastic modeling to characterize a subsurface reservoir. First, an abundance of geological and geophysical measurements enables the development of a high-fidelity and well-constrained fracture network model. Second, high-performance computing (HPC) allows running massive realizations efficiently. Six conservative tracer tests were stochastically modeled and produced satisfactory realizations that successfully reproduce field tracer recovery data from each tracer test. The evolution of flow and transport processes in the fracture network was then analyzed from these satisfactory realizations. This work demonstrates that stochastic tracer modeling on a high-fidelity fracture network model is feasible and can provide important insights regarding flow and transport characteristics in subsurface fractured reservoirs.

58 GEOSCIENCES↗
DOE OSTI2023

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

Comparing (stochastic-selection) ab initio multiple spawning with trajectory surface hopping for the photodynamics of cyclopropanone, fulvene, and dithiane

Ab Initio Multiple Spawning (AIMS) simulates the excited-state dynamics of molecular systems by representing nuclear wavepackets in a basis of coupled traveling Gaussian functions, called trajectory basis functions (TBFs). New TBFs are spawned when nuclear wavepackets enter regions of strong nonadiabaticity, permitting the description of non-Born–Oppenheimer processes. The spawning algorithm is simultaneously the blessing and the curse of the AIMS method: it allows for an accurate description of the transfer of nuclear amplitude between different electronic states, but it also dramatically increases the computational cost of the AIMS dynamics as all TBFs are coupled. Recently, a strategy coined stochastic-selection AIMS (SSAIMS) was devised to limit the ever-growing number of TBFs and tested on simple molecules. In this work, we use the photodynamics of three different molecules—cyclopropanone, fulvene, and 1,2-dithiane—to investigate (i) the potential of SSAIMS to reproduce reference AIMS results for challenging nonadiabatic dynamics, (ii) the compromise achieved by SSAIMS in obtaining accurate results while using the smallest average number of TBFs as possible, and (iii) the performance of SSAIMS in comparison to the mixed quantum/classical method trajectory surface hopping (TSH)—both in terms of its accuracy and computational cost. We show that SSAIMS can accurately reproduce the AIMS results for the three molecules considered at a much cheaper computational cost, often close to that of TSH. We deduce from these tests that an overlap-based criterion for the stochastic-selection process leads to the best agreement with the reference AIMS dynamics for the smallest average number of TBFs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Quantification of microtubule stutters: dynamic instability behaviors that are strongly associated with catastrophe

Microtubules (MTs) are cytoskeletal fibers that undergo dynamic instability (DI), a remarkable process involving phases of growth and shortening separated by stochastic transitions called catastrophe and rescue. Dissecting DI mechanism(s) requires first characterizing and quantifying these dynamics, a subjective process that often ignores complexity in MT behavior. We present a Statistical Tool for Automated Dynamic Instability Analysis (STADIA) that identifies and quantifies not only growth and shortening, but also a category of intermediate behaviors that we term “stutters.” During stutters, the rate of MT length change tends to be smaller in magnitude than during typical growth or shortening phases. Quantifying stutters and other behaviors with STADIA demonstrates that stutters precede most catastrophes in our in vitro experiments and dimer-scale MT simulations, suggesting that stutters are mechanistically involved in catastrophes. Related to this idea, we show that the anticatastrophe factor CLASP2γ works by promoting the return of stuttering MTs to growth. STADIA enables more comprehensive and data-driven analysis of MT dynamics compared with previous methods. The treatment of stutters as distinct and quantifiable DI behaviors provides new opportunities for analyzing mechanisms of MT dynamics and their regulation by binding proteins.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

An explicitly solvable energy-conserving algorithm for pitch-angle scattering in magnetized plasmas

In this work, we develop an Explicitly Solvable Energy-Conserving (ESEC) algorithm for the Stochastic Differential Equation (SDE) describing the pitch-angle scattering process in magnetized plasmas. The Cayley transform is used to calculate both the deterministic gyromotion and stochastic scattering, affording the algorithm to be explicitly solvable and exactly energy conserving. An unusual property of the SDE for pitch-angle scattering is that its coefficients diverge at the zero velocity and do not satisfy the global Lipschitz condition. Consequently, when standard numerical methods, such as the Euler-Maruyama (EM), are applied, numerical convergence is difficult to establish. For the proposed ESEC algorithm, its energy-preserving property enables us to overcome this obstacle. We rigorously prove that the ESEC algorithm is order 1/2 strongly convergent. This result is confirmed by detailed numerical studies. For the case of pitch-angle scattering in a magnetized plasma with a constant magnetic field, the numerical solution is benchmarked against the analytical solution, and excellent agreements are found.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗