Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical 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,765 records · Page 98

Implementation of longitudinal dynamics with barrier RF in BETACOOL and comparison to ESME

The barrier bucket RF system is successfully used on Recycler storage ring at Fermilab. The special program code ESME was used for numerical simulation of longitudinal phase space manipulations. This program helps optimizing the various regimes of operation in the Recycler and increasing the luminosity in the colliding experiments. Electron and stochastic cooling increases the phase space density in all degrees of freedom. In the case of a small phase space volume the intrabeam scattering introduces coupling between the transverse and longitudinal temperatures of the antiproton beam. For numerical simulations of the cooling processes at the Recycler, a new model of the barrier buckets was implemented in the BETACOOL code. The comparison between ESME and BETACOOL codes for a stationary and moving barrier buckets is presented. This article also includes an application of the barrier bucket numerical model for simulation of the luminosity distribution for RHIC colliding experiments. These simulations take into account the specific longitudinal distribution of the bunch and the vertex size of the detector.

43 PARTICLE ACCELERATORS↗

Tuning successive linear programming to solve AC optimal power flow problem for large networks

Successive linear programming (SLP) is a practical approach for solving large-scale nonlinear optimization problems. Alternating current optimal power flow (ACOPF) is no exception, particularly the large size of real-world networks. However, in order to achieve tractability, it is essential to tune the SLP algorithm presented in the literature. This paper presents a modified SLP algorithm to solve the ACOPF problem, specified by the U.S. Department of Energy’s (DOE) Grid Optimization (GO) Competition Challenge 1, within strict time limits. The algorithm first finds a near-optimal solution for the relaxed problem (i.e., Stage 1). Then, it finds a feasible solution in the proximity of the near-optimal solution (i.e., Stage 2 and Stage 3). The numerical experiments on test cases ranging from 500-bus to 30,000-bus systems show that the algorithm is tractable. Here the results show that our proposed algorithm is tractable and can solve more than 80% of test cases faster than the well-known Interior Point Method while significantly reduce the number of iterations required to solve ACOPF. The number of iterations is considered an important factor in the examination of tractability which can drastically reduce the computational time required within each iteration.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Development of novel dynamic machine learning-based optimization of a coal-fired power plant

The increasing fraction of intermittent renewable energy in the electrical grid is resulting in coal-fired boilers now routinely ramp up and down. The current state-of-the-art operation for such boilers is to apply steady-state, neural network-based optimization to make control decisions in real-time, and this report demonstrates the feasibility of extending this to dynamic, neural network-based optimization using a long short-term memory neural network. A simplified numerical simulation of a t-fired coal boiler and supporting equipment is used to represent a real plant subjected to both steady-state, neural network-based optimization and dynamic, neural network-based optimization. Using the same intervals and a particle swarm optimization algorithm, the dynamic optimization outperforms the steady-state optimization and realizes up to 4.58% improvement in thermal efficiency. Dynamic optimization with a long short-term memory neural network is shown to both be feasible and beneficial for operation of a coal-fired boiler under changing load.

42 ENGINEERING↗

Maximum power point tracking for a multi-layered piezoelectric heel charger with a levered mechanism toward impact-based energy harvesting

The piezoelectric footstep energy harvester does not always work at its maximum power point when the external load is fixed, as the optimal load changes when the walking excitation alters. Thus, the harvesting efficiency is downgraded largely in real-life scenarios compared to in-lab experiments and theoretical or numerical predictions due to the mismatch between the actual load and the optimal load. To address this issue, the concept of Maximum Power Point Tracking (MPPT) is investigated in this paper and the circuit design is implemented for a multi-layered levered piezoelectric footstep energy harvester (heel charger). The proposed event-driven MPPT circuit interface with a customized buck converter aims to maximize the power gained from daily walking using the heel charger to power a fixed load, such as smart insole or shoes. The MPPT circuit design is conceptually simulated and then tested with the heel charger to further validate if it works at its maximum power point when the frequency of the input excitation alters. Results show that the extracted power from the heel charger connected to a fixed resistance load with MPPT implementation is improved up to 300% compared to the one without MPPT implementation in simulation and up to 180% in the experiment when connected to a fixed load. The difference between simulation and experimental results is due to the optimization of using voltage sources as the heel charger and the control signals (pulse width modulation) from the microcontroller in the simulation.

47 OTHER INSTRUMENTATION↗

Operator Relaxation and the Optimal Depth of Classical Shadows

Classical shadows are a powerful method for learning many properties of quantum states in a sample-efficient manner, by making use of randomized measurements. Here we study the sample complexity of learning the expectation value of Pauli operators via “shallow shadows,” a recently proposed version of classical shadows in which the randomization step is effected by a local unitary circuit of variable depth t. Here we show that the shadow norm (the quantity controlling the sample complexity) is expressed in terms of properties of the Heisenberg time evolution of operators under the randomizing (“twirling”) circuit—namely the evolution of the weight distribution characterizing the number of sites on which an operator acts nontrivially. For spatially contiguous Pauli operators of weight k, this entails a competition between two processes: operator spreading (whereby the support of an operator grows over time, increasing its weight) and operator relaxation (whereby the bulk of the operator develops an equilibrium density of identity operators, decreasing its weight). From this simple picture we derive (i) an upper bound on the shadow norm which, for depth t~log⁡(k), guarantees an exponential gain in sample complexity over the t=0 protocol in any spatial dimension, and (ii) quantitative results in one dimension within a mean-field approximation, including a universal subleading correction to the optimal depth, found to be in excellent agreement with infinite matrix product state numerical simulations. Our Letter connects fundamental ideas in quantum many-body dynamics to applications in quantum information science, and paves the way to highly optimized protocols for learning different properties of quantum states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Program to Optimize Simulated Trajectories (POST). Volume 1: Formulation manual

A general purpose FORTRAN program for simulating and optimizing point mass trajectories (POST) of aerospace vehicles is described. The equations and the numerical techniques used in the program are documented. Topics discussed include: coordinate systems, planet model, trajectory simulation, auxiliary calculations, and targeting and optimization.

Brauer, G. L.↗

Results of an integrated structure-control law design sensitivity analysis

Next generation air and space vehicle designs are driven by increased performance requirements, demanding a high level of design integration between traditionally separate design disciplines. Interdisciplinary analysis capabilities have been developed, for aeroservoelastic aircraft and large flexible spacecraft control for instance, but the requisite integrated design methods are only beginning to be developed. One integrated design method which has received attention is based on hierarchal problem decompositions, optimization, and design sensitivity analyses. This paper highlights a design sensitivity analysis method for Linear Quadratic Cost, Gaussian (LQG) optimal control laws, which predicts change in the optimal control law due to changes in fixed problem parameters using analytical sensitivity equations. Numerical results of a design sensitivity analysis for a realistic aeroservoelastic aircraft example are presented. In this example, the sensitivity of the optimally controlled aircraft's response to various problem formulation and physical aircraft parameters is determined. These results are used to predict the aircraft's new optimally controlled response if the parameter was to have some other nominal value during the control law design process. The sensitivity results are validated by recomputing the optimal control law for discrete variations in parameters, computing the new actual aircraft response, and comparing with the predicted response. These results show an improvement in sensitivity accuracy for integrated design purposes over methods which do not include changess in the optimal control law. Use of the analytical LQG sensitivity expressions is also shown to be more efficient that finite difference methods for the computation of the equivalent sensitivity information.

Gilbert, Michael G.↗

Stellarator optimization with constraints

In this work we consider the problem of optimizing a stellarator subject to hard constraints on the design variables and physics properties of the equilibrium. We survey current numerical methods for handling these constraints, and summarize a number of methods from the wider optimization community that have not been used extensively for stellarator optimization thus far. We demonstrate the utility of new methods of constrained optimization by optimizing a quasi-axisymmetric stellarator for favourable physics properties while preventing strong shaping of the plasma boundary, which can be difficult to create with external current sources.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Particle Swarm Optimization

The purpose of this paper is to show how the search algorithm known as particle swarm optimization performs. Here, particle swarm optimization is applied to structural design problems, but the method has a much wider range of possible applications. The paper's new contributions are improvements to the particle swarm optimization algorithm and conclusions and recommendations as to the utility of the algorithm, Results of numerical experiments for both continuous and discrete applications are presented in the paper. The results indicate that the particle swarm optimization algorithm does locate the constrained minimum design in continuous applications with very good precision, albeit at a much higher computational cost than that of a typical gradient based optimizer. However, the true potential of particle swarm optimization is primarily in applications with discrete and/or discontinuous functions and variables. Additionally, particle swarm optimization has the potential of efficient computation with very large numbers of concurrently operating processors.

Venter, Gerhard↗

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↗

Hybrid optimization of truss structures with strength and buckling constraints

An efficient scheme utilizing standard nonlinear programming methodology is presented for the optimal design of elastic, redundant structures with strength and buckling constraints. Numerical examples are given which demonstrate how this method, involving a constraint redefinition, can successfully overcome certain problems typical to such structures. The scheme is applied to the design of a cantilever truss with strength and buckling constraints, in which optimal nonuniform cross section columns are used for all elements critical in buckling. It is found that permitting node movement and adding redundancies can lower the weight of the structure for the prescribed design constraints. In addition, the node excursions in this configuration are shown to be relatively small.

Hajela, P.↗

Demand Response Under Stochastic, Price-Dependent User Behavior

This letter focuses on price-based demand response (DR) implemented through dynamic adjustments of electricity prices. It extends existing DR models to a stochastic framework in which customer response is represented by price-dependent random variables, leveraging models and tools from the theory of stochastic optimization with decision-dependent distributions. The inherent epistemic uncertainty in the customers' responses renders open-loop, model-based DR strategies impractical. We propose a stochastic, feedback-based pricing strategy to compensate for estimation errors and uncertainty in customer response, establish theoretical results demonstrating the stability and near-optimality of the proposed approach, and validate its effectiveness through numerical simulations.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Acoustic analysis using numerical solutions of the Navier-Stokes equations

Numerical solutions of the time-dependent compressible Navier-Stokes equations are employed to analyze the unsteady features of jet flows which contribute to jet noise. The turbulent-mass flux spectra are examined in detail in the numerical analysis, and MacCormack's explicit finite difference algorithm is used to solve the governing equations. The computational grid is based on an axisymmetric jet with simple exponential stretching used to optimize the resolution of critical unsteady flow features. The time-varying numerical data are analyzed, and the time averages of the velocity and turbulence-intensity profiles are shown to agree with experimental data. Grid refinement and longer run times improved the prediction of the experimental mass-flux spectra. The numerical procedure can be extended to 3D jet-flow configurations to study the related 3D unsteady flow features.

Scott, James N.↗

Nearly-grazing optimal trajectories for aeroassisted orbital transfer

In the present treatment of optimal control problems arising in the study of coplanar aeroassisted orbital transfer, the hybrid combination of propulsive parameters in space and aerodynamic maneuvers employing lift modulation in the sensible atmosphere indicates that the optimal energy-viewpoint solution is the grazing trajectory; this trajectory is characterized by favorable values of the peak heating rate and the peak dynamic pressure. Numerical solutions are obtained by means of the sequential gradient restoration algorithm for optimal control problems. It is found that nearly-grazing trajectories yielding the least-square value of the path inclination have desirable characteristics from the standpoints of energy, heating rate, and dynamic pressure.

Miele, A.↗

Wing shape optimization for maximum cross-country speed, with mathematical programming

A computer program was developed to calculate numerically the speed and circling polars of an aircraft when the lift and drag characteristics of the wing airfoils are known. The planform of the wing is described by variables which are optimized so that the cross-country speed of the glider is maximum for the particular type of thermal model. Two thermal models are compared and shown that with a greater wing area than now normally used the performance can be increased.

Helwig, G.↗

Characterization of a Method for Inverse Heat Conduction Using Real and Simulated Thermocouple Data

It is often impractical to instrument the external surface of high-speed vehicles due to the aerothermodynamic heating. Temperatures can instead be measured internal to the structure using embedded thermocouples, and direct and inverse methods can then be used to estimate temperature and heat flux on the external surface. Two thermocouples embedded at different depths are required to solve direct and inverse problems, and filtering schemes are used to reduce noise in the measured data. Accuracy in the estimated surface temperature and heat flux is dependent on several factors. Factors include the thermocouple location through the thickness of a material, the sensitivity of the surface solution to the error in the specified location of the embedded thermocouples, and the sensitivity to the error in thermocouple data. The effect of these factors on solution accuracy is studied using the methodology discussed in the work of Pizzo, et. al.1 A numerical study is performed to determine if there is an optimal depth at which to embed one thermocouple through the thickness of a material assuming that a second thermocouple is installed on the back face. Solution accuracy will be discussed for a range of embedded thermocouple depths. Moreover, the sensitivity of the surface solution to (a) the error in the specified location of the embedded thermocouple and to (b) the error in the thermocouple data are quantified using numerical simulation, and the results are discussed.

Pizzo, Michelle E.↗

fPINNs: Fractional Physics-Informed Neural Networks

Physics-informed neural networks (PINNs), introduced, are effective in solving integer-order partial differential equations (PDEs) based on scattered and noisy data. PINNs employ standard feedforward neural networks (NNs) with the PDEs explicitly encoded into the NN using automatic differentiation, while the sum of the mean-squared PDE residuals and the mean-squared error in initial-boundary conditions is minimized with respect to the NN parameters. Here we extend PINNs to fractional PINNs (fPINNs) to solve space-time fractional advection-diffusion equations (fractional ADEs), and we study systematically their convergence, hence explaining both fPINNs and PINNs for the first time. Specifically, we demonstrate their accuracy and effectiveness in solving multidimensional forward and inverse problems with forcing terms whose values are only known at randomly scattered spatio-temporal coordinates (black-box (BB) forcing terms). A novel element of the fPINNs is the hybrid approach that we introduce for constructing the residual in the loss function using both automatic differentiation for the integer-order operators and numerical discretization for the fractional operators. This approach bypasses the difficulties stemming from the fact that automatic differentiation is not applicable to fractional operators because the standard chain rule in integer calculus is not valid in fractional calculus. To discretize the fractional operators, we employ the Grünwald--Letnikov (GL) formula in one-dimensional fractional ADEs and the vector GL formula in conjunction with the directional fractional Laplacian in two- and three-dimensional fractional ADEs. We first consider the one-dimensional fractional Poisson equation and compare the convergence of the fPINNs against the finite difference method (FDM). We present the solution convergence using both the mean L 2 error as well as the standard deviation due to sensitivity to NN parameter initializations. Using different GL formulas we observe first-, second-, and third-order convergence rates for small size training sets but the error saturates for larger training sets. We explain these results by analyzing the four sources of numerical errors due to discretization, sampling, NN approximation, and optimization. The total error decays monotonically (below 10 –5 for a third-order GL formula) but it saturates beyond that point due to the optimization error. We also analyze the relative balance between discretization and sampling errors and observe that the sampling size and the number of discretization points (auxiliary points) should be comparable to achieve the highest accuracy. As we increase the depth of the NN up to certain value, the mean error decreases and the standard deviation increases, whereas the width has essentially no effect unless its value is either too small or too large. We next consider time-dependent fractional ADEs and compare white-box (WB) and BB forcing. We observe that for the WB forcing, our results are similar to the aforementioned cases; however, for the BB forcing fPINNs outperform FDM. Subsequently, we consider multidimensional time-, space-, and space-time-fractional ADEs using the directional fractional Laplacian and we observe relative errors of 10 –3 ~ 10 –4 . Lastly, we solve several inverse problems in one, two, and three dimensions to identify the fractional orders, diffusion coefficients, and transport velocities and obtain accurate results given proper initializations even in the presence of significant noise.

97 MATHEMATICS AND COMPUTING↗

A global stochastic programming approach for the optimal placement of gas detectors with nonuniform unavailabilities

Optimal design of a gas detection systems is challenging because of the numerous sources of uncertainty, including weather and environmental conditions, leak location and characteristics, and process conditions. Rigorous CFD simulations of dispersion scenarios combined with stochastic programming techniques have been successfully applied to the problem of optimal gas detector placement; however, rigorous treatment of sensor failure and nonuniform unavailability has received less attention. To improve reliability of the design, this paper proposes a problem formulation that explicitly considers nonuniform unavailabilities and all backup detection levels. The resulting sensor placement problem is a large-scale mixed-integer nonlinear programming (MINLP) problem that requires a tailored solution approach for efficient solution. We have developed a multitree method which depends on iteratively solving a sequence of upper-bounding master problems and lower-bounding subproblems. The tailored global solution strategy is tested on a real data problem and the encouraging numerical results indicate that our solution framework is promising in solving sensor placement problems. This study was selected for the special issue in JLPPI from the 2016 International Symposium of the MKO Process Safety Center.

47 OTHER INSTRUMENTATION↗