Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “stochastic approximation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Simulating the optical properties of soot using a stochastic soot model

KL extinction measurements are common in literature concerning soot producing sprays because of their nonintrusiveness. Unfortunately, these measurements often rely on bold assumptions of uniform and monodisperse spherical particles. In this work, a Spray A case is simulated using a highly detailed 3D stochastic soot model and the measured and simulated soot volume fraction are compared. Although the simulated volume fraction magnitude is approximately correct, features are much sharper than in the measured data. Optical models based on particle shape are applied to the simulated soot particles to nd the local optical thickness. The modeled optical thickness aligns with the measured volume fraction much more closely than the simulated volume fraction indicating KL extinction measurements are not simply related to soot volume fraction.

Strickland, Tyler↗
DOE OSTI2023

Tensor Decompositions for Count Data that Leverage Stochastic and Deterministic Optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the global maximum likelihood estimator from local minima. Simultaneously, a recent trend in theoretical computer science and numerical linear algebra leverages randomization to solve very large, hard problems. The typical approach is to use randomization for a fast approximation and determinism for refinement to yield effective algorithms with theoretical guarantees. Two popular algorithms for Poisson CPD reflect that emergent dichotomy: CP Alternating Poisson Regression is a deterministic algorithm and Generalized Canonical Polyadic decomposition makes use of stochastic algorithms in several variants. This work extends recent work to develop two new methods that leverage randomized and deterministic algorithms for improved accuracy and performance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Fault diagnosis and fault tolerant control for T-S fuzzy stochastic distribution systems subject to sensor and actuator faults

The problem of fault diagnosis (FD) and fault tolerant control (FTC) for a class of Takagi-Sugeno (T-S) fuzzy stochastic distribution control (SDC) systems subject to sensor and actuator faults is discussed in this paper. First, fuzzy logic models are used to approximate the output probability density function (PDF). Next, an adaptive augmented state/fault diagnosis observer is proposed to estimate the system state, sensor and the actuator faults simultaneously. New expected weights based on the sensor fault estimation information and a PI-type fuzzy feedback fault tolerant (FT) controller are designed to compensate the effect of sensor fault and actuator fault simultaneously. When the sensor fault occurs, the expected objective is redesigned to compensate the sensor fault. Meanwhile, the PI controller can compensate the effect of actuator fault, and the output PDF of the system can still track the desired PDF after the fault occurs. Finally, an example of quality distribution control in chemical reaction process is given to confirm the effectiveness of the algorithm.

42 ENGINEERING↗
DOE OSTI2027

From zonal to nodal capacity expansion planning: Spatial aggregation impacts on a realistic test-case

Solving power system capacity expansion planning (CEP) problems at realistic spatial resolutions is computationally challenging. Thus, a common practice is to solve CEP over zonal models with low spatial resolution rather than over full-scale nodal power networks. Due to improvements in solving large-scale stochastic mixed integer programs, these computational limitations are becoming less relevant, and the assumption that zonal models are realistic and useful approximations of nodal CEP is worth revisiting. Here, this work is the first to conduct a systematic computational study on the assumption that spatial aggregation can reasonably be used for ISO-scale CEP. By considering a realistic, large-scale test network based on the state of California with over 8000 buses, we find that well-designed small spatial aggregations can yield good approximations but that coarser zonal models may result in large distortions of investment decisions, e.g., capacity under-investment of up to 41% for the lowest resolution model considered.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Predictive Model for Starlink Maritime Performance Using Multi-Horizon RandomForest

Low Earth orbit (LEO) satellite systems have become a crucial enabler of broadband access for maritime industries, where traditional networks are unavailable. However, the high mobility of LEO constellations and constantly changing weather conditions result in unpredictable link fluctuations, limiting the ability of maritime platforms to plan bandwidth usage proactively. To the best of our knowledge, no prior work has developed a short-term predictive model for maritime LEO connectivity using real experimental field measurements. This paper proposes a data-driven forecasting model that predicts future downlink throughput using multi-horizon RandomForest regression. The model is trained using real experimental coastal measurement data incorporating recent throughput history, network-layer indicators, and environmental variables. The proposed approach reduces mean absolute error by approximately 31% compared to a persistence baseline for 15-minute horizons. It maintains a measurable improvement at 30 minutes, despite increased stochasticity. These findings confirm that proactive bandwidth awareness is feasible on maritime platforms and can effectively support operational decisions such as adaptive streaming, routing, and resource scheduling. The performance gap between forecasting horizons also highlights the need for expanded offshore datasets to improve prediction robustness under harsher maritime environments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

X-ray Computed Tomography as a Metrology Technique for the Analysis of Additively Manufactured Material

X-ray computed tomography (X-ray CT) is an analytical technique used in materials science to non-destructively characterize features in a variety materials like polymer, metals, composites, and explosives. It also has the capability of imaging additively manufacture, machine and assembled parts. The non-destructive imaging allows for the analysis of features (voids and cracks), which give a fundamental understanding of the material characteristics. Additionally, X-ray CT can obtain accurate measurements of dimensional and topographic variations due to different stimuli and assess the accuracy of material production. This study focuses on parts manufactured via metal additive manufacturing (AM). Although AM produces parts faster and easier, the printing process can produce defects (pores and surface roughness) that undermine the part’s mechanical properties and performance. The analysis of 3D printed objects has an asset in that the material has an STL file from which the item was printed, which is not available in many manufactured materials (i.e., foams) due to stochastic structures. For this study, the print accuracy of four additively manufactured cylinders will be assessed via X-ray CTto approximate the surface roughness and visualize any major morphological changes to assess the dimensional accuracy of complex additively manufactured parts. It was concluded that using X-ray CT to measure surface roughness was affective because reasonable surface roughness values were measured. Additionally, itwas determined that small-scale features can be produced via additive manufacturing with strong dimensional accuracy so long as the features are highly complex with sharp grooves.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Tensor decompositions for count data that leverage stochastic and deterministic optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the maximum likelihood estimator (MLE) of the Poisson CPD model. Here, this work presents two new algorithms that extend state-of-the-art local methods for Poisson CPD. Hybrid GCP-CPAPR combines Generalized Canonical Decomposition (GCP) with stochastic optimization and CP Alternating Poisson Regression (CPAPR), a deterministic algorithm, to increase the probability of converging to the MLE over either method used alone. Restarted CPAPR with SVDrop uses a heuristic based on the singular values of the CPD model unfoldings to identify convergence toward optimizers that are not the MLE and restarts within the feasible domain of the optimization problem, thus reducing overall computational cost when using a multi-start strategy. We provide empirical evidence that indicates our approaches outperform existing methods with respect to converging to the Poisson CPD MLE.

CPAPR↗
DOE OSTI2020

Stochastically Realized Observables for Excitonic Molecular Aggregates

In this work, we show that a stochastic approach enables calculations of the optical properties of large 2-dimensional and nanotubular excitonic molecular aggregates. Previous studies of such systems relied on numerically diagonalizing the dense and disordered Frenkel Hamiltonian, which scales approximately as $\mathcal{O}$($N$ 3 ) for $N$ dye molecules. Our approach scales much more efficiently as $\mathcal{O}$($N$ log($N$)), enabling quick study of systems with a million of coupled molecules on the micrometer size scale. We calculate several important experimental observables, including the optical absorption spectrum and density of states, and develop a stochastic formalism for the participation ratio. Quantitative agreement with traditional matrix diagonalization methods is demonstrated for both small- and intermediate-size systems. The stochastic methodology enables the study of the effects of spatial-correlation in site energies on the optical signatures of large 2D aggregates. Our results demonstrate that stochastic methods present a path forward for screening structural parameters and validating experiments and theoretical predictions in large excitonic aggregates.

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

Kernel learning backward SDE filter for data assimilation

In this paper, we develop a kernel learning backward SDE filter method to estimate the state of a stochastic dynamical system based on its partial noisy observations. A system of forward backward stochastic differential equations is used to propagate the state of the target dynamical model, and Bayesian inference is applied to incorporate the observational information. Further, to characterize the dynamical model in the entire state space, we introduce a kernel learning method to learn a continuous global approximation for the conditional probability density function of the target state by using discrete approximated density values as training data. Numerical experiments demonstrate that the kernel learning backward SDE is highly effective.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Real-time Ridesharing for Transportation Hubs with Demand and Supply Uncertainty

Transportation hubs in major cities generate a significant amount of trips by taxis and for-hail vehicles (FHV), with many of the trips sharing similar destinations. This suggests promising opportunities to leverage the collective travel needs with dedicated ridesharing solutions to reduce the externalities of excessive traffic at transportation hubs. In this study, we develop a novel dynamic ridesharing approach to serve trips from the transportation hub by considering (1) demand (new passengers) and supply (newly available vehicles) in the near future and (2) the uncertainty of future predictions. Our approach consists of two stages. In the first stage, we develop a data structure called hub mobility tree to generate potential combinations of shareable trips as candidate schedules efficiently. Then the generated schedules are used in the second stage to formulate the stochastic hub-based ridesharing problem (SHRP), which is a stochastic integer programming problem with the objective to maximize the total expected ridesharing profit over time. Due to the prohibitive number of shareable trips, we then approximately solve SHRP by the sample average approximate method (SAA), and a dual Lagrangian technique is implemented to further improve the scalability of the solution approach. We demonstrate the performances of the proposed method by simulating the ridesharing service at JFK airport using NYC taxi and FHV data. The results indicate that the proposed method outperforms the myopic ridesharing (maximize profit for a single time step) and the rolling horizon method with point estimation of future demand and supply.

dynamic ridesharing↗
DOE OSTI2025

Generative diffusion model surrogates for mechanistic agent-based biological models

Mechanistic, multicellular, agent-based models are commonly used to investigate tissue, organ, and organism-scale biology at single-cell resolution. The Cellular-Potts Model (CPM) is a powerful and popular framework for developing and interrogating these models. CPMs become computationally expensive at large space- and time- scales making application and investigation of developed models difficult. Surrogate models may allow for the accelerated evaluation of CPMs of complex biological systems. However, the stochastic nature of these models means each set of parameters may give rise to different model configurations, complicating surrogate model development. In this work, we leverage denoising diffusion probabilistic models (DDPMs) to train a generative AI surrogate of a CPM used to investigate in vitro vasculogenesis. We describe the use of an image classifier to learn the characteristics that define unique areas of a 2-dimensional parameter space. We then apply this classifier to aid in surrogate model selection and verification. Our CPM model surrogate generates model configurations 20,000 timesteps ahead of a reference configuration and demonstrates approximately a 22x reduction in computational time as compared to native code execution. Our work represents a step towards the implementation of DDPMs to develop digital twins of stochastic biological systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Enabling probabilistic learning on manifolds through double diffusion maps

Here, we present a generative learning framework for probabilistic sampling that extends Probabilistic Learning on Manifolds (PLoM), which is designed to generate statistically consistent realizations of a random vector in a finite-dimensional Euclidean space, informed by a (representative) set of observations. In its original form, PLoM constructs a reduced-order probabilistic model by combining three main components: (a) kernel density estimation to approximate the underlying probability measure, (b) Diffusion Maps to characterize the manifold of the data, and (c) a reduced-order Itô Stochastic Differential Equation (ISDE) to sample from the learned distribution. However, its sampling dynamics are posed in the ambient space and the retained number of reduced coordinates is chosen by projection-reconstruction error. In practice, this often (i) requires more coordinates than the data’s intrinsic dimension to achieve stable sampling and (ii) lacks a smooth, basis-independent lifting back to the data domain; moreover, standard Diffusion Maps emphasize harmonic eigenfunctions and can miss non-harmonic latent structure. We address these limitations by decoupling geometry learning from sampling: a first Diffusion Maps pass identifies non-harmonic coordinates on which we formulate a full-order ISDE directly in the latent space, while Double Diffusion Maps captures multiscale geometric features and Geometric Harmonics (GH) learns a smooth lifting map to the ambient variables that is independent of the particular diffusion basis. This hybrid design preserves the system’s dynamical richness with a compact geometric representation and enables principled out-of-sample inference. The effectiveness and robustness of the proposed method are illustrated through two numerical studies: one based on data generated from two-dimensional Hermite polynomial functions and another based on high-fidelity simulations of a detonation wave in a reactive flow.

Double diffusion maps↗
DOE OSTI2025

Effects of grain size and porosity on cladding failure in high-burnup UO 2 : A sensitivity and uncertainty study

Isotopic taggants are being studied to aid in the provenance assessment of nuclear materials. However, these taggants must be selected such that they do not adversely affect fuel performance during normal operation or accident scenarios. Taggants are known to affect the fuel’s grain size and porosity. In the work described in this paper, the BISON fuel performance code was used to assess the potential effects of taggants (i.e., grain size and porosity) on fuel rod behavior and cladding failure during a high-burnup, large-break loss-of-coolant accident. Here, 281 individual fuel rods from the same reactor core were modeled for a sensitivity study, a parametric study, and uncertainty quantification. The cladding failure predictions often exhibited stochastic behavior. After additional study, it was found that the cladding failure model is highly sensitive to residual error inherent to numerical approximation solvers. Some strategies to mitigate this sensitivity are discussed. The study found no relationship between known taggant effects and cladding failure status. However, taggants were found to affect the time and location of failure in certain rods. In conclusion, future work to continue investigating and validating these findings is briefly discussed.

Doped UO 2↗
DOE OSTI2022

A Logarithmic Bayesian Approach to Quantum Error Detection

We consider the problem of continuous quantum error correction from a Bayesian perspective, proposing a pair of digital filters using logarithmic probabilities that are able to achieve near-optimal performance on a three-qubit bit-flip code, while still being reasonable to implement on low-latency hardware. These practical filters are approximations of an optimal filter that we derive explicitly for finite time steps, in contrast with previous work that has relied on stochastic differential equations such as the Wonham filter. By utilizing logarithmic probabilities, we are able to eliminate the need for explicit normalization and can reduce the Gaussian noise distribution to a simple quadratic expression. The state transitions induced by the bit-flip errors are modeled using a Markov chain, which for log-probabilities must be evaluated using a LogSumExp function. We develop the two versions of our filter by constraining this LogSumExp to have either one or two inputs, which favors either simplicity or accuracy, respectively. Using simulated data, we demonstrate that the single-term and two-term filters are able to significantly outperform both a double threshold scheme and a linearized version of the Wonham filter in tests of error detection under a wide variety of error rates and time steps.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Production of neutron-rich heavy nuclei in deep-inelastic 208 Pb + 208 Pb collisions within the stochastic mean-field theory

In deep-inelastic collisions of heavy nuclei, reaction products with a wide range of mass and charge are produced. Such collisions been considered as a possible way to produce superheavy nuclei, as an alternative to fusion reactions. To provide reliable theoretical predictions, it is desired to develop microscopic approaches that correctly and accurately describe nucleon transfer processes in dissipative collisions of heavy nuclei. The purpose of the present work is (1) to investigate the mechanism of nucleon transfers in dissipative collisions of two heavy nuclei, and (2) to explore possible pathways to produce neutron-rich heavy nuclei, through detailed theoretical analyses of fluctuations and correlations in nucleon transfers in 208 Pb + 208 Pb reactions. Three-dimensional time-dependent Hartree-Fock (TDHF) calculations are performed for the collisions of 208 Pb + 208 Pb at 𝐸 c.m. = 832, 936, and 1040 MeV, using the Skyrme SLy4d energy density functional. To calculate fluctuations and correlations in nucleon transfers, we employ the stochastic mean-field (SMF) theory, and the results are compared with another theoretical framework currently available, the time-dependent random phase approximation (TDRPA). Primary and secondary production cross sections are calculated with the SMF theory combined with a statistical model, GEMINI ++ . Using information of nucleon flow across a neck of colliding nuclei in TDHF calculations, we solve quantal diffusion equations for fluctuations and correlations in nucleon transfers based on the SMF theory. From the SMF calculations, we obtain the time evolution of diffusion coefficients as well as fluctuations and correlations in nucleon transfers for a range of initial orbital angular momenta. We compare the results of the SMF calculations with those of TDRPA, showing that TDRPA tends to predict substantially larger fluctuations and correlations in strongly damped collisions of heavy nuclei, which exhibit complex initial angular momentum dependence, while the SMF results provide almost constant (stable) values. Using the obtained fluctuations and correlations, we calculate primary and secondary production cross sections for the 208 Pb + 208 Pb collisions. From the results, we find that both lighter and heavier reaction products as compared to 208 Pb are produced for a wide region in the 𝑁−𝑍 plane as primary products, thanks to the quantal diffusion mechanism in the dissipative collisions. However, we show that cross sections for production of heavy nuclei with 𝑍 ≳ 90 or 𝑁 ≳ 135 are washed out due to secondary particle evaporation and/or fission processes. On the other hand, we find that there remain sizable cross sections for production of neutron-rich nuclei along 𝑁 = 126 with 𝑍< 82, even after secondary disintegration processes. We demonstrate that the secondary production cross sections depend weakly on incident energies, but lower (higher) energy is slightly preferred for production of nuclei with smaller (larger) atomic numbers as compared to 𝑍 = 82. Here, based on the microscopic SMF calculations, it has been shown that deep-inelastic collisions of heavy nuclei, such as 208 Pb + 208 Pb examined in this study, can be a promising means to produce neutron-rich heavy nuclei along 𝑁=126. Discrepancies between the SMF and TDRPA approaches are left unsolved for future investigations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Stochastic tensor contraction for quantum chemistry

Many computational methods in ab initio quantum chemistry are formulated in terms of high-order tensor contractions, whose cost determines the size of system that can be studied. We introduce stochastic tensor contraction to perform such operations with greatly reduced cost, and present its application to the gold-standard quantum chemistry method, coupled cluster theory with up to perturbative triples. For total energy errors more stringent than chemical accuracy, we reduce the computational scaling to that of mean-field theory, while starting to approach the mean-field absolute cost, thereby challenging the existing cost-to-accuracy landscape. Benchmarks against state-of-the-art local correlation approximations further show that we achieve an order-of-magnitude improvement in both total computation time and error, with significantly reduced sensitivity to system dimensionality and electron delocalization. We conclude that stochastic tensor contraction is a powerful computational primitive to accelerate a wide range of quantum chemistry.

Chemical Physics (physics.chem-ph)↗
DOE OSTI2024

Diffusion-Model-Assisted Supervised Learning of Generative Models for Density Estimation

Here, we present a supervised learning framework of training generative models for density estimation. Generative models, including generative adversarial networks (GANs), normalizing flows, and variational auto-encoders (VAEs), are usually considered as unsupervised learning models, because labeled data are usually unavailable for training. Despite the success of the generative models, there are several issues with the unsupervised training, e.g., requirement of reversible architectures, vanishing gradients, and training instability. To enable supervised learning in generative models, we utilize the score-based diffusion model to generate labeled data. Unlike existing diffusion models that train neural networks to learn the score function, we develop a training-free score estimation method. This approach uses mini-batch-based Monte Carlo estimators to directly approximate the score function at any spatial-temporal location in solving an ordinary differential equation (ODE), corresponding to the reverse-time stochastic differential equation (SDE). This approach can offer both high accuracy and substantial time savings in neural network training. Once the labeled data are generated, we can train a simple, fully connected neural network to learn the generative model in the supervised manner. Compared with existing normalizing flow models, our method does not require the use of reversible neural networks and avoids the computation of the Jacobian matrix. Compared with existing diffusion models, our method does not need to solve the reverse-time SDE to generate new samples. As a result, the sampling efficiency is significantly improved. We demonstrate the performance of our method by applying it to a set of 2D datasets as well as real data from the University of California Irvine (UCI) repository.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Multi-Fidelity Stochastic Economic Dispatch for Operating Low Carbon Power Grids

Grid operators can address the inherently stochastic nature of renewables by solving a two-stage stochastic programming model that minimizes the cost of dispatch decisions while accounting for the complex grid dynamics. It is common to use a sample average approximation to estimate the expectation of the second stage costs in this model. However, the large sample count needed for numerical accuracy makes effective modeling large-scale electric grids computationally intractable. We introduce a control variate multi-fidelity estimator for the second-stage recourse that enables high quality dispatch decisions in real-time with a reduced computational burden. We obtain a hierarchy of model fidelities by linearizing the AC power flow system representation to DC power flow, and by relaxing transmission and voltage network constraints. We evaluate the performance of our proposed method on a synthetic grid with 73 buses against a deterministic baseline with persistence forecast and a high-fidelity reference. Our analysis shows a computational speed-up of 7.62x with a minimal loss in accuracy. The multi-fidelity method is well suited to fidelity combinations that use a simplified network topology in their lower fidelity model and is an attractive option for applications where accurate grid modeling needed on a limited computational budget.

24 POWER TRANSMISSION AND DISTRIBUTION↗