SEARCH · Search NASA

Results for “Stochastic numerical methods”

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.

SourceResearch connectionFrom yearThrough year

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

At least 217 records · Page 12

All sources NASA NTRS DOE OSTI

NASA NTRS1990

Random search optimization based on genetic algorithm and discriminant function

The general problem of optimization with arbitrary merit and constraint functions, which could be convex, concave, monotonic, or non-monotonic, is treated using stochastic methods. To improve the efficiency of the random search methods, a genetic algorithm for the search phase and a discriminant function for the constraint-control phase were utilized. The validity of the technique is demonstrated by comparing the results to published test problem results. Numerical experimentation indicated that for cases where a quick near optimum solution is desired, a general, user-friendly optimization code can be developed without serious penalties in both total computer time and accuracy.

Kiciman, M. O.↗

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 OSTI2026

Adaptive Sampling-Based Bi-Fidelity Stochastic Trust Region Method for Stochastic Derivative-Free Optimization

Bi-fidelity stochastic optimization has gained increasing attention as an efficient approach to reduce computational costs by leveraging a low-fidelity (LF) model to optimize an expensive high-fidelity (HF) objective. In this paper, we propose ASTRO-BFDF, an adaptive sampling trust-region method specifically designed for unconstrained bi-fidelity stochastic derivative-free optimization problems. In ASTRO-BFDF, the LF function serves two purposes: (i) to identify better iterates for the HF function when the optimization process indicates a high correlation between them and (ii) to reduce the variance of the HF function estimates using bi-fidelity Monte Carlo (BFMC). The algorithm dynamically determines sample sizes while adaptively choosing between crude Monte Carlo and BFMC to balance the trade-off between optimization and sampling errors. We prove that the iterates generated by ASTRO-BFDF converge to a first-order stationary point almost surely. Additionally, we demonstrate the effectiveness of the proposed algorithm through numerical experiments on synthetic benchmarks and simulation optimization problems involving discrete event systems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Data-Driven Simulation-Based Planning for Electric Airport Shuttle Systems: A Real-World Case Study

Many airports are adopting battery electric buses in their shuttle fleets due to concerns over air quality and regulations. This study proposes a simulation-based optimization modeling framework to help airport shuttle operators effectively deploy electric buses. We evaluated a planned airport electric shuttle system with an event-driven simulator. Empirical data collected from existing systems were used to drive the simulations. We then proposed a simulation-based optimization model to determine the battery capacity, charging power, and number of chargers so that predefined objective(s) (e.g., minimizing total capital cost, minimizing emissions) are optimized. Compared to existing studies, the primary contribution of the proposed method is that it can model the real-world stochastic nature of operations in an electric bus system with much higher fidelity. To demonstrate the proposed modeling framework, we study a real-world shuttle system at the Dallas-Fort Worth International Airport, and present extensive numerical studies. When considering partial fleet electrification, the model can provide a set of Pareto optimal solutions. When considering full fleet electrification, the optimal solution requires a 50-kWh battery capacity and four 210-kW chargers, resulting in a total capital cost of $26,744,000. The results demonstrate that the proposed modeling framework can effectively optimize the planning of electric airport shuttle systems with partial or full fleet electrification.

ADVANCED PROPULSION SYSTEMS,ENERGY PLANNING, POLIC↗

DOE OSTI2024

Random coordinate descent: A simple alternative for optimizing parameterized quantum circuits

Variational quantum algorithms rely on the optimization of parameterized quantum circuits in noisy settings. The commonly used back-propagation procedure in classical machine learning is not directly applicable in this setting due to the collapse of quantum states after measurements. Thus, gradient estimations constitute a significant overhead in a gradient-based optimization of such quantum circuits. This paper introduces a random coordinate descent algorithm as a practical and easy-to-implement alternative to the full gradient descent algorithm. This algorithm only requires one partial derivative at each iteration. Motivated by the behavior of measurement noise in the practical optimization of parameterized quantum circuits, this paper presents an optimization problem setting that is amenable to analysis. Under this setting, the random coordinate descent algorithm exhibits the same level of stochastic stability as the full gradient approach, making it as resilient to noise. The complexity of the random coordinate descent method is generally no worse than that of the gradient descent and can be much better for various quantum optimization problems with anisotropic Lipschitz constants. Theoretical analysis and extensive numerical experiments validate our findings. Published by the American Physical Society 2024

Ding, Zhiyan (ORCID:000000018863403X)↗

DOE OSTI2022

Stochastic Modeling in a Multimaterial Continuum Mixture Shock Physics Code

Stochastic modelling approaches are presented to capture random effects at multiple time and length scales. Random processes that occur at the microscale produce nondeterministic effects at the macroscale. Here we present three stochastic modeling approaches that describe random processes at microscopic length scales and map these processes to the macroscopic length scale. The first stochastic modeling approach is based upon a particle based numerical technique to solve a Stochastic Differential Equation (SDE) using an arbitrary diffusion process to capture random processes at the microstructural level. The second approach prescribes a Probability Density Function (PDF) for the drift and diffusion of the random variable derived using the forward and backward Kolmogorov equations. This method requires mean and drift evolution PDF transport equations. The third approach is the coupling of multiple random variables which are dependent on each other. The relationship of the PDFs and a coupling function, known as a copula, produces a Joint Probability Density Function (JPDF). These stochastic modeling approaches are implemented into a Multiple Component (MC) shock physics computational code and used to model statistical fracture and reactive flow applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS2007

Scope of Gradient and Genetic Algorithms in Multivariable Function Optimization

Global optimization of a multivariable function - constrained by bounds specified on each variable and also unconstrained - is an important problem with several real world applications. Deterministic methods such as the gradient algorithms as well as the randomized methods such as the genetic algorithms may be employed to solve these problems. In fact, there are optimization problems where a genetic algorithm/an evolutionary approach is preferable at least from the quality (accuracy) of the results point of view. From cost (complexity) point of view, both gradient and genetic approaches are usually polynomial-time; there are no serious differences in this regard, i.e., the computational complexity point of view. However, for certain types of problems, such as those with unacceptably erroneous numerical partial derivatives and those with physically amplified analytical partial derivatives whose numerical evaluation involves undesirable errors and/or is messy, a genetic (stochastic) approach should be a better choice. We have presented here the pros and cons of both the approaches so that the concerned reader/user can decide which approach is most suited for the problem at hand. Also for the function which is known in a tabular form, instead of an analytical form, as is often the case in an experimental environment, we attempt to provide an insight into the approaches focusing our attention toward accuracy. Such an insight will help one to decide which method, out of several available methods, should be employed to obtain the best (least error) output. *

Shaykhian, Gholam Ali↗

NASA NTRS1986

Probabilistic structural analysis methods for critical SSME propulsion components

The development of a three-dimensional inelastic analysis methodology for the Space Shuttle main engine (SSME) structural components is described. The methodology is composed of: (1) composite load spectra, (2) probabilistic structural analysis methods, (3) the probabilistic finite element theory, and (4) probabilistic structural analysis. The progress in the development of generic probabilistic models for various individual loads which consist of a steady state load, a periodic load, a random load, and a spike, is discussed. The capabilities of the Numerical Evaluation of Stochastic Structures Under Stress finite element code designed for probabilistic structural analysis of the SSME are examined. Variation principles for formulation probabilistic finite elements and a structural analysis for evaluating the geometric and material properties tolerances on the structural response of turbopump blades are being designed.

Chamis, C. C.↗

NASA NTRS2015

The Effect of Stochastically Varying Creep Parameters on Residual Stresses in Ceramic Matrix Composites

Constituent properties, along with volume fraction, have a first order effect on the microscale fields within a composite material and influence the macroscopic response. Therefore, there is a need to assess the significance of stochastic variation in the constituent properties of composites at the higher scales. The effect of variability in the parameters controlling the time-dependent behavior, in a unidirectional SCS-6 SiC fiber-reinforced RBSN matrix composite lamina, on the residual stresses induced during processing is investigated numerically. The generalized method of cells micromechanics theory is utilized to model the ceramic matrix composite lamina using a repeating unit cell. The primary creep phases of the constituents are approximated using a Norton-Bailey, steady state, power law creep model. The effect of residual stresses on the proportional limit stress and strain to failure of the composite is demonstrated. Monte Carlo simulations were conducted using a normal distribution for the power law parameters and the resulting residual stress distributions were predicted.

residual stress↗

NASA NTRS2015

The Effect of Stochastically Varying Creep Parameters on Residual Stresses in Ceramic Matrix Composites

processing↗

NASA NTRS1981

Closed form evaluation of symmetric two-sided complex integrals

Evaluation of two-sided complex integrals is often required when analyzing linear systems to determine signal variances resulting from stochastic inputs and system noise bandwidths. Algebraic solutions of integrals in a closed matrix equation form, using coefficients of the numerator and denominator polynomials, are presented. The closed forms provide the possibility of obtaining some insight into parameter sensitivity in addition to greatly reducing the computational complexity required by the normal method of evaluation by residues.

Winkelstein, R.↗

DOE OSTI2021

A Hybrid Energy System Workflow for Energy Portfolio Optimization

This manuscript develops a workflow, driven by data analytics algorithms, to support the optimization of the economic performance of an Integrated Energy System. The goal is to determine the optimum mix of capacities from a set of different energy producers (e.g., nuclear, gas, wind and solar). A stochastic-based optimizer is employed, based on Gaussian Process Modeling, which requires numerous samples for its training. Each sample represents a time series describing the demand, load, or other operational and economic profiles for various types of energy producers. These samples are synthetically generated using a reduced order modeling algorithm that reads a limited set of historical data, such as demand and load data from past years. Numerous data analysis methods are employed to construct the reduced order models, including, for example, the Auto Regressive Moving Average, Fourier series decomposition, and the peak detection algorithm. All these algorithms are designed to detrend the data and extract features that can be employed to generate synthetic time histories that preserve the statistical properties of the original limited historical data. The optimization cost function is based on an economic model that assesses the effective cost of energy based on two figures of merit: the specific cash flow stream for each energy producer and the total Net Present Value. An initial guess for the optimal capacities is obtained using the screening curve method. The results of the Gaussian Process model-based optimization are assessed using an exhaustive Monte Carlo search, with the results indicating reasonable optimization results. The workflow has been implemented inside the Idaho National Laboratory’s Risk Analysis and Virtual Environment (RAVEN) framework. The main contribution of this study addresses several challenges in the current optimization methods of the energy portfolios in IES: First, the feasibility of generating the synthetic time series of the periodic peak data; Second, the computational burden of the conventional stochastic optimization of the energy portfolio, associated with the need for repeated executions of system models; Third, the inadequacies of previous studies in terms of the comparisons of the impact of the economic parameters. The proposed workflow can provide a scientifically defendable strategy to support decision-making in the electricity market and to help energy distributors develop a better understanding of the performance of integrated energy systems.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2022

Mitigating the Impacts of Uncertain Geomagnetic Disturbances on Electric Grids: A Distributionally Robust Optimization Approach

Severe geomagnetic disturbances (GMDs) increase the magnitude of the electric field on the Earth’s surface (E-field) and drive geomagnetically-induced currents (GICs) along the transmission lines in electric grids. These additional currents can pose severe risks, such as current distortions, transformer saturation and increased reactive power losses, each of which can lead to system unreliability. Today several mitigation actions (e.g., changing grid topology) exist that can reduce the harmful GIC effects on the grids. Making such decisions can be challenging, however, because the magnitude and direction of the E-field are uncertain and non-stationary. In this paper, we model uncertain E-fields using the distributionally robust optimization (DRO) approach that determines optimal transmission grid operations such that the worst-case expectation of the system cost is minimized. We also capture the effect of GICs on the nonlinear AC power flow equations. For solution approaches, we develop an accelerated column-and-constraint generation (CCG) algorithm by exploiting a special structure of the support set of uncertain parameters representing the E-field. Extensive numerical experiments based on “epri-21” and “uiuc-150” systems, designed for GMD studies, demonstrate (i) the computational performance of the accelerated CCG algorithm, (ii) the superior performance of distributionally robust grid operations that satisfy nonlinear, nonconvex AC power flow equations and GIC constraints, in comparison with standard stochastic programming-based methods during the out-of-sample testing.

42 ENGINEERING↗

DOE OSTI2024

An improved stochastic weighted particle method for boundary driven flows

Here, the stochastic weighted particle method (SWPM) is a generalization of the Direct Simulation Monte Carlo (DSMC) method where particle weights are variable and dynamic. SWPM is backed by a strong theoretical foundation but has not been critically evaluated for problems of practical interest. A thorough assessment of SWPM for boundary-driven flows reveals significant numerical artifacts near the boundary, notably a diverging heat flux. To correct the boundary heat flux, two modifications to SWPM are proposed: separated grouping and a spatially-dependent weight transfer function. To gauge the relative efficiency of SWPM in comparison to DSMC, a high-Mach-number wheel flow which forms a strong density gradient is also simulated.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Adaptive experimental design for multi-fidelity surrogate modeling of multi-disciplinary systems

We present an adaptive algorithm for constructing surrogate models of multi-disciplinary systems composed of a set of coupled components. With this goal we introduce “coupling” variables with a priori unknown distributions that allow surrogates of each component to be built independently. Once built, the surrogates of the components are combined to form an integrated-surrogate that can be used to predict system-level quantities of interest at a fraction of the cost of the original model. The error in the integrated-surrogate is greedily minimized using an experimental design procedure that allocates the amount of training data, used to construct each component-surrogate, based on the contribution of those surrogates to the error of the integrated-surrogate. Here, the multi-fidelity procedure presented is a generalization of multi-index stochastic collocation that can leverage ensembles of models of varying cost and accuracy, for one or more components, to reduce the computational cost of constructing the integrated-surrogate. Extensive numerical results demonstrate that, for a fixed computational budget, our algorithm is able to produce surrogates that are orders of magnitude more accurate than methods that treat the integrated system as a black-box.

42 ENGINEERING↗

NASA NTRS1982

Methods of sequential estimation for determining initial data in numerical weather prediction

Numerical weather prediction (NWP) is an initial-value problem for a system of nonlinear differential equations, in which initial values are known incompletely and inaccurately. Observational data available at the initial time must therefore be supplemented by data available prior to the initial time, a problem known as meteorological data assimilation. A further complication in NWP is that solutions of the governing equations evolve on two different time scales, a fast one and a slow one, whereas fast scale motions in the atmosphere are not reliably observed. This leads to the so called initialization problem: initial values must be constrained to result in a slowly evolving forecast. The theory of estimation of stochastic dynamic systems provides a natural approach to such problems. For linear stochastic dynamic models, the Kalman-Bucy (KB) sequential filter is the optimal data assimilation method, for linear models, the optimal combined data assimilation-initialization method is a modified version of the KB filter.

Cohn, S. E.↗

DOE OSTI2020

Optimal control of coupled quantum systems based on the first-order Magnus expansion: Application to multiple dipole-dipole-coupled molecular rotors

This paper presents a method for performing approximate optimal control simulations for quantum systems with multiple coupled degrees of freedom. In this work, the time evolution is simulated using the first-order Magnus expansion in the interaction picture, where the couplings between different degrees of freedom are treated as the perturbation. A numerical implementation procedure is presented that leverages upon pairwise couplings and the separability of the zeroth-order time evolution operator to achieve a reduced computational cost, which is analyzed with respect to the number of degrees of freedom. The formulation is compatible with gradient-free methods to optimize the control field, and a stochastic hill climbing algorithm is adopted for this purpose. As illustrations, optimal control simulations are performed for systems of two and three dipole-dipole-coupled molecular rotors under the influence of a control field. For the two-rotor system, the field is optimized to achieve either orientation or entanglement objectives. For the three-rotor system, the field is optimized either to orient all three rotors in the same direction or to orient one rotor in a particular direction while the other two rotors point in the opposite direction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Competition between roughness and strength for scale-dependent surfaces

Rocks famously have scale-dependent strength, yet the actual dependence is notoriously hard to measure or incorporate into any theoretical framework. Natural rough surfaces present an opportunity to solve the problem. Surfaces sliding in shear evolve as protrusions collide. These asperities can deform or break, thus creating a new surface shape. In particular, natural surfaces have roughness at all scales as well as scale-dependent strength. Based on a scaling analysis, we have previously suggested that the scale-dependent aspect ratio of steady-state surfaces should be proportional to the scale-dependent shear strain at yield. If true, scale-dependent strength could easily be inferred from natural surfaces. Thus, moving beyond the scaling argument to a rigorous treatment of scale-dependent strength for multiscale rough surfaces in shear is important. However, analytic frameworks for analyzing multiscale problems are challenging, as conventional continuum mechanics typically involves a single value for a material property across scales. Here, in this work, we build on the formalism of Persson (2001) that presents a method to compute contact area for rough surfaces with a prescribed topographic spectrum using a stochastic differential equation. The Persson formalism allows for plastic yield under normal loading of otherwise elastic materials and leaves open the possibility of scale-dependent yield stress. In this study, we pursue this route to develop a theory and numerical results for the yielding of a rough, elastoplastic surface with scale-dependent yield stress. Here, we examine surfaces for which the power spectrum of the topography 𝐶 and yield stress 𝑌 follow power laws as a function of scale 𝜆, such that 𝐶∼𝜆 −𝑚 and 𝑌∼𝜆 −𝑛 , respectively. In this formal treatment of the problem, we focus on surfaces in contact and the resulting yield and do not impose shear. Numerical solutions show that the deviation from the elastic scaling solution is bounded as expected by the prior 1D heuristic scaling argument that anticipates the Hurst exponent as 1−𝑛. We also show that the plasticity is expected to erode the contacts if 𝑚 is lower than 𝑛−3, which corresponds to a Hurst exponent lower than 1−𝑛/2. This result is rigorously sound for 2D, i.e., realistic surfaces, and quantitatively different than the prior scaling argument. The theory now permits a correspondingly quantitative approach to interpreting natural surfaces.

elasticity↗