Search NASA⌕ Search

SEARCH · Search NASA

Results for “Stochastic Algorithms”

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 397 records · Page 22

A moment projection method for population balance dynamics with a shrinkage term

A new method of moments for solving the population balance equation is developed and presented. The moment projection method (MPM) is numerically simple and easy to implement and attempts to address the challenge of particle shrinkage due to processes such as oxidation, evaporation or dissolution. It directly solves the moment transport equation for the moments and tracks the number of the smallest particles using the algorithm by Blumstein and Wheeler (1973) . The performance of the new method is measured against the method of moments (MOM) and the hybrid method of moments (HMOM). The results suggest that MPM performs much better than MOM and HMOM where shrinkage is dominant. The new method predicts mean quantities which are almost as accurate as a high-precision stochastic method calculated using the established direct simulation algorithm (DSA).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamic Event Tree Analysis Through RAVEN

Conventional Event-Tree (ET) based methodologies are extensively used as tools to perform reliability and safety assessment of complex and critical engineering systems. One of the disadvantages of these methods is that timing/sequencing of events and system dynamics is not explicitly accounted for in the analysis. In order to overcome these limitations several techniques, also know as Dynamic Probabilistic Risk Assessment (D-PRA), have been developed. Monte-Carlo (MC) and Dynamic Event Tree (DET) are two of the most widely used D-PRA methodologies to perform safety assessment of Nuclear Power Plants (NPP). In the past two years, the Idaho National Laboratory (INL) has developed its own tool to perform Dynamic PRA: RAVEN (Reactor Analysis and Virtual control ENvironment). RAVEN has been designed in a high modular and pluggable way in order to enable easy integration of different programming languages (i.e., C++, Python) and coupling with other application including the ones based on the MOOSE framework, developed by INL as well. RAVEN performs two main tasks: 1) control logic driver for the new Thermo-Hydraulic code RELAP-7 and 2) post-processing tool. In the first task, RAVEN acts as a deterministic controller in which the set of control logic laws (user defined) monitors the RELAP-7 simulation and controls the activation of specific systems. Moreover, RAVEN also models stochastic events, such as components failures, and performs uncertainty quantification. Such stochastic modeling is employed by using both MC and DET algorithms. In the second task, RAVEN processes the large amount of data generated by RELAP-7 using data-mining based algorithms. This paper focuses on the first task and shows how it is possible to perform the analysis of dynamic stochastic systems using the newly developed RAVEN DET capability. As an example, the Dynamic PRA analysis, using Dynamic Event Tree, of a simplified pressurized water reactor for a Station Black-Out scenario is presented.

42 ENGINEERING↗

Quantum optimization algorithms: Energetic implications

Since the dawn of quantum computing (QC), theoretical developments like Shor's algorithm proved the conceptual superiority of QC over traditional computing. However, such quantum supremacy claims are difficult to achieve in practice because of the technical challenges of realizing noiseless qubits. In the near future, QC applications will need to rely on noisy quantum devices that offload part of their work to classical devices. One way to achieve this is by using parameterized quantum circuits in optimization or even in machine learning tasks. The energy requirements of quantum algorithms have not yet been studied extensively. Here in this article, we explore several optimization algorithms using both theoretical insights and numerical experiments to understand their impact on energy consumption. Specifically, we highlight why and how algorithms like quantum natural gradient descent, simultaneous perturbation stochastic approximations or circuit learning methods, are at least 2x to 4x more energy efficient than their classical counterparts; why feedback-based quantum optimization is energy-inefficient; and how techniques like Rosalin can improve the energy efficiency of other algorithms by a factor of ≥2 0 x. Finally, we use the NchooseK high-level programming model to run optimization problems on both gate-based quantum computers and quantum annealers. Empirical data indicate that these optimization problems run faster, have better success rates, and consume less energy on quantum annealers than on their gate-based counterparts.

97 MATHEMATICS AND COMPUTING↗

Evaluation of a Machine-Learning Algorithm for Treatment Planning in Prostate Low-Dose-Rate Brachytherapy

Purpose: This work presents the application of a machine learning (ML) algorithm to automatically generate high-quality, prostate low-dose-rate (LDR) brachytherapy treatment plans. The ML algorithm can mimic characteristics of preoperative treatment plans deemed clinically acceptable by brachytherapists. The planning efficiency, dosimetry, and quality (as assessed by experts) of preoperative plans generated with an ML planning approach was retrospectively evaluated in this study. Methods and Materials: Preimplantation and postimplantation treatment plans were extracted from 100 high-quality LDR treatments and stored within a training database. The ML training algorithm matches similar features from a new LDR case to those within the training database to rapidly obtain an initial seed distribution; plans were then further fine-tuned using stochastic optimization. Preimplantation treatment plans generated by the ML algorithm were compared with brachytherapist (BT) treatment plans in terms of planning time (Wilcoxon rank sum, α = 0.05) and dosimetry (1-way analysis of variance, α = 0.05). Qualitative preimplantation plan quality was evaluated by expert LDR radiation oncologists using a Likert scale questionnaire. Results: The average planning time for the ML approach was 0.84 ± 0.57 minutes, compared with 17.88 ± 8.76 minutes for the expert planner (P=.020). Preimplantation plans were dosimetrically equivalent to the BT plans; the average prostate V150% was 4% lower for ML plans (P=.002), although the difference was not clinically significant. Respondents ranked the ML-generated plans as equivalent to expert BT treatment plans in terms of target coverage, normal tissue avoidance, implant confidence, and the need for plan modifications. Respondents had difficulty differentiating between plans generated by a human or those generated by the ML algorithm. Conclusions: Prostate LDR preimplantation treatment plans that have equivalent quality to plans created by brachytherapists can be rapidly generated using ML. The adoption of ML in the brachytherapy workflow is expected to improve LDR treatment plan uniformity while reducing planning time and resources.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Comparison of the kinetics of different Markov models for ligand binding under varying conditions

We recently derived a Markov model for macromolecular ligand binding dynamics from few physical assumptions and showed that its stationary distribution is the grand canonical ensemble [J. W. R. Martini, M. Habeck, and M. Schlather, J. Math. Chem. 52, 665 (2014)]. The transition probabilities of the proposed Markov process define a particular Glauber dynamics and have some similarity to the Metropolis-Hastings algorithm. Here, we illustrate that this model is the stochastic analog of (pseudo) rate equations and the corresponding system of differential equations. Moreover, it can be viewed as a limiting case of general stochastic simulations of chemical kinetics. Thus, the model links stochastic and deterministic approaches as well as kinetics and equilibrium described by the grand canonical ensemble. We demonstrate that the family of transition matrices of our model, parameterized by temperature and ligand activity, generates ligand binding kinetics that respond to changes in these parameters in a qualitatively similar way as experimentally observed kinetics. In contrast, neither the Metropolis-Hastings algorithm nor the Glauber heat bath reflects changes in the external conditions correctly. Both converge rapidly to the stationary distribution, which is advantageous when the major interest is in the equilibrium state, but fail to describe the kinetics of ligand binding realistically. To simulate cellular processes that involve the reversible stochastic binding of multiple factors, our pseudo rate equation model should therefore be preferred to the Metropolis-Hastings algorithm and the Glauber heat bath, if the stationary distribution is not of only interest.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Easy Algorithm to Generate Colored Noise Sequences

The need for accurate and efficient simulation of the noise background arises in statistical significance tests for periodic signals buried in colored noise. This paper discusses techniques for generating colored-noise sequences which simulate processes with a given spectral density. Matlab routines based on the fast fractional difference algorithm are presented. These routines can create various stochastic models (e.g., first-order autoregressive (AR(1)), power law (PL), autoregressive fractionally integrated moving average ((1, d, 0)), and generalized Gauss Markov (GGM)) that serve as possible candidate null hypotheses to test against in various scenarios. Allan variance and power spectral density (PSD) show that our algorithms are accurate and efficient, and can be easily implemented for stationary noise models and non-stationary PLs with spectral indices up to 2. Our algorithms can also be extended to produce a non-stationary PL with a range-limited steeper PSD (spectral indices up to about 4) using a GGM approximation with a proper break frequency. The red-noise leakage effect on the periodogram is further discussed. The result shows that our GGM approximation has a potential for alleviating the red-noise leakage in the PSD estimates. The Timmer and Koenig procedure is also included for comparison.

79 ASTRONOMY AND ASTROPHYSICS↗

Geomechanics-Based Stochastic Analysis of Injection- Induced Seismicity

The production of geothermal energy from dry and low permeability reservoirs is achieved by water circulation in natural and/or man-made fractures, and is referred to as enhanced or engineered geothermal systems (EGS). Often, the permeable zones have to be created by stimulation, a process which involves fracture initiation and/or activation of discontinuities such as faults and joints due to pore pressure and the in-situ stress perturbations. The stimulation of a rock mass is often accompanied by multiple microseismic events. Micro-seismic events associated with rock failure in shear, and shear slip on new or pre-existing fracture planes and possibly their propagations. The microseismic signals contain information about the sources of energy that can be used for understanding the hydraulic fracturing process and the created reservoir properties. Detection and interpretation of microseismic events is useful for estimating the stimulated zone, created reservoir permeability and fracture growth, and geometry of the geological structures and the in-situ stress state. The process commonly is referred to as seismicity-based reservoir characterization (SBRC). Although, progress has been made by scientific & geothermal communities for quantitative and qualitative analysis of reservoir stimulation using SBRC several key questions remain unresolved in the analysis of micro-seismicity namely, variation of seismic activity with injection rate, delayed micro-seismicity, and the relation of stimulated zone to the injected volume and its rate, and the resulting reservoir permeability. In addition, the current approach to SBRC does not consider the full range of relevant poroelastic and thermoelastic phenomena and neglects the uncertainty in rock properties and in-situ stress in the data inversion process. The objective of this research and technology developments was to develop a 3D SBRC model that addresses these shortcomings by taking into account hydro-thermo-poro-mechanical mechanisms associated with injection and utilizing a state-of-the-art stochastic inversion procedure. The approach proposed herein is innovative and significantly improves the existing SBCR technology (e.g., Shapiro et al. 2003) for geothermal reservoirs in several ways. First, the current scope of the SBRC is limited with respect to the physical processes considered and the rock properties used. Usually, the geomechanics analyses within SBRC is limited to the pore pressure diffusion in the rock mass, which is modeled using a time-dependent parabolic equation and solved using a finite element algorithm with either a line or a point source. However, water injection induces both poroelastic and thermoelastic stresses in the rock mass which affect the stress state. In fact, it has been suggested that thermoelastic stresses can play a dominant role in reservoir seismicity (Ghassemi et al., 2007). We include these important effects by using a fully-coupled poro-thermoelastic constitutive equations for the rock mass which will be solved using a 3D finite element model with more realistic injection geometries such as multiple injection/extraction sources (and in fractures), uncertainty in the material parameters and the in-situ stress distribution to better reflect the pore pressure and stress distributions. In addition, we developed a 3D stochastic fracture network model to study MEQ generation in fracture rocks. The model was verified using laboratory experiments, and calibrated and applied to Newberry EGS stimulation. In previous SBRC approaches, the triggering of micro-seismicity is modeled base on the assumption that the prior stochastic criticality model of the rock mass is a valid and adequate description. However, this assumption often does not hold in the field. Thus, we improved upon the current SBRC approach by using the micro-seismic responses to estimate the hydraulic diffusivity as well as the criticality distribution itself within the field. In this way, instead of relying on our a priori knowledge of criticality distribution, we combine an initial probabilistic description of criticality with the information contained in microseismic measurements to arrive at criticality solutions that are conditioned on both field data and our prior knowledge. Previous SBRC have relied upon a deterministic inversion approach to estimate the permeability, and the extent of the stimulated zone, whereas a stochastic inversion algorithm that recognizes and quantifies the uncertainties in the prior model, the time evolution of pore pressure distributions (modeling errors), and the observed seismic events is developed and used herein to realistically assess the quality of the solution. Finally, we developed a technique for processing discrete MEQ data to estimate fracture network properties such as dip and dip directions. The approach was successfully applied to the Fenton Hill HRD experiment and the Newberry EGS with results in good agreement with field observations.

15 GEOTHERMAL ENERGY↗

On a theory of stability for nonlinear stochastic chemical reaction networks

We present elements of a stability theory for small, stochastic, nonlinear chemical reaction networks. Steady state probability distributions are computed with zero-information (ZI) closure, a closure algorithm that solves chemical master equations of small arbitrary nonlinear reactions. Stochastic models can be linearized around the steady state with ZI-closure, and the eigenvalues of the Jacobian matrix can be readily computed. Eigenvalues govern the relaxation of fluctuation autocorrelation functions at steady state. Autocorrelation functions reveal the time scales of phenomena underlying the dynamics of nonlinear reaction networks. In accord with the fluctuation-dissipation theorem, these functions are found to be congruent to response functions to small perturbations. Significant differences are observed in the stability of nonlinear reacting systems between deterministic and stochastic modeling formalisms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective

An optimization algorithm for nonsmooth nonconvex constrained optimization problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objective functions is proposed and analyzed. Upper- \({\boldsymbol{\mathcal{C}^2}}\) is a weakly concave property that exists in difference of convex (DC) functions and arises naturally in many applications, particularly certain classes of solutions to parametric optimization problems e.g., recourse of stochastic programming and projection onto closed sets. The algorithm can be viewed as an extension of sequential quadratic programming (SQP) to nonsmooth problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objectives or a simplified bundle method. It is globally convergent with bounded algorithm parameters that are updated with a trust-region criterion. The algorithm handles general smooth constraints through linearization and uses a line search to ensure progress. The potential inconsistencies from the linearization of the constraints are addressed through a penalty method. In conclusion, the capabilities of the algorithm are demonstrated by solving both simple upper- \({\boldsymbol{\mathcal{C}^2}}\) problems and a real-world optimal power flow problem used in current power grid industry practices.

97 MATHEMATICS AND COMPUTING↗

Geostatistical interpolation of streambed hydrologic attributes with addition of left censored data and anisotropy

Spatial geostatistical interpolation of point measurements of streambed attributes in the hyporheic zone may be constrained by the streambed anisotropy, and data density and spatial distribution may significantly impact the results. Spatial clustering and low spatial data density can be caused by bedrock outcropping at the streambed limiting installation of in-stream piezometers. This study examines parameter error variability of the geostatistical interpolation using anisotropic interpolation methods and increasing the data density by adding left censored values (i.e., data below measurement limit) to locations where measurements were limited by exposed bedrock lining the streambed. The reduction in relative standard error of the interpolation was determined for the spatial distributions of streambed attributes including hydraulic conductivity, seepage flux, and mercury solute flux measured in two different years along a study reach in East Fork Poplar Creek, Tennessee, USA. Here, two methods to impute the left censored values were compared including the conventional half the detection limit substitution method, and the Stochastic Approximation of Expectation-Maximization (SAEM) algorithm, which both had comparable results. Imputing left censored data increased the data density to recommended ranges, reduced data clustering, increased the spatial dependence for some attributes, and reduced the standard error for each of the three attributes. For the reach considered herein, addition of the left censored values resulted in a larger error reduction than the consideration of anisotropy within the interpolation, which confirms the benefit of data addition to increase data density within data-limited river corridors.

58 GEOSCIENCES↗

Reinforcement Learning-based Output Structured Feedback for Distributed Multi-Area Power System Frequency Control

Load frequency control (LFC) is a key factor to maintain the stable frequency in multi-area power systems. As the modern power systems evolve from centralized to decentralized paradigm, LFC needs to consider the decentralized scheme that considers limited information from the information-exchange graph for the generator control of each interconnected area. This paper aims to solve a data-driven constrained LQR problem with mean-variance risk constraints and output structured feedback, and applies this framework to solve the LFC problem in multi-area power systems. By reformulating the constrained optimization problem into a minimax problem, the stochastic gradient descent max-oracle (SGDmax) algorithm with zero-order policy gradient (ZOPG) is adopted to find the optimal feedback gain from the learning, while guaranteeing the convergence. In addition, to improve the adaptation of the proposed learning method to new or varying models, we construct an emulator grid that approximates the dynamics of a physical grid and performs training based on this model. Once the feedback gain is obtained from the emulator grid, it is applied to the physical grid with a robustness test to check whether the controller from the approximated emulator applies to the actual system. Numerical tests show that the obtained feedback controller can successfully control the frequency of each area, while mitigating the uncertainty from the loads, with reliable robustness that ensures the adaptability of the obtained feedback gain to the actual physical grid.

Kwon, Kyung-bin↗

A Vibrational Energy Harvesting Sensor Based on Linear and Rotational Electromechanical Effects

In this investigation, a magnetically coupled double-spring design is presented for harvesting low-level non-stationary random vibrational energy. The sensor relies on multimodal coupling between the translation and rotation of a two-spring magnet and coil system to widen the harvesting bandwidth. Energy methods are used to develop a model to characterize the electromechanical response of the system, the solution of which is obtained using stochastic techniques based on a particle swarm algorithm. This approach provides an efficient method to estimate system parameters that otherwise are difficult or impossible to determine with independent measurements. The experimental results demonstrate agreement with the theoretical predictions over a limited bandwidth. The sensor can effectively harvest non-stationary vibration energy down to 10 -4 g within a limited bandwidth of 130–150 Hz. The sensor prototype has an operational volume of 2.6 cm 3 with a calculated power density of 0.2 W/cm 3 . The sensor’s small size results in a coupling efficiency of approximately 6% across the tested bandwidth.

42 ENGINEERING↗

An Integrated High-performance Computing and Digital Real-time Simulation Testbed to Benchmark Closed-loop Load Shedding Algorithms in Power Systems

An integrated testbed using digital real-time simulator (DRTS) and a high-performance computing (HPC) cluster is presented here to compare speed and performance of computational schemes to mitigate time-critical issues in electric power systems. The first approach in this testbed validation is taken by running a set of closed-loop load shedding algorithms to compare and contrast two paradigms of arresting cascading failure propagation. Two algorithms involve solving DC and AC power flow model-based optimization problems to compute load shedding at different buses, while a model-based stochastic search using parallel computing provides a viable alternative. The algorithms are implemented in the DRTS-HPC testbed for the IEEE 14-bus benchmark transmission system. As a proof of the concept, simulation results are presented for implementation of closed-loop load-shedding algorithms for cascading failures in the DRTS-HPC testbed

24 POWER TRANSMISSION AND DISTRIBUTION↗

Will Stochastic Devices Play Nice With Others in Neuromorphic Hardware?: There’s More to a Probabilistic System Than Noisy Devices

Achieving brain-like efficiency in computing requires a co-design between the development of neural algorithms, brain-inspired circuit design, and careful consideration of how to use emerging devices. The recognition that leveraging device-level noise as a source of controlled stochasticity represents an exciting prospect of achieving brain-like capabilities in probabilistic neural algorithms, but the reality of integrating stochastic devices with deterministic devices in an already-challenging neuromorphic circuit design process is formidable. Here, we explore how the brain combines different signaling modalities into its neural circuits as well as consider the implications of more tightly integrated stochastic, analog, and digital circuits. Further, by acknowledging that a fully CMOS implementation is the appropriate baseline, we conclude that if mixing modalities is going to be successful for neuromorphic computing, it will be critical that device choices consider strengths and limitations at the overall circuit level.

42 ENGINEERING↗

Community detection in hypergraphs via mutual information maximization

Abstract The hypergraph community detection problem seeks to identify groups of related vertices in hypergraph data. We propose an information-theoretic hypergraph community detection algorithm which compresses the observed data in terms of community labels and community-edge intersections. This algorithm can also be viewed as maximum-likelihood inference in a degree-corrected microcanonical stochastic blockmodel. We perform the compression/inference step via simulated annealing. Unlike several recent algorithms based on canonical models, our microcanonical algorithm does not require inference of statistical parameters such as vertex degrees or pairwise group connection rates. Through synthetic experiments, we find that our algorithm succeeds down to recently-conjectured thresholds for sparse random hypergraphs. We also find competitive performance in cluster recovery tasks on several hypergraph data sets.

97 MATHEMATICS AND COMPUTING↗

Learning Stochastic Parametric Differentiable Predictive Control Policies

We present a scalable unsupervised learning-based method for obtaining explicit control policies for model predictive control problems for stochastic linear systems with additive uncertainties subject to nonlinear chance constraints. We call the proposed method stochastic parametric differentiable predictive control (SP-DPC), which extends the recently proposed deterministic DPC policy optimization algorithm. We formulate the SP-DPC as a deterministic approximation to the stochastic parametric constrained optimal control problem via independent sampling of the problem's parameters and uncertainties. This formulation allows us to directly compute the policy gradients via automatic differentiation of the problem's value function, evaluated over sampled parameters and uncertainties. In particular, the computed expectation of the problem's value function is backpropagated through the finite-time closed-loop system rollouts parametrized by a known nominal system dynamics model and neural control policy. We also provide theoretical probabilistic guarantees on closed-loop stability and chance constraints satisfaction for systems controlled by learned neural policies. We demonstrate the computational efficiency and scalability of the proposed policy optimization algorithm in three numerical examples, including systems with a large number of states or subject to nonlinear constraints.

Drgona, Jan↗

Stochastic derivative-free optimization using a trust region framework

This study presents a trust region algorithm to minimize a function f when one has access only to noise-corrupted function values f¯. The model-based algorithm dynamically adjusts its step length, taking larger steps when the model and function agree and smaller steps when the model is less accurate. The method does not require the user to specify a fixed pattern of points used to build local models and does not repeatedly sample points. If f is sufficiently smooth and the noise is independent and identically distributed with mean zero and finite variance, we prove that our algorithm produces iterates such that the corresponding function gradients converge in probability to zero. As a result, we present a prototype of our algorithm that, while simplistic in its management of previously evaluated points, solves benchmark problems in fewer function evaluations than do existing stochastic approximation methods.

97 MATHEMATICS AND COMPUTING↗