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,009 records · Page 56

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↗

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↗

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↗

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↗

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↗

Collaborative Research: Continuous Dynamic Grid Adaptation in a Global Atmospheric Model - Application and Refinement

This project had goals of advancing the performance capabilities of the numerical general circulation model EULAG and using it to produce a fully operational atmospheric global climate model (AGCM) that can employ either static or dynamic grid stretching for targeted phenomena. The resulting AGCM combined EULAG's advanced dynamics core with the "physics" of the NCAR Community Atmospheric Model (CAM). Effort discussed below shows how we improved model performance and tested both EULAG and the coupled CAM-EULAG in several ways to demonstrate the grid stretching and ability to simulate very well a wide range of scales, that is, multi-scale capability. We leveraged our effort through interaction with an international EULAG community that has collectively developed new features and applications of EULAG, which we exploited for our own work summarized here. Overall, the work contributed to over 40 peer-reviewed publications and over 70 conference/workshop/seminar presentations, many of them invited. 3a. EULAG Advances EULAG is a non-hydrostatic, parallel computational model for all-scale geophysical flows. EULAG's name derives from its two computational options: EULerian (flux form) or semi-LAGrangian (advective form). The model combines nonoscillatory forward-in-time (NFT) numerical algorithms with a robust elliptic Krylov solver. A signature feature of EULAG is that it is formulated in generalized time-dependent curvilinear coordinates. In particular, this enables grid adaptivity. In total, these features give EULAG novel advantages over many existing dynamical cores. For EULAG itself, numerical advances included refining boundary conditions and filters for optimizing model performance in polar regions. We also added flexibility to the model's underlying formulation, allowing it to work with the pseudo-compressible equation set of Durran in addition to EULAG's standard anelastic formulation. Work in collaboration with others also extended the demonstrated range of validity of soundproof models, showing that they are more broadly applicable than some had previously thought. Substantial testing of EULAG included application and extension of the Jablonowski-Williamson baroclinic wave test - an archetype of planetary weather - and further analysis of multi-scale interactions arising from collapse of temperature fronts in both the baroclinic wave test and simulations of the Held-Suarez idealized climate. These analyses revealed properties of atmospheric gravity waves not seen in previous work and further demonstrated the ability of EULAG to simulate realistic behavior over several orders of magnitude of length scales. Additional collaborative work enhanced capability for modeling atmospheric flows with adaptive moving meshes and demonstrated the ability of EULAG to move into petascale computing. 3b. CAM-EULAG Advances We have developed CAM-EULAG in collaboration with former project postdoc, now University of Cape Town Assistant Professor, Babatunde Abiodun. Initial study documented good model performance in aqua-planet simulations. In particular, we showed that the grid adaptivity (stretching) implemented in CAM-EULAG allows higher resolution in selected regions without causing anomalous behavior such as spurious wave reflection. We then used the stretched-grid version to analyze simulated extreme precipitation events in West Africa, comparing the precipitation and event environment with observed behavior. The model simulates fairly well the spatial scale and the interannual and intraseasonal variability of the extreme events, although its extreme precipitation intensity is weaker than observed. In addition, both observations and the simulations show possible forcing of extreme events by African easterly waves. 3c. Other Contributions Through our collaborations, we have made contributions to a wide range of outcomes. For research focused on terrestrial behavior, these have included (1) upwind schemes for gas dynamics, (2) a nonlinear perspective on the dynamics of the Madden-Julian Oscillation, (3) numerical realism of thermal convection, (4) extreme precipitation processes, (5) unstructured meshes, (6) porous-media analogies for simulating flow in urban environments, (7) Monge-Ampere enhancements of semi-Lagrangian methods and (8) further extensions of the generality of EULAG applications to geophysical problems. The generality of EULAG for multi-scale flow was also demonstrated through solar applications. Simulations of solar magnetohydrodynamics showed that EULAG produces the solar cycle fairly well. Although the model's solar cycle is significantly longer than observed, it shows remarkable agreement with observations in features of spatial evolution. These efforts in environments that are extreme from a geophysical perspective have helped to establish the robustness of EULAG as an all-scale code for geophysical applications.

54 ENVIRONMENTAL SCIENCES↗

Optimization of the artificial viscosity in Lagrangian staggered discretization codes. Modeling 1D stand-alone shock - case study

We have developed new measures of errors for numerical shock. The new approach is based on analysis of the structure function, and separation of the errors related to oscillations and shock width, which also include error in the position of the ”center” of the numerical shock. We have demonstrated that those measures correctly characterize the numerical solution. We introduced an objective function in, which both types of errors are weighted, and presented optimal values of the coefficients of the linear and quadratic viscosity for different weights and different Mach numbers.

97 MATHEMATICS AND COMPUTING↗

Ex situ metrology and data processing techniques developed at the ALS for optimization of beamline performance of bendable x-ray mirrors

We discuss experimental, analytical, and numerical methods recently developed at the Advanced Light Source (ALS) X?Ray Optics Laboratory (XROL) for calibration and precision shaping of bendable x-ray mirrors. The methods are based on ex situ measurements with the mirrors using surface slope profilers available at the ALS XROL. The first realization of methods and dedicated software has allowed the optimization of the beamline performance of bendable mirrors by adjustment of the mirror shape to minimize the root-mean-square variation of residual (after subtraction of the ideal desired shape) slope deviations from ideal (specified) surface figure. Here, we further develop the methods that in application to elliptically bent mirrors adapt as a figure of merit the minimum of the rms size of the focused beam. The efficacy of the developed methods is demonstrated with examples of optimal tuning of an elliptically bendable cylindrical mirror designed for the ALS beamline 10.3.2.

Yashchuk, VV↗

A subdivision-stabilized B-spline mixed material point method

Subjected to external loadings, polymeric materials, e.g., biological tissues, hydrogels, and elastomers, may undergo extreme, nearly incompressible, (self-)contact deformations. For numerical modeling employing mesh-based techniques such as the finite element method (FEM), these deformations pose significant challenges due to large distortions in the deformed geometry, accuracy issues stemming from volumetric locking effects, and increased computational cost from complex contact searches. As an alternative to mesh-based methods, the material point method (MPM), a continuum-based particle technique, is gaining attention for its ability to handle extreme distortions and capture no-slip contact without added cost. For nearly incompressible material behaviors, while mixed formulations can address locking effects by treating displacements and pressure as independent fields, they can suffer from numerical instabilities close to the incompressibility limit due to the violation of the inf-sup condition, leading to inaccurate nodal pressure solutions. Here we propose an efficient and stable mixed B-spline material point method with highest achievable regularity for quasi-compressible polymeric materials. Using the two-scale relation of B-splines, we introduce a subdivision-stabilization for the two-field mixed MPM and obtain numerically stable, oscillation-free nodal solutions with equal-order interpolations with optimal regularity. Building on the Eulerian-Lagrangian nature of MPM, a previously-converged solution framework is adopted to mitigate issues related to cell-crossing and numerical fracture artifact present in standard MPM. We assess the stability and accuracy of the developed mixed MPM at large deformations for soft materials through the benchmark Cook’s membrane problem. Additionally, we test the robustness of the proposed MPM by modeling several examples, including the compression and indentation of a circular block into a quasi-compressible substrate and the twisting deformation of a rectangular block. The findings demonstrate the MPM’s capabilities for modeling practical soft material applications.

36 MATERIALS SCIENCE↗

An optimization framework for workplace charging strategies

The workplace charging (WPC) has been recently recognized as the most important secondary charging point next to residential charging for plug-in electric vehicles (PEVs). The current WPC practice is spontaneous and grants every PEV a designated charger, which may not be practical or economic when there are a large number of PEVs present at workplace. This study is the first research undertaken that develops an optimization framework for WPC strategies to satisfy all charging demand while explicitly addressing different eligible levels of charging technology and employees’ demographic distributions. The optimization model is to minimize the lifetime cost of equipment, installations, and operations, and is formulated as an integer program. We demonstrate the applicability of the model using numerical examples based on national average data. The results indicate that the proposed optimization model can reduce the total cost of running a WPC system by up to 70% compared to the current practice. The WPC strategies are sensitive to the time windows and installation costs, and dominated by the PEV population size. The WPC has also been identified as an alternative sustainable transportation program to the public transit subsidy programs for both economic and environmental advantages.

Optimization↗

Auxiliary matrix formalism for interaction representation transformations, optimal control, and spin relaxation theories

Auxiliary matrix exponential method is used to derive simple and numerically efficient general expressions for the following, historically rather cumbersome, and hard to compute, theoretical methods: (1) average Hamiltonian theory following interaction representation transformations; (2) Bloch-Redfield-Wangsness theory of nuclear and electron relaxation; (3) gradient ascent pulse engineering version of quantum optimal control theory. In the context of spin dynamics, the auxiliary matrix exponential method is more efficient than methods based on matrix factorizations and also exhibits more favourable complexity scaling with the dimension of the Hamiltonian matrix.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exactness of OPF Relaxation on Three-phase Radial Networks with Delta Connections

Simulations have shown that while semi-definite relaxations of AC optimal power flow (AC-OPF) on three-phase radial networks with only wye connections tend to be exact, the presence of delta connections seem to render them inexact. This paper shows that such inexactness originates from the non-uniqueness of relaxation solutions and numerical errors amplified by the non-uniqueness. This finding motivates two algorithms to recover the exact solution of AC-OPF in unbalanced distribution networks featuring both wye and delta connections. In simulations using IEEE 13, 37 and 123-bus systems, the proposed algorithms provide exact optimal solutions up to numerical precision.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Averaging and Linear Programming in Some Singularly Perturbed Problems of Optimal Control

The paper aims at the development of an apparatus for analysis and construction of near optimal solutions of singularly perturbed (SP) optimal controls problems (that is, problems of optimal control of SP systems) considered on the infinite time horizon. We mostly focus on problems with time discounting criteria but a possibility of the extension of results to periodic optimization problems is discussed as well. Our consideration is based on earlier results on averaging of SP control systems and on linear programming formulations of optimal control problems. The idea that we exploit is to first asymptotically approximate a given problem of optimal control of the SP system by a certain averaged optimal control problem, then reformulate this averaged problem as an infinite-dimensional linear programming (LP) problem, and then approximate the latter by semi-infinite LP problems. We show that the optimal solution of these semi-infinite LP problems and their duals (that can be found with the help of a modification of an available LP software) allow one to construct near optimal controls of the SP system. We demonstrate the construction with two numerical examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Monte Carlo methods and their analysis for Coulomb collisions in multicomponent plasmas

Highlights: •A general approach to Monte Carlo methods for multicomponent plasmas is proposed. •We show numerical tests for the two-component (electrons and ions) case. •An optimal choice of parameters for speeding up the computations is discussed. •A rigorous estimate of the error of approximation is proved. -- Abstract: A general approach to Monte Carlo methods for Coulomb collisions is proposed. Its key idea is an approximation of Landau–Fokker–Planck equations by Boltzmann equations of quasi-Maxwellian kind. It means that the total collision frequency for the corresponding Boltzmann equation does not depend on the velocities. This allows to make the simulation process very simple since the collision pairs can be chosen arbitrarily, without restriction. It is shown that this approach includes the well-known methods of Takizuka and Abe (1977) [12] and Nanbu (1997) as particular cases, and generalizes the approach of Bobylev and Nanbu (2000). The numerical scheme of this paper is simpler than the schemes by Takizuka and Abe [12] and by Nanbu. We derive it for the general case of multicomponent plasmas and show some numerical tests for the two-component (electrons and ions) case. An optimal choice of parameters for speeding up the computations is also discussed. It is also proved that the order of approximation is not worse than O(√(ε)), where ε is a parameter of approximation being equivalent to the time step Δt in earlier methods. A similar estimate is obtained for the methods of Takizuka and Abe and Nanbu.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗