Search NASA⌕ Search

SEARCH · Search NASA

Results for “Stochastic optimization”

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 1,153 records · Page 64

A Multistage Stochastic Transmission Expansion Algorithm for Wide-Area Planning under Uncertainty

The overall objective for this project was to develop and demonstrate a set of methods for solving the transmission investment problem for a large network considering many possible scenarios of future conditions and multiple decision points when investments can be made. Project sub-objectives achieved this goal through a succession of extending the methods to apply to problems with increasing complexity or additional features, including the number of decision points, whether generation and transmission are co-optimized, and whether AC or DC power flow is used. A transmission model was developed for the Western Electric Coordinating Council (WECC) region, the high-voltage transmission system that serves the western third of the continental U.S. Using a dataset provided by WECC and by researchers from John Hopkins University, we have validated and demonstrated the model and used it to compare the new method for solving multi-stage stochastic transmission planning to several state-of-the-art techniques. The project has resulted in several key outcomes and achievements: The covariance-based method for choosing a small set of hours to represent short-term variability has superior performance in terms of accuracy to existing methods, including K-means clustering and Importance Sampling; The combined partitioning method for long-term uncertainty with the nested clustering approach for choosing representative hours for each long-term group has superior accuracy for equivalent computational effort compared with existing methods; Using the partitioning/clustering method combined with Sample Average Approximation provides both statistical bounds on the quality of the solution and at the same time, a complete investment plan for all contingencies in the full uncertainty set; no existing methods can provide both at the same time; The method is demonstrated to work well for choosing both transmission and generation investments; A variant on the method allows for both scenario selection and simultaneous correction for the error from the DC power flow approximation to provide a tractable method for AC power flow-based transmission planning under uncertainty; The method applied to the WECC case study demonstrates the additional value to the system operator and the consumer of identifying flexible investment options in the near-term decisions. In particular, the case study exhibits significant option value in postponing some transmission additions that appear useful but in some long-term system states create new congestion problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Robust volume calculations for Constructive Solid Geometry (CSG) components in Monte Carlo transport calculations

In this paper we consider a new generalized algorithm for the efficient calculation of component object volumes given their equivalent constructive solid geometry (CSG) definition. The new method relies on domain decomposition to recursively subdivide the original component into smaller pieces with volumes that can be computed analytically or stochastically, if needed. Unlike simpler brute-force approaches, the proposed decomposition scheme is guaranteed to be robust and accurate to within a user-defined tolerance. The new algorithm is also fully general and can handle any valid CSG component definition, without the need for additional input from the user. The new technique has been specifically optimized to calculate volumes of component definitions commonly found in models used for Monte Carlo particle transport simulations for criticality safety and reactor analysis applications. However, the algorithm can be easily extended to any application which uses CSG representations for component objects. The paper provides a complete description of the novel volume calculation algorithm, along with a discussion of the conjectured error bounds on volumes calculated within the method. In addition, numerical results comparing the new algorithm with a standard stochastic volume calculation algorithm are presented for a series of problems spanning a range of representative component sizes and complexities. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Bayesian estimation of Karhunen–Loève expansions; A random subspace approach

One of the most widely-used statistical procedures for dimensionality reduction of high dimensional random fields is Principal Component Analysis (PCA), which is based on the Karhunen-Lo eve expansion (KLE) of a stochastic process with finite variance. The KLE is analogous to a Fourier series expansion for a random process, where the goal is to find an orthogonal transformation for the data such that the projection of the data onto this orthogonal subspace is optimal in the L 2 sense, i.e, which minimizes the mean square error. In practice, this orthogonal transformation is determined by performing an SVD (Singular Value Decomposition) on the sample covariance matrix or on the data matrix itself. Sampling error is typically ignored when quantifying the principal components, or, equivalently, basis functions of the KLE. Furthermore, it is exacerbated when the sample size is much smaller than the dimension of the random field. In this paper, we introduce a Bayesian KLE procedure, allowing one to obtain a probabilistic model on the principal components, which can account for inaccuracies due to limited sample size. The probabilistic model is built via Bayesian inference, from which the posterior becomes the matrix Bingham density over the space of orthonormal matrices. We use a modified Gibbs sampling procedure to sample on this space and then build a probabilistic Karhunen-Lo eve expansions over random subspaces to obtain a set of low-dimensional surrogates of the stochastic process. We illustrate this probabilistic procedure with a finite dimensional stochastic process inspired by Brownian motion.

97 MATHEMATICS AND COMPUTING↗

Sparse-grid, reduced-basis Bayesian inversion: Nonaffine-parametric nonlinear equations

We extend the reduced basis (RB) accelerated Bayesian inversion methods for affine-parametric, linear operator equations which are considered in [16,17] to non-affine, nonlinear parametric operator equations. We generalize the analysis of sparsity of parametric forward solution maps in [20] and of Bayesian inversion in [48,49] to the fully discrete setting, including Petrov–Galerkin high-fidelity (“HiFi”) discretization of the forward maps. We develop adaptive, stochastic collocation based reduction methods for the efficient computation of reduced bases on the parametric solution manifold. The nonaffinity and nonlinearity with respect to (w.r.t.) the distributed, uncertain parameters and the unknown solution is collocated; specifically, by the so-called Empirical Interpolation Method (EIM). For the corresponding Bayesian inversion problems, computational efficiency is enhanced in two ways: first, expectations w.r.t. the posterior are computed by adaptive quadratures with dimension-independent convergence rates proposed in [49]; the present work generalizes [49] to account for the impact of the PG discretization in the forward maps on the convergence rates of the Quantities of Interest (QoI for short). Second, we propose to perform the Bayesian estimation only w.r.t. a parsimonious, RB approximation of the posterior density. Based on the approximation results in [49], the infinite-dimensional parametric, deterministic forward map and operator admit N-term RB and EIM approximations which converge at rates which depend only on the sparsity of the parametric forward map. In several numerical experiments, the proposed algorithms exhibit dimension-independent convergence rates which equal, at least, the currently known rate estimates for N-term approximation. We propose to accelerate Bayesian estimation by first offline construction of reduced basis surrogates of the Bayesian posterior density. The parsimonious surrogates can then be employed for online data assimilation and for Bayesian estimation. They also open a perspective for optimal experimental design.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Extended Simulations of Graphene Growth with Updated Rate Coefficients

New simulations of graphene growth in flame environments are presented. The simulations employ a kinetic Monte Carlo (KMC) algorithm coupled to molecular mechanics (MM) geometry optimization to track individual graphenic species as they evolve. Focus is given to incorporation of five-member rings and resulting curvature and edge defects. The model code has been re-written to be more computationally efficient enabling a larger set of simulations to be run, decreasing stochastic fluctuations in the averaged results. The model also includes updated rate coefficients for graphene edge reactions recently published in the literature. The new simulations are compared to results from the previous model as well as to hydrogen to carbon ratios recorded in experiment and calculated with alternate models.

30 DIRECT ENERGY CONVERSION↗

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↗

Data-Driven Preemptive Voltage Monitoring and Control Using Probabilistic Voltage Sensitivities

Increased penetration levels of distributed variable renewable generation can cause random voltage fluctuations and violations at multiple nodes. Traditional methods of voltage control typically involve reactionary responses of capacitor banks, tap changers, and recently even smart inverters. But because of the lack of foresight in voltage violations, these controls are ineffective to completely mitigate the issue. Therefore, new methods of predicting voltage violations subject to random power injection changes in the distribution network are needed, which can be used to guide optimal and dynamic methods of voltage control. This work lays the foundation for such preemptive voltage monitoring and control by proposing an analytical and sensor data-driven voltage sensitivity analysis method. Driven by stochastic data and forecasts, the method can be used to develop probabilistic voltage sensitivities and consequently to predict system nodes with high likelihood of voltage limit violations. The effectiveness of this method is tested on IEEE 69-node distribution system integrated with distributed solar. The results demonstrate the proposed method's ability to successfully predict nodes with high probability of voltage violations for a specific time-series simulation. The results also demonstrate the ability to guide timely power injection control actions to mitigate future voltage violations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Scalable Second Order Optimization for Machine Learning

Many machine learning (ML) training tasks are essentially optimization processes that would at first glance appear eminently parallelizable and scalable. However, effective acceleration of these tasks with scalable parallel hardware has proven to be elusive. While standard methods for machine learning, e.g., stochastic gradient descent (SGD) for DNNs, tend to be resource efficient, they appear to be fundamentally sequential in nature.

97 MATHEMATICS AND COMPUTING↗

Data-Driven Preemptive Voltage Monitoring and Control Using Probabilistic Voltage Sensitivities: Preprint

Increased penetration of distributed variable re-newable generation may cause random voltage fluctuations and violations at multiple nodes. Traditional methods of voltage control typically involve reactionary responses of capacitor banks, tap changers, and recently even smart inverters. But due to the lack of foresight in voltage violations, these controls are ineffective to completely mitigate the issue. Therefore, new methods of predicting voltage violations subject to random power injection changes in the distribution network is needed, which can be used to guide optimal and dynamic methods of voltage control. This work lays the foundation for such preemptive voltage monitoring and control by proposing an analytical and sensor data-driven voltage sensitivity analysis method. Driven by stochastic data and forecasts, the method can be used to develop probabilistic voltage sensitivities and consequently to predict system nodes with high likelihood of voltage limit violations. The effectiveness of this method is tested on IEEE 69 node distribution system integrated with distributed solar. The results demonstrate the proposed method's ability to successfully predict nodes with high probability of voltage violations for a specific time series simulation. The results also demonstrate the ability to guide timely power injection control actions to mitigate future voltage violations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Analysis of optical near-field energy transfer by stochastic model unifying architectural dependencies

We theoretically and experimentally demonstrate energy transfer mediated by optical near-field interactions in a multi-layer InAs quantum dot (QD) structure composed of a single layer of larger dots and N layers of smaller ones. We construct a stochastic model in which optical near-field interactions that follow a Yukawa potential, QD size fluctuations, and temperature-dependent energy level broadening are unified, enabling us to examine device-architecture-dependent energy transfer efficiencies. The model results are consistent with the experiments. This study provides an insight into optical energy transfer involving inherent disorders in materials and paves the way to systematic design principles of nanophotonic devices that will allow optimized performance and the realization of designated functions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Optimizing shift selection in multilevel Monte Carlo for disconnected diagrams in lattice QCD

The calculation of disconnected diagram contributions to physical signals is a computationally expensive task in Lattice QCD. To extract the physical signal, the trace of the inverse Lattice Dirac operator, a large sparse matrix, must be stochastically estimated. Because the variance of the stochastic estimator is typically large, variance reduction techniques must be employed. Multilevel Monte Carlo (MLMC) methods reduce the variance of the trace estimator by utilizing a telescoping sequence of estimators. Frequency Splitting is one such method that uses a sequence of inverses of shifted operators to estimate the trace of the inverse lattice Dirac operator, however there is no a priori way to select the shifts that minimize the cost of the multilevel trace estimation. Here we present a sampling and interpolation scheme that is able to predict the variances associated with Frequency Splitting under displacements of the underlying space time lattice. The interpolation scheme is able to predict the variances to high accuracy and therefore chooses shifts that correspond to an approximate minimum of the cost for the trace estimation. We show that Frequency Splitting with the chosen shifts displays significant speedups over multigrid deflation, and that these shifts can be used for multiple configurations within the same ensemble with no penalty to performance.

97 MATHEMATICS AND COMPUTING↗

Bayesian and LASSO Regressions for Comparative Permeability Modeling of Sandstone Reservoirs

In this research, Bayesian model averaging (BMA) and least absolute shrinkage and selection operator regression (LASSO) algorithms were adopted for the core permeability modeling as a function of well log and core measurements. More specifically, the core permeability (dependent factor) was modeled given the well log and core data (independent variables) and then predicted in non-cored intervals of a well in a sandstone formation. The BMA is a stochastic linear modeling and a Bayesian parameter selection. Among 50 linear models generated as a function of the independent variables and depicted in Occam’s window, the best model of the highest posterior probability is determined. The best model has the optimal subset parameters that most influences the response factor. The core permeability modeling was again conducted using the LASSO algorithm, which adopts a completely different way of modeling and subset selection by using the penalized least-squared equation. Both BMA and LASSO resulted in a very accurate prediction of the core permeability by achieving perfect measured and calculated permeability matching. Matches for the two algorithms were quantified by computing the adjusted R-squared and root-mean-squared prediction error. In addition, results of the BMA and LASSO were compared to the conventional multiple linear regression (LM). The LASSO algorithm led to an accurate matching similar to LM, but slightly better than BMA. Therefore, both BMA and LASSO represent integrated procedures for accurate permeability estimation similar to conventional regression analysis.

58 GEOSCIENCES↗

Velocity-space compression from Fermi acceleration with Lorentz scattering

The Fermi acceleration model describes how cosmic ray particles accelerate to great speeds by interacting with moving magnetic fields. In this work, we identify a variation of the model where light ions interact with a moving wall while undergoing pitch angle scattering through Coulomb collisions due to the presence of a heavier ionic species. The collisions introduce a stochastic component which adds complexity to the particle acceleration profile and sets it apart from collisionless Fermi acceleration models. The unusual effect captured by this simplified variation of Fermi acceleration is the nonconservation of phase space, with the possibility for a distribution of particles initially monotonically decreasing in energy to exhibit an energy peak upon compression. A peaked energy distribution might have interesting applications, such as to optimize fusion reactivity or to characterize astrophysical phenomena that exhibit nonthermal features.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

LIMITS ON THE STOCHASTIC GRAVITATIONAL WAVE BACKGROUND FROM THE NORTH AMERICAN NANOHERTZ OBSERVATORY FOR GRAVITATIONAL WAVES

We present an analysis of high-precision pulsar timing data taken as part of the North American Nanohertz Observatory for Gravitational Waves (NANOGrav) project. We have observed 17 pulsars for a span of roughly five years using the Green Bank and Arecibo radio telescopes. We analyze these data using standard pulsar timing models, with the addition of time-variable dispersion measure and frequency-variable pulse shape terms. Sub-microsecond timing residuals are obtained in nearly all cases, and the best rms timing residuals in this set are {approx}30-50 ns. We present methods for analyzing post-fit timing residuals for the presence of a gravitational wave signal with a specified spectral shape. These optimally take into account the timing fluctuation power removed by the model fit, and can be applied to either data from a single pulsar, or to a set of pulsars to detect a correlated signal. We apply these methods to our data set to set an upper limit on the strength of the nHz-frequency stochastic supermassive black hole gravitational wave background of h{sub c} (1 yr{sup -1}) < 7 Multiplication-Sign 10{sup -15} (95%). This result is dominated by the timing of the two best pulsars in the set, PSRs J1713+0747 and J1909-3744.

79 ASTRONOMY AND ASTROPHYSICS↗

A Moving Target Defense Control Framework for Cyber-Physical Systems

This paper considers the problem of efficiently and securely controlling cyber-physical systems that are operating in uncertain, and adversarial environments. To mitigate sensor, actuator attacks, and performance loss due to such attacks, we formulate a secure control algorithm that consists of a proactive and a reactive defense mechanism. The proactive mechanism, which is based on the principles of moving target defense, utilizes a stochastic switching structure to dynamically and continuously alter the parameters of the system, while hindering the attacker's ability to conduct successful reconnaissance to the system. The unpredictability of the current actuator and sensor is optimized using an information entropy measure, which is induced by probabilistic switching. The reactive mechanism on the other side, detects potentially attacked components, namely sensors and actuators, by leveraging online data to compute an integral Bellman error. A rigorous mathematical framework is presented to guarantee the stability of the equilibrium point of the closed-loop system, and provide a quantified bound on the performance loss when utilizing both reactive and proactive mechanisms. Simulation results show the efficacy of the proposed approaches on a benchmark aircraft model.

42 ENGINEERING↗

Integrating HPC, AI, and Workflows for Scientific Data Analysis: Report from Dagstuhl Seminar 23352

The Dagstuhl Seminar 23352, titled “Integrating HPC, AI, and Workflows for Scientific Data Analysis,” held from August 27 to September 1, 2023, was a significant event focusing on the synergy between High-Performance Computing (HPC), Artificial Intelligence (AI), and scientific workflow technologies. The seminar recognized that modern Big Data analysis in science rests on three pillars: workflow technologies for reproducibility and steering, AI and Machine Learning (ML) for versatile analysis, and HPC for handling large data sets. These elements, while crucial, have traditionally been researched separately, leading to gaps in their integration. The seminar aimed to bridge these gaps, acknowledging the challenges and opportunities at the intersection of these technologies. The event highlighted the complex interplay between HPC, workflows, and ML, noting how ML has increasingly been integrated into scientific workflows, thereby enhancing resource demands and bringing new requirements to HPC architectures, like support for GPUs and iterative computations. The seminar also addressed the challenges in adapting HPC for large-scale ML tasks, including in areas like deep learning, and the need for workflow systems to evolve to leverage ML in data analysis fully. Moreover, the seminar explored how ML could optimize scientific workflow systems and HPC operations, such as through improved scheduling and fault tolerance. A key focus was on identifying prestigious use cases of ML in HPC and understanding their unique, unmet requirements. The stochastic nature of ML and its impact on the reproducibility of data analysis on HPC systems was also a topic of discussion.

97 MATHEMATICS AND COMPUTING↗

Improving Robustness of Spectrogram Classifiers with Neural Stochastic Differential Equations

Signal analysis and classification is fraught with high levels of noise and perturbation. Computer-vision-based deep learning models applied to spectrograms have proven useful in the field of signal classification and detection; however, these methods aren't designed to handle the low signal-to-noise ratios inherent within non-vision signal processing tasks. While they are powerful, they are currently not the method of choice in the inherently noisy and dynamic critical infrastructure domain, such as smart-grid sensing, anomaly detection, and non-intrusive load monitoring. Currently, these models can be brittle, which makes them susceptible to noisy input. This also means they have sub-optimal stability of explanation outputs. Experts and technicians using these models to make decisions in real world scenarios need assurance that a model is performing as it is supposed to. The classification or prediction outputs it generates should be sound and grounded, not likely to change in the presence of shifting noise landscapes. In this work, we explore the idea of Neural Stochastic Differential Equations (NSDE's) to improve the robustness of models trained to classify time series data and the effect of NSDE's on the explainability of outputs. We then test the effectiveness of these approaches by applying them to a non-intrusive load monitoring (NILM) dataset that consists of simulated harmonic signals injected into a real building.

Brogan, Joel↗