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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

The Multi-scenario Extreme Weather Simulator: Energy Resilience for Mission Assurance

The Multi-scenario extreme weather simulator (MEWS) is a stochastic weather generation tool. The MEWS algorithm uses 50 or more years of National Oceanic and Atmospheric Association (NOAA) daily summaries [1] for maximum and minimum temperature and NOAA climate norms [2] to calculate historical heat wave and cold snap statistics. The algorithm takes these statistics and shifts them according to multiplication factors provided in the Intergovernmental Panel on Climate Change (IPCC) physical basis technical summary [3] for heat waves.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Real-Time Krylov Theory for Quantum Computing Algorithms

Quantum computers provide new avenues to access ground and excited state properties of systems otherwise difficult to simulate on classical hardware. New approaches using subspaces generated by real-time evolution have shown efficiency in extracting eigenstate information, but the full capabilities of such approaches are still not understood. In recent work, we developed the variational quantum phase estimation (VQPE) method, a compact and efficient real-time algorithm to extract eigenvalues on quantum hardware. Here we build on that work by theoretically and numerically exploring a generalized Krylov scheme where the Krylov subspace is constructed through a parametrized real-time evolution, which applies to the VQPE algorithm as well as others. We establish an error bound that justifies the fast convergence of our spectral approximation. We also derive how the overlap with high energy eigenstates becomes suppressed from real-time subspace diagonalization and we visualize the process that shows the signature phase cancellations at specific eigenenergies. We investigate various algorithm implementations and consider performance when stochasticity is added to the target Hamiltonian in the form of spectral statistics. To demonstrate the practicality of such real-time evolution, we discuss its application to fundamental problems in quantum computation such as electronic structure predictions for strongly correlated systems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1982

Random element method for numerical modeling of diffusional processes

The random element method is a generalization of the random vortex method that was developed for the numerical modeling of momentum transport processes as expressed in terms of the Navier-Stokes equations. The method is based on the concept that random walk, as exemplified by Brownian motion, is the stochastic manifestation of diffusional processes. The algorithm based on this method is grid-free and does not require the diffusion equation to be discritized over a mesh, it is thus devoid of numerical diffusion associated with finite difference methods. Moreover, the algorithm is self-adaptive in space and explicit in time, resulting in an improved numerical resolution of gradients as well as a simple and efficient computational procedure. The method is applied here to an assortment of problems of diffusion of momentum and energy in one-dimension as well as heat conduction in two-dimensions in order to assess its validity and accuracy. The numerical solutions obtained are found to be in good agreement with exact solution except for a statistical error introduced by using a finite number of elements, the error can be reduced by increasing the number of elements or by using ensemble averaging over a number of solutions.

Ghoniem, A. F.↗
NASA NTRS1988

Algorithm For The Discrete-O timal-Output-Feedback Problem

Change in cost function due to change in feedback gain calculated. Algorithm for feedback control systems considers stochastic, infinite-time, discrete-output-feedback problem for time-invariant linear systems. Optimal-output-feedback problem formulates modern control-law-design problem in which only selected number of plant-state variables used.

Halyo, Nesim↗
NASA NTRS1989

An approximate methods approach to probabilistic structural analysis

A major research and technology program in Probabilistic Structural Analysis Methods (PSAM) is currently being sponsored by the NASA Lewis Research Center with Southwest Research Institute as the prime contractor. This program is motivated by the need to accurately predict structural response in an environment where the loadings, the material properties, and even the structure may be considered random. The heart of PSAM is a software package which combines advanced structural analysis codes with a fast probability integration (FPI) algorithm for the efficient calculation of stochastic structural response. The basic idea of PAAM is simple: make an approximate calculation of system response, including calculation of the associated probabilities, with minimal computation time and cost, based on a simplified representation of the geometry, loads, and material. The deterministic solution resulting should give a reasonable and realistic description of performance-limiting system responses, although some error will be inevitable. If the simple model has correctly captured the basic mechanics of the system, however, including the proper functional dependence of stress, frequency, etc. on design parameters, then the response sensitivities calculated may be of significantly higher accuracy.

Mcclung, R. C.↗
NASA NTRS1993

Stochastic Parameters in Lunar Laser Ranging

This oral presentation describes the techniques, algorithms, and results of incorporatng a Kalman-smoothing technique into the square-root information filter when estimating deterministic and stochastic parameters relating to Earth, the Moon, and the lunar and planetary ephemerides.

lunar laser ranging ephemerides stochastic paramet↗
NASA NTRS2010

Comparison of Traditional Design Nonlinear Programming Optimization and Stochastic Methods for Structural Design

Structural design generated by traditional method, optimization method and the stochastic design concept are compared. In the traditional method, the constraints are manipulated to obtain the design and weight is back calculated. In design optimization, the weight of a structure becomes the merit function with constraints imposed on failure modes and an optimization algorithm is used to generate the solution. Stochastic design concept accounts for uncertainties in loads, material properties, and other parameters and solution is obtained by solving a design optimization problem for a specified reliability. Acceptable solutions were produced by all the three methods. The variation in the weight calculated by the methods was modest. Some variation was noticed in designs calculated by the methods. The variation may be attributed to structural indeterminacy. It is prudent to develop design by all three methods prior to its fabrication. The traditional design method can be improved when the simplified sensitivities of the behavior constraint is used. Such sensitivity can reduce design calculations and may have a potential to unify the traditional and optimization methods. Weight versus reliabilitytraced out an inverted-S-shaped graph. The center of the graph corresponded to mean valued design. A heavy design with weight approaching infinity could be produced for a near-zero rate of failure. Weight can be reduced to a small value for a most failure-prone design. Probabilistic modeling of load and material properties remained a challenge.

Patnaik, Surya N.↗
NASA NTRS2010

Extracting Independent Local Oscillatory Geophysical Signals by Geodetic Tropospheric Delay

Zenith Tropospheric Delay (ZTD) due to water vapor derived from space geodetic techniques and numerical weather prediction simulated-reanalysis data exhibits non-linear and non-stationary properties akin to those in the crucial geophysical signals of interest to the research community. These time series, once decomposed into additive (and stochastic) components, have information about the long term global change (the trend) and other interpretable (quasi-) periodic components such as seasonal cycles and noise. Such stochastic component(s) could be a function that exhibits at most one extremum within a data span or a monotonic function within a certain temporal span. In this contribution, we examine the use of the combined Ensemble Empirical Mode Decomposition (EEMD) and Independent Component Analysis (ICA): the EEMD-ICA algorithm to extract the independent local oscillatory stochastic components in the tropospheric delay derived from the European Centre for Medium-Range Weather Forecasts (ECMWF) over six geodetic sites (HartRAO, Hobart26, Wettzell, Gilcreek, Westford, and Tsukub32). The proposed methodology allows independent geophysical processes to be extracted and assessed. Analysis of the quality index of the Independent Components (ICs) derived for each cluster of local oscillatory components (also called the Intrinsic Mode Functions (IMFs)) for all the geodetic stations considered in the study demonstrate that they are strongly site dependent. Such strong dependency seems to suggest that the localized geophysical signals embedded in the ZTD over the geodetic sites are not correlated. Further, from the viewpoint of non-linear dynamical systems, four geophysical signals the Quasi-Biennial Oscillation (QBO) index derived from the NCEP/NCAR reanalysis, the Southern Oscillation Index (SOI) anomaly from NCEP, the SIDC monthly Sun Spot Number (SSN), and the Length of Day (LoD) are linked to the extracted signal components from ZTD. Results from the synchronization analysis show that ZTD and the geophysical signals exhibit (albeit subtle) site dependent phase synchronization index.

Botai, O. J.↗
DOE OSTI2023

Stochastic projective splitting

Here, we present a new, stochastic variant of the projective splitting (PS) family of algorithms for inclusion problems involving the sum of any finite number of maximal monotone operators. This new variant uses a stochastic oracle to evaluate one of the operators, which is assumed to be Lipschitz continuous, and (deterministic) resolvents to process the remaining operators. Our proposal is the first version of PS with such stochastic capabilities. We envision the primary application being machine learning (ML) problems, with the method’s stochastic features facilitating “mini-batch” sampling of datasets. Since it uses a monotone operator formulation, the method can handle not only Lipschitz-smooth loss minimization, but also min–max and noncooperative game formulations, with better convergence properties than the gradient descent-ascent methods commonly applied in such settings. The proposed method can handle any number of constraints and nonsmooth regularizers via projection and proximal operators. We prove almost-sure convergence of the iterates to a solution and a convergence rate result for the expected residual, and close with numerical experiments on a distributionally robust sparse logistic regression problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization

Here, we consider unconstrained stochastic optimization problems with no available gradient information. Such problems arise in settings from derivative-free simulation optimization to reinforcement learning. We propose an adaptive sampling quasi-Newton method where we estimate the gradients using finite differences of stochastic function evaluations within a common random number framework. We develop modified versions of a norm test and an inner product quasi-Newton test to control the sample sizes used in the stochastic approximations and provide global convergence results to the neighborhood of a locally optimal solution. We present numerical experiments on simulation optimization problems to illustrate the performance of the proposed algorithm. When compared with classical zeroth-order stochastic gradient methods, we observe that our strategies of adapting the sample sizes significantly improve performance in terms of the number of stochastic function evaluations required.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Slow-scale split-step tau-leap method for stiff stochastic chemical systems

Tau-leaping is a family of algorithms for the approximate simulation of the discrete state continuous time Markov chains. A motivation for the development of such methods can be found, for instance, in the fields of chemical kinetics and systems biology. It is known that the dynamical behavior of biochemical systems is often intrinsically stiff representing a serious challenge for their numerical approximation. The naive extension of stiff deterministic solvers to stochastic integration often yields numerical solutions with either impractically large relaxation times or incorrectly resolved covariance. In this paper, we propose a splitting heuristic which helps to resolve some of these issues. The proposed integrator contains a number of unknown parameters which are estimated for each particular problem from the moment equations of the corresponding linearized system. We show that this method is able to reproduce the exact mean and variance of the linear scalar test equation and demonstrates a good accuracy for the arbitrarily stiff systems at least in the linear case. The numerical examples for both linear and nonlinear systems are also provided, and the obtained results confirm the efficiency of the considered splitting approach.

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

Scalable and Memory-Efficient Algorithms for Controlling Networked Epidemic Processes Using Multiplicative Weights Update Method

We study the problem of designing scalable algorithms to find effective intervention strategies for controlling stochastic epidemic processes on networks. This is a common problem arising in agent based models for epidemic spread. Previous approaches to this problem focus on either heuristics with no guarantees or approximation algorithms that scale only to networks corresponding to county-sized populations, typically, with less than a million nodes. In particular, the mathematical-programming based approaches need to solve the Linear Program (LP) relaxation of the problem using an LP solver, which restricts the scalability of this approach. In this work, we overcome this restriction by designing an algorithm that adapts the multiplicative weights update (MWU) framework, along with the sample average approximation (SAA) technique, to approximately solve the linear program (LP) relaxation for the problem. To scale this approach further, we provide a memory-efficient algorithm that enables scaling to large networks, corresponding to country-size populations, with over 300 million nodes and 30 billion edges. Furthermore, we show that this approach provides near-optimal solutions to the LP in practice.

Sambaturu, Prathyush↗
DOE OSTI2025

Robust A-Optimal Experimental Design for Sensor Placement in Bayesian Linear Inverse Problems

Optimal design of experiments for Bayesian inverse problems has recently gained wide popularity and attracted much attention, especially in the computational science and Bayesian inversion communities. An optimal design maximizes a predefined utility function that is formulated in terms of the elements of an inverse problem, an example being optimal sensor placement for parameter identification. The state-of-the-art algorithmic approaches following this simple formulation generally overlook misspecification of the elements of the inverse problem, such as the prior or the measurement uncertainties. This work presents an efficient algorithmic approach for designing optimal experimental design schemes for Bayesian linear inverse problems such that the optimal design is robust to misspecification of elements of the inverse problem. Specifically, we consider a worst-case scenario approach for the uncertain or misspecified parameters, formulate robust objectives, and propose an algorithmic approach for optimizing such objectives. Furthermore, both relaxation and stochastic solution approaches are discussed with detailed analysis and insight into the interpretation of the problem and the proposed algorithmic approach. Extensive numerical experiments to validate and analyze the proposed approach are carried out for sensor placement in a parameter identification problem.

Bayesian inverse problems↗
NASA NTRS2010

Physics-Based Methods of Failure Analysis and Diagnostics in Human Space Flight

The Integrated Health Management (IHM) for the future aerospace systems requires to interface models of multiple subsystems in an efficient and accurate information environment at the earlier stages of system design. The complexity of modern aeronautic and aircraft systems (including e.g. the power distribution, flight control, solid and liquid motors) dictates employment of hybrid models and high-level reasoners for analysing mixed continuous and discrete information flow involving multiple modes of operation in uncertain environments, unknown state variables, heterogeneous software and hardware components. To provide the information link between key design/performance parameters and high-level reasoners we rely on development of multi-physics performance models, distributed sensors networks, and fault diagnostic and prognostic (FD&P) technologies in close collaboration with system designers. The main challenges of our research are related to the in-flight assessment of the structural stability, engine performance, and trajectory control. The main goal is to develop an intelligent IHM that not only enhances components and system reliability, but also provides a post-flight feedback helping to optimize design of the next generation of aerospace systems. Our efforts are concentrated on several directions of the research. One of the key components of our strategy is an innovative approach to the diagnostics/prognostics based on the real time dynamical inference (DI) technologies extended to encompass hybrid systems with hidden state trajectories. The major investments are into the multiphysics performance modelling that provides an access of the FD&P technologies to the main performance parameters of e.g. solid and liquid rocket motors and composite materials of the nozzle and case. Some of the recent results of our research are discussed in this chapter. We begin by introducing the problem of dynamical inference of stochastic nonlinear models and reviewing earlier results. Next, we present our analytical approach to the solution of this problem based on the path integral formulation. The resulting algorithm does not require an extensive global search for the model parameters, provides optimal compensation for the effects of dynamical noise, and is robust for a broad range of dynamical models. In the following Section the strengths of the algorithm are illustrated illustrated by inferring the parameters of the stochastic Lorenz system and comparing the results with those of earlier research. Next, we discuss a number of recent results in application to the development of the IHM for aerospace system. Firstly, we apply dynamical inference approach to a solution of classical three tank problems with mixed unknown continuous and binary parameters. The problem is considered in the context of ground support system for filling fuel tanks of liquid rocket motors. It is shown that the DI algorithm is well suited for successful solution of a hybrid version of this benchmark problem even in the presence of additional periodic and stochastic perturbation of unknown strength. Secondly, we illustrate our approach by its application to an analysis of the nozzle fault in a solid rocket motor (SRM). The internal ballistics of the SRM is modelled as a set of one-dimensional partial differential equations coupled to the dynamics of the propellant regression. In this example we are specifically focussed on the inference of discrete and continuous parameters of the nozzle blocking fault and on the possibility of an application of the DI algorithm to reducing the probability of "misses" of an on-board FD&P for SRM. In the next section re-contact problem caused by first stage/upper stage separation failure is discussed. The reaction forces imposed on the nozzle of the upper stage during the re-contact and their connection to the nozzle damage and to the thrust vector control (TVC) signal are obtained. It is shown that transient impact induced torquean be modelled as a response of an effective damped oscillator. A possible application of the DI algorithm to the inference of damage parameters and predicting fault dynamics ahead of time using the actuator signal is discussed. Finally, we formulate Bayesian inferential framework for development of the IHM system for in-flight structural health monitoring (SHM) of composite materials. We consider the signal generated by piezoelectric actuator mounted on composite structure generating elastic waves in it. The signal received by the sensor is than compared with the baseline signal. The possibility of damage inference is discussed in the context of development of the SHM.

Smelyanskiy, Vadim N.↗
DOE OSTI2024

Stochastic minibatch approach to the ptychographic iterative engine

The ptychographic iterative engine (PIE) is a widely used algorithm that enables phase retrieval at nanometer-scale resolution over a wide range of imaging experiment configurations. By analyzing diffraction intensities from multiple scanning locations where a probing wavefield interacts with a sample, the algorithm solves a difficult optimization problem with constraints derived from the experimental geometry as well as sample properties. The effectiveness at which this optimization problem is solved is highly dependent on the ordering in which we use the measured diffraction intensities in the algorithm, and random ordering is widely used due to the limited ability to escape from stagnation in poor-quality local solutions. In this study, we introduce an extension to the PIE algorithm that uses ideas popularized in recent machine learning training methods, in this case minibatch stochastic gradient descent. Our results demonstrate that these new techniques significantly improve the convergence properties of the PIE numerical optimization problem.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

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↗
NASA NTRSDate not supplied

Hardware-Efficient Quantum Optimization Layered Algorithms and Experiments

Quantum optimization algorithms, such as QAOA, that implement parametrized stochastic optimization solvers attempt to identify low-energy solutions of Ising systems by exploiting available quantum effects in noisy-intermediate scale machines. Engineering a well-performing parametrized quantum optimization circuit is indeed an exercise in balancing the trade-off between expressivity and implementation complexity. We show that, for MaxCut QAOA circuits defined on native hardware topology (Rigetti’s Aspen Quantum Processors), error-mitigation techniques recover simulated features of the noiseless theory. Moreover, we explore a design space for QAOA-like ansatze that perform well in theory as well as in hardware for fully-connected problems. We also discuss how efficient coherence and entanglement detection methods that could be coupled with quantum optimization experiments require only linear overhead in benchmarking time.

quantum computing↗