Search NASA⌕ Search

SEARCH · Search NASA

Results for “stochastic approaches”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Identifying stochastic dynamics via finite expression methods

Modeling stochastic differential equations (SDEs) is crucial for understanding complex dynamical systems in various scientific fields. Recent methods often employ neural network-based models, which typically represent SDEs through a combination of deterministic and stochastic terms. However, these models usually lack interpretability and have difficulty in generalizing beyond their training domain. Here, this paper introduces the Finite Expression Method (FEX), a symbolic learning approach designed to derive interpretable mathematical representations of the deterministic component of SDEs. For the stochastic component, we integrate FEX with advanced generative modeling techniques to provide a comprehensive representation of SDEs. The numerical experiments on linear, nonlinear, and multidimensional SDEs demonstrate that FEX generalizes well beyond the training domain and delivers more accurate long-term predictions compared to neural network-based methods. The symbolic expressions identified by FEX not only improve prediction accuracy but also offer valuable scientific insights into the underlying dynamics of the systems.

Complex dynamical systems↗
DOE OSTI2023

Parameter estimation with maximal updated densities

A recently developed measure-theoretic framework solves a stochastic inverse problem (SIP) for models where uncertainties in model output data are predominantly due to aleatoric (i.e., irreducible) uncertainties in model inputs (i.e., parameters). The subsequent inferential target is a distribution on parameters. Another type of inverse problem is to quantify uncertainties in estimates of “true” parameter values under the assumption that such uncertainties should be reduced as more data are incorporated into the problem, i.e., the uncertainty is considered epistemic. A major contribution of this work is the formulation and solution of such a parameter identification problem (PIP) within the measure-theoretic framework developed for the SIP. The approach is novel in that it utilizes a solution to a stochastic forward problem (SFP) to update an initial density only in the parameter directions informed by the model output data. In other words, this method performs “selective regularization” only in the parameter directions not informed by data. Further, the solution is defined by a maximal updated density (MUD) point where the updated density defines the measure-theoretic solution to the PIP. Another significant contribution of this work is the full theory of existence and uniqueness of MUD points for linear maps with Gaussian distributions. Data-constructed Quantity of Interest (QoI) maps are also presented and analyzed for solving the PIP within this measure-theoretic framework as a means of reducing uncertainties in the MUD estimate. We conclude with a demonstration of the general applicability of the method on two problems involving either spatial or temporal data for estimating uncertain model parameters. The first problem utilizes spatial data from a stationary partial differential equation to produce a MUD estimate of an uncertain boundary condition. The second problem utilizes temporal data obtained from the state-of-the-art ADvanced CIRCulation (ADCIRC) model to obtain a MUD estimate of uncertain wind drag coefficients for a simulated extreme weather event near the Shinnecock Inlet located in the Outer Barrier of Long Island, NY, USA.

42 ENGINEERING↗
DOE OSTI2023

Stochastic Real-Time Second-Order Green’s Function Theory for Neutral Excitations in Molecules and Nanostructures

We present a real-time second-order Green’s function (GF) method for computing excited states in molecules and nanostructures, with a computational scaling of O(N e 3 ), where N e is the number of electrons. The cubic scaling is achieved by adopting the stochastic resolution of the identity to decouple the 4-index electron repulsion integrals. To improve the time propagation and the spectral resolution, we adopt the dynamic mode decomposition technique and assess the accuracy and efficiency of the combined approach for a chain of hydrogen dimer molecules of different lengths. We find that the stochastic implementation accurately reproduces the deterministic results for the electronic dynamics and excitation energies. Furthermore, we provide a detailed analysis of the statistical errors, bias, and long-time extrapolation. Overall, the approach offers an efficient route to investigate excited states in extended systems with open or closed boundary conditions.

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

An Iterative Response-Surface-Based Approach for Chance-Constrained AC Optimal Power Flow Considering Dependent Uncertainty

A modern power system is characterized by a stochastic variation of the loads and an increasing penetration of renewable energy generation, which results in large uncertainties in its states. These uncertainties bring formidable challenges to the power system planning and operation process. To address these challenges, we propose a cost-effective, iterative response-surface-based approach for the chance-constrained AC optimal power-flow problem that aims to ensure the secure operation of the power systems considering dependent uncertainties. Starting from a stochastic-sampling-based framework, we first utilize the copula theory to simulate the dependence among multivariate uncertain inputs. Then, to reduce the prohibitive computational time required in the traditional Monte-Carlo method, we propose, instead of using the original complicated power-system model, to rely on a polynomial-chaos-based response surface. This response surface allows us to efficiently evaluate the time-consuming power-system model at arbitrary distributed sampled values with a negligible computational cost. This further enables us to efficiently conduct an online stochastic testing for the system states that not only screens out the statistical active constraints, but also assists in a better design of the tightened bounds without using any Gaussian or symmetric assumption. Finally, an iterative procedure is executed to fine-tune the optimal solution that better satisfies a predefined probability. The simulations conducted in multiple test systems demonstrate the excellent performance of the proposed method.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Complex Langevin and other approaches to the sign problem in quantum many-body physics

In this work, we review the theory and applications of complex stochastic quantization to the quantum many-body problem. Along the way, we present a brief overview of a number of ideas that either ameliorate or in some cases altogether solve the sign problem, including the classic reweighting method, alternative Hubbard–Stratonovich transformations, dual variables (for bosons and fermions), Majorana fermions, density-of-states methods, imaginary asymmetry approaches, and Lefschetz thimbles. We discuss some aspects of the mathematical underpinnings of conventional stochastic quantization, provide a few pedagogical examples, and summarize open challenges and practical solutions for the complex case. Finally, we review the recent applications of complex Langevin to quantum field theory in relativistic and nonrelativistic quantum matter, with an emphasis on the nonrelativistic case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Stochastic renormalization group and gradient flow

A non-perturbative and continuous definition of RG transformations as stochastic processes is proposed, inspired by the observation that the functional RG equations for effective Boltzmann factors may be interpreted as Fokker-Planck equations. The result implies a new approach to Monte Carlo RG that is amenable to lattice simulation. Long-distance correlations of the effective theory are shown to approach gradient-flowed correlations, which are simpler to measure. The Markov property of the stochastic RG transformation implies an RG scaling formula which allows for the measurement of anomalous dimensions when transcribed into gradient flow expectation values.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Inherent stochasticity during insulator–metal transition in VO 2

Vanadium dioxide (VO 2 ), which exhibits a near-room-temperature insulator–metal transition, has great potential in applications of neuromorphic computing devices. Although its volatile switching property, which could emulate neuron spiking, has been studied widely, nanoscale studies of the structural stochasticity across the phase transition are still lacking. In this study, using in situ transmission electron microscopy and ex situ resistive switching measurement, we successfully characterized the structural phase transition between monoclinic and rutile VO 2 at local areas in planar VO 2 /TiO 2 device configuration under external biasing. After each resistive switching, different VO 2 monoclinic crystal orientations are observed, forming different equilibrium states. We have evaluated a statistical cycle-to-cycle variation, demonstrated a stochastic nature of the volatile resistive switching, and presented an approach to study in-plane structural anisotropy. Furthermore, our microscopic studies move a big step forward toward understanding the volatile switching mechanisms and the related applications of VO 2 as the key material of neuromorphic computing.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Implementation of Stochastic Gradient Descent in an Automated Glow Peak Identification Software for Multiple Thermoluminescent Dosimeter Types

A glow-curve analysis code was previously developed in C++ to analyze thermoluminescent dosimeter glow curves using automated peak detection while applying a first-order kinetics model. A newer version of this code was implemented to improve the automated peak detection and curve fitting models. The Stochastic Gradient Descent Algorithm was introduced to replace the prior approach of taking first and second-order derivatives for peak detection. Additionally, early stopping mechanisms were invoked to improve the previously used Levenberg-Marquardt Algorithm employed for curve fitting. The two software versions were compared through glow curve analysis of different thermoluminescent dosimeter materials and calculation of the corresponding figures of merit. Altogether improvements were shown, namely an increase in the number of peaks detected and a reduction of the mean figure of merit by approximately 46%.

137Cs↗
DOE OSTI2022

Finite-volume pionless effective field theory for few-nucleon systems with differentiable programming

Finite-volume pionless effective field theory provides an efficient framework for the extrapolation of nuclear spectra and matrix elements calculated at finite volume in lattice QCD to infinite volume, and to nuclei with larger atomic number. In this work, it is demonstrated how this framework may be implemented via a set of correlated Gaussian wave functions optimized using differentiable programming and via solution of a generalized eigenvalue problem. This approach is shown to be significantly more efficient than a stochastic implementation of the variational method based on the same form of correlated Gaussian wave functions, yielding comparably accurate representations of the ground-state wave functions with an order of magnitude fewer terms. The efficiency of representation allows such calculations to be extended to larger systems than in previous work. Further, the method is demonstrated through calculations of the binding energies of nuclei with atomic number A ϵ {2,3,4} in finite volume, matched to lattice QCD calculations at quark masses corresponding to m π = 806 MeV, and infinite-volume effective field theory calculations of A ϵ {2,3,4,5,6} systems based on this matching.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

A Q-Learning-Based Approach for Distributed Beam Scheduling in mmWave Networks

We consider the problem of distributed downlink beam scheduling and power allocation for millimeter-Wave (mmWave) cellular networks where multiple base stations (BSs) belonging to different service operators share the same unlicensed spectrum with no centralized control or explicit coordination among them. Our goal is to design efficient distributed beam scheduling and power allocation schemes such that the network-level payoff, defined as the weighted sum of the total throughput and a power penalization term, can be maximized. To this end, we propose a distributed scheduling approach to power allocation and adaptation for efficient interference management over the shared spectrum by modeling each BS as an independent Q-learning agent. As a baseline, we compare the proposed approach to the state-of-the-art non-cooperative game-based approach which was previously developed for the same problem. We conduct extensive experiments under various scenarios to verify the effect of multiple factors on the performance of both approaches. Experiment results show that the proposed approach adapts well to different interference conditions by learning from experience and thus can achieve higher payoff than the game-based approach. The proposed approach can also be integrated into our previously developed Lyapunov stochastic optimization framework for the purpose of network utility maximization with optimality guarantee. As a result, the weights in the payoff function can be automatically and optimally determined by the virtual queue values from the sub-problems derived from the Lyapunov optimization framework.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2022

Partner with a Third-Party Delivery Service or Not? A Prediction-and-Decision Tool for Restaurants Facing Takeout Demand Surges During a Pandemic

Amidst the COVID-19 pandemic, restaurants become more reliant on no-contact pick-up or delivery ways for serving customers. As a result, they need to make tactical planning decisions such as whether to partner with online platforms, to form their own delivery team, or both. In this paper, we develop an integrated prediction-decision model to analyze the profit of combining the two approaches and to decide the needed number of drivers under stochastic demand. We first use the susceptible-infected-recovered (SIR) model to forecast future infected cases in a given region and then construct an autoregressive-moving-average (ARMA) regression model to predict food-ordering demand. Using predicted demand samples, we formulate a stochastic integer program to optimize food delivery plans. We conduct numerical studies using COVID-19 data and food-ordering demand data collected from local restaurants in Nuevo Leon, Mexico, from April to October 2020, to show results for helping restaurants build contingency plans under rapid market changes. Our method can be used under unexpected demand surges, various infection/vaccination status, and demand patterns. Here, our results show that a restaurant can benefit from partnering with third-party delivery platforms when (i) the subscription fee is low, (ii) customers can flexibly decide whether to order from platforms or from restaurants directly, (iii) customers require more efficient delivery, (iv) average delivery distance is long, or (v) demand variance is high.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

SNoGloDe: A Structured Nonlinear Global Decomposition Solver

Large-scale optimization problems often require decomposition strategies and customized algorithms to achieve optimal solutions within a reasonable time. Building on the work of Cao and Zavala (2019) for solving nonlinear two-stage stochastic programs to global optimality, we implement and extend their approach. We generalize to optimization problems reformulated with a block-angular constraint structure (e.g., temporal decomposition). Our framework, written in Python using Pyomo, is highly customizable and enables parallel execution of the decomposition. SNoGloDe allows tailored branching strategies, lower bounding problems, and candidate generators to leverage problem-specific knowledge. To demonstrate effectiveness, we compare SNoGloDe’s performance with Gurobi on a temporally decomposed produced water case study.

algorithms↗
DOE OSTI2023

Multinucleon transfer mechanism in Gd 160 + W 186 collisions in stochastic mean-field theory

The multinucleon transfer mechanism in 160 Gd + 186 W collisions is investigated in the framework of quantal transport description, based on the stochastic mean-field (SMF) theory. The SMF theory provides a microscopic approach for nuclear dynamics beyond the time-dependent Hartree-Fock approach by including mean-field fluctuations. Finally, cross sections for the primary fragment production are determined in the quantal transport description and compared with the available data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
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 OSTI2023

Quantum Optimization: Potential, Challenges, and the Path Forward

Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum algorithms has developed in many areas, with optimization being one of the most pronounced domains. Across computer science and physics, there are a number of algorithmic approaches, often with little linkage. This is further complicated by the fragmented nature of the field of mathematical optimization, where major classes of optimization problems, such as combinatorial optimization, convex optimization, non-convex optimization, and stochastic extensions, have devoted communities. With these aspects in mind, this work draws on multiple approaches to study quantum optimization. Provably exact versus heuristic settings are first explained using computational complexity theory — highlighting where quantum advantage is possible in each context. Then, the core building blocks for quantum optimization algorithms are outlined to subsequently define prominent problem classes and identify key open questions that, if answered, will advance the field. The effects of scaling relevant problems on noisy quantum devices are also outlined in detail, alongside meaningful benchmarking problems. We underscore the importance of benchmarking by proposing clear metrics to conduct appropriate comparisons with classical optimization techniques. Lastly, we highlight two domains – finance and sustainability – as rich sources of optimization problems that could be used to benchmark, and eventually validate, the potential real-world impact of quantum optimization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Memory-based parameterization with differentiable solver: Application to Lorenz ’96

Physical parameterizations (or closures) are used as representations of unresolved subgrid processes within weather and global climate models or coarse-scale turbulent models, whose resolutions are too coarse to resolve small-scale processes. These parameterizations are typically grounded on physically based, yet empirical, representations of the underlying small-scale processes. Machine learning-based parameterizations have recently been proposed as an alternative solution and have shown great promise to reduce uncertainties associated with the parameterization of small-scale processes. Yet, those approaches still show some important mismatches that are often attributed to the stochasticity of the considered process. This stochasticity can be due to coarse temporal resolution, unresolved variables, or simply to the inherent chaotic nature of the process. To address these issues, we propose a new type of parameterization (closure), which is built using memory-based neural networks, to account for the non-instantaneous response of the closure and to enhance its stability and prediction accuracy. We apply the proposed memory-based parameterization, with differentiable solver, to the Lorenz ’96 model in the presence of a coarse temporal resolution and show its capacity to predict skillful forecasts over a long time horizon of the resolved variables compared to instantaneous parameterizations. This approach paves the way for the use of memory-based parameterizations for closure problems.

Mathematics↗
DOE OSTI2020

Probabilistic learning and updating of a digital twin for composite material systems

This paper presents an approach for characterizing and estimating statistical dependence between a large number of observables in a composite material system. Conditional regression is carried out using the estimated joint density function, permitting a systematic exploration of interdependence between fine scale and coarse observables that can be used for both prognosis and design of complex material systems. An example demonstrates the integration of experimental data with a computational database. The statistical approach is based on the probabilistic learning on manifolds recently developed by the authors. This approach leverages intrinsic structure detected through diffusion on graphs with projected stochastic differential equations to generate samples constrained to that structure.

42 ENGINEERING↗
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↗