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,585 records · Page 88

Self-consistent implementation of meta-GGA functionals for the ONETEP linear-scaling electronic structure package

Accurate and computationally efficient exchange-correlation functionals are critical to the successful application of linear-scaling density functional theory (DFT). Local and semi-local functionals of the density are naturally compatible with linear-scaling approaches, having a general form which assumes the locality of electronic interactions and which can be efficiently evaluated by numerical quadrature. Presently, the most sophisticated and flexible semi-local functionals are members of the meta-generalized-gradient approximation (meta-GGA) family, and depend upon the kinetic energy density, τ, in addition to the charge density and its gradient. In order to extend the theoretical and computational advantages of τ-dependent meta-GGA functionals to large-scale DFT calculations on thousands of atoms, we have implemented support for τ-dependent meta-GGA functionals in the ONETEP program. In this paper we lay out the theoretical innovations necessary to implement τ-dependent meta-GGA functionals within ONETEP's linear-scaling formalism. We present expressions for the gradient of the τ-dependent exchange-correlation energy, necessary for direct energy minimization. We also derive the forms of the τ-dependent exchange-correlation potential and kinetic energy density in terms of the strictly localized, self-consistently optimized orbitals used by ONETEP. To validate the numerical accuracy of our self-consistent meta-GGA implementation, we performed calculations using the B97M-V and PKZB meta-GGAs on a variety of small molecules. Using only a minimal basis set of self-consistently optimized local orbitals, we obtain energies in excellent agreement with large basis set calculations performed using other codes. Lastly, to establish the linear-scaling computational cost and applicability of our approach to large-scale calculations, we present the outcome of self-consistent meta-GGA calculations on amyloid fibrils of increasing size, up to tens of thousands of atoms.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Convergence of infinite dimensional sampled LQR problems - Theory and numerical results

A theory is developed for the convergence of the closed-loop solution to infinite-dimensional discrete-time linear-quadratic regulator (LQR) problems on the infinite time interval to the solution of a corresponding continuous-time LQR problem as the length of the sampling interval tends toward zero. Convergence of solutions to the operator algebraic Riccati equation and corresponding optimal feedback control gains is guaranteed under appropriate uniform stabilizability and detectability conditions and consistent sampling. Also presented are numerical results involving the optimal LQ control of a heat or diffusion equation, a hereditary or delay differential equation, and a hybrid system of ordinary and partial differential equations describing the transverse vibration of a cantilevered Voigt-Kelvin viscoelastic beam with tip mass.

Rosen, I. G.↗

Distributed Automatic Load-Frequency Control with Optimality in Power Systems

With the increasing penetration of renewable energy resources, power systems face new challenges in balancing power supply and demand and maintaining the nominal frequency. This paper studies load control to handle these challenges. In particular, a fully distributed automatic load control algorithm, which only needs local measurement and local communication, is proposed. We prove that the control algorithm globally converges to an optimal operating point which minimizes the total disutility of users, restores the nominal frequency and the scheduled tie-line power flows, and respects the thermal constraints of transmission lines. It is also shown that the convergence still holds even when inaccurate system parameters are used in the control algorithm. Lastly, the effectiveness, optimality, and robustness of the proposed algorithm are demonstrated via numerical simulations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Distributed Automatic Load-Frequency Control with Optimality in Power Systems: Preprint

With increasing penetrations of renewable energy resources, power systems face new challenges in balancing supply and demand and maintaining nominal frequency. This paper studies load control to handle these challenges. In particular, a fully distributed automatic load control algorithm, which needs only local measurement and local communications, is proposed. We prove that the control algorithm globally converges to an optimal operating point that minimizes the total disutility of users, restores the nominal frequency and the scheduled tie-line power flows, and respects the thermal constraints of transmission lines. We also show that the convergence holds even when inaccurate system parameters are used in the control algorithm. Last, the effectiveness, optimality, and robustness of the proposed algorithm are demonstrated via numerical simulations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

30-kW Maintenance-Free Stirling Engine for High-Performance Dish Concentrating Solar

This final report summarizes the final results of the 30-kW Maintenance-Free Stirling Engine for High-Performance Dish Concentrating Solar project performed by Infinia Corporation for the U.S. Department of Energy under contract DE-FC36-08GO18032 during the project period of March 1, 2008 – March 31, 2012. Over the course of the project, Infinia Corporation achieved substantial progress in the design, fabrication, assembly, testing and evaluation of a 30-kW multi-cylinder, free-piston Stirling engine (MCFPSE) prototype. In this effort, prior MCFPSE conceptual design approaches were adapted for the development of a 30-kW design, thereby producing a cohesive design package and detailed performance specifications. Numerical analysis using the Stirling Engine Analysis and Optimization Code (SAGE) was completed culminating in the selection of a fully balanced 6-cylinder configuration composed of two 3-cylinder engine modules. The model was refined throughout the program to include all wall conduction losses, piston and rod seal losses, appendix, shuttle and pumping losses, and piston radiation loss to closely represent the real system. Performance mapping of the engine was then completed using the detailed model. Based on knowledge and experience from its existing commercial products, and using the results from the extensive numerical modeling discussed above, Infinia successfully fabricated, assembled and tested two sets of 30-kW engine modules. One of these configurations was driven by an external power supply and operated as a cooler in order to verify the mechanical integrity of the system. In the engine configuration, induction heaters provided the energy to the heater head to operate the engine. Considerable effort was expended on correcting problems associated with contact and rubbing of internal components, identification and subsequent elimination of internal leaks, and undesirable amounts of piston bias. Many details concerning the fabrication and testing efforts are considered proprietary. As a result, those findings are not disclosed herein but rather can be found in proprietary reports supplied to the DOE on a periodic basis. The prototype did not fully demonstrate performance nor did it realize the projected cost targets. Furthermore, the basis of the mechanical and electrical architecture of the 30-kW multi-cylinder prototype design is now at least two generations old. Alternatively, Infinia’s 8-kW Bonneville generator, which was successfully demonstrated in April 2012, and is slated to enter commercial production in late 2013, offers immediate benefits of lower cost and significantly higher power density such that the generator will likely meet DOE’s Sunshot LCOE target goal of $\$$0.07-0.10/kWh by 2015 and $\$$0.05-0.07/kWh by 2020. Therefore, the design of a 30-kW Stirling engine as disclosed in the project will not be pursued further. However, Infinia remains keenly interested in developing higher power Stirling machines in the future based on the new Bonneville mechanical design.

14 SOLAR ENERGY↗

Implementation of Topology Optimization Using OpenMDAO

Topology optimization is one of the widely known branches among the structural optimization, and it distinguishes itself by a large design domain and versatility. It can determine the optimal design out of an infinite number of configurations, thereby drawing interest from both industry and academia with regards to its applicability to additive manufacturing. However, its implementation is often a daunting task for engineers in practice. One of the issues is the programming effort required whenever the implementation requires any changes, ranging from subtle tweaks to drastic changes in the problem definition, and the derivative computation must be correspondingly updated after any change. The implementation, therefore, is not only time-consuming but also repetitive and susceptible to human-induced errors. In this regard, topology optimization implementations stand to benefit from reusability, ease of restructuring, and modularity. In this work, we propose OpenMDAO, a computational framework for multidisciplinary design optimization (MDO), as a generic platform for topology optimization. Two widely used topology optimization techniquesâ€"density-based and level-setâ€"are implemented as a demonstration. These techniques are implemented in a decomposed manner, with the aid of the modular architecture of OpenMDAO as well as state-of-the-art numerical methods. Variations on the density-based topology optimization approach are shown to demonstrate the modularity and automation for derivative computation that OpenMDAO provides.

Chung, Hayoung↗

Identification of PV solar cells and modules parameters using the genetic algorithms: Application to maximum power extraction

In this paper, we propose to perform a numerical technique based on genetic algorithms (GAs) to identify the electrical parameters (I{sub s}, I{sub ph}, R{sub s}, R{sub sh}, and n) of photovoltaic (PV) solar cells and modules. These parameters were used to determine the corresponding maximum power point (MPP) from the illuminated current-voltage (I-V) characteristic. The one diode type approach is used to model the AM1.5 I-V characteristic of the solar cell. To extract electrical parameters, the approach is formulated as a non convex optimization problem. The GAs approach was used as a numerical technique in order to overcome problems involved in the local minima in the case of non convex optimization criteria. Compared to other methods, we find that the GAs is a very efficient technique to estimate the electrical parameters of PV solar cells and modules. Indeed, the race of the algorithm stopped after five generations in the case of PV solar cells and seven generations in the case of PV modules. The identified parameters are then used to extract the maximum power working points for both cell and module. (author)

14 SOLAR ENERGY↗

Accelerating Continuous Variable Coherent Ising Machines Via Momentum

The Coherent Ising Machine (CIM) is a non-conventional architecture that takes inspiration from physical annealing processes to solve Ising problems heuristically. Its dynamics are naturally continuous and described by a set of ordinary differential equations that have been proven to be useful for the optimization of continuous variables nonconvex quadratic optimization problems. The dynamics of such Continuous Variable CIMs (CV-CIM) encourage optimization via optical pulses whose amplitudes are determined by the negative gradient of the objective; however, standard gradient descent is known to be trapped by local minima and hampered by poor problem conditioning. In this work, we propose to modify the CV-CIM dynamics using more sophisticated pulse injections based on tried-and-true optimization techniques such as momentum and Adam. Through numerical experiments, we show that the momentum and Adam updates can significantly speed up the CV-CIM’s convergence and improve sample diversity over the original CV-CIM dynamics. We also find that the Adam-CV-CIM’s performance is more stable as a function of feedback strength, especially on poorly conditioned instances, resulting in an algorithm that is more robust, reliable, and easily tunable. More broadly, we identify the CIM dynamical framework as a fertile opportunity for exploring the intersection of classical optimization and modern analog computing.

Ising Model↗

Gyrokinetic particle-in-cell optimization on emerging multi- and manycore platforms

The next decade of high-performance computing (HPC) systems will see a rapid evolution and divergence of multi- and manycore architectures as power and cooling constraints limit increases in microprocessor clock speeds. Understanding efficient optimization methodologies on diverse multicore designs in the context of demanding numerical methods is one of the greatest challenges faced today by the HPC community. In this paper, we examine the efficient multicore optimization of GTC, a petascale gyrokinetic toroidal fusion code for studying plasma microturbulence in tokamak devices. For GTC’s key computational components (charge deposition and particle push), we explore efficient parallelization strategies across a broad range of emerging multicore designs, including the recently-released Intel Nehalem-EX, the AMD Opteron Istanbul, and the highly multithreaded Sun UltraSparc T2+. We also present the first study on tuning gyrokinetic particle-in-cell (PIC) algorithms for graphics processors, using the NVIDIA C2050 (Fermi). Our work discusses several novel optimization approaches for gyrokinetic PIC, including mixed-precision computation, particle binning and decomposition strategies, grid replication, SIMDized atomic floating-point operations, and effective GPU texture memory utilization. Overall, we achieve significant performance improvements of 1.3–4.7× on these complex PIC kernels, despite the inherent challenges of data dependency and locality. Finally, our work also points to several architectural and programming features that could significantly enhance PIC performance and productivity on next-generation architectures.

97 MATHEMATICS AND COMPUTING↗

A numerical study of the separation wavenumber in the two-scale scattering approximation

The choice of the separation wavenumber Kd for the two-scale scattering approximation is examined by the comparison of two-scale calculations with exact numerical solutions using the moment method. It was found that the optimal choice of Kd is near k/2 when attempting to optimize for all incidence angles. When optimizing for specific incidence angles, Kd varied from k/5 at low incidence angles to just below k at higher incidence angles. These numerical results are in rough agreement with previous theoretical derivations of the separation wavenumber.

Durden, Stephen L.↗

An Airbreathing Launch Vehicle Design with Turbine-Based Low-Speed Propulsion and Dual Mode Scramjet High-Speed Propulsion

Airbreathing launch vehicles continue to be a subject of great interest in the space access community. In particular, horizontal takeoff and horizontal landing vehicles are attractive with their airplane-like benefits and flexibility for future space launch requirements. The most promising of these concepts involve airframe integrated propulsion systems, in which the external undersurface of the vehicle forms part of the propulsion flowpath. Combining of airframe and engine functions in this manner involves all of the design disciplines interacting at once. Design and optimization of these configurations is a most difficult activity, requiring a multi-discipline process to analytically resolve the numerous interactions among the design variables. This paper describes the design and optimization of one configuration in this vehicle class, a lifting body with turbine-based low-speed propulsion. The integration of propulsion and airframe, both from an aero-propulsive and mechanical perspective are addressed. This paper primarily focuses on the design details of the preferred configuration and the analyses performed to assess its performance. The integration of both low-speed and high-speed propulsion is covered. Structural and mechanical designs are described along with materials and technologies used. Propellant and systems packaging are shown and the mission-sized vehicle weights are disclosed.

Moses, P. L.↗

An Airbreathing Launch Vehicle Design with Turbine-Based Low-Speed Propulsion and Dual Mode Scramjet High-Speed Propulsion

Airbreathing launch vehicles continue to be a subject of great interest in the space access community. In particular, horizontal takeoff and horizontal landing vehicles are attractive with their airplane-like benefits and flexibility for future space launch requirements. The most promising of these concepts involve airframe integrated propulsion systems, in which the external undersurface of the vehicle forms part of the propulsion flowpath. Combining of airframe and engine functions in this manner involves all of the design disciplines interacting at once. Design and optimization of these configurations is a most difficult activity, requiring a multi-discipline process to analytically resolve the numerous interactions among the design variables. This paper describes the design and optimization of one configuration in this vehicle class, a lifting body with turbine-based low-speed propulsion. The integration of propulsion and airframe, both from an aero-propulsive and mechanical perspective are addressed. This paper primarily focuses on the design details of the preferred configuration and the analyses performed to assess its performance. The integration of both low-speed and high-speed propulsion is covered. Structural and mechanical designs are described along with materials and technologies used. Propellant and systems packaging are shown and the mission-sized vehicle weights are disclosed.

Moses, P. L.↗

Stochastic Least-Squares Petrov--Galerkin Method for Parameterized Linear Systems

We consider the numerical solution of parameterized linear systems where the system matrix, the solution, and the right-hand side are parameterized by a set of uncertain input parameters. We explore spectral methods in which the solutions are approximated in a chosen finite-dimensional subspace. It has been shown that the stochastic Galerkin projection technique fails to minimize any measure of the solution error [A. Mugler and H.-J. Starkloff, ESAIM Math. Model. Numer. Anal., 47 (2013), pp. 1237--1263]. As a remedy for this, we propose a novel stochatic least-squares Petrov--Galerkin (LSPG) method. The proposed method is optimal in the sense that it produces the solution that minimizes a weighted $\ell^2$-norm of the residual over all solutions in a given finite-dimensional subspace. Moreover, the method can be adapted to minimize the solution error in different weighted $\ell^2$-norms by simply applying a weighting function within the least-squares formulation. In addition, a goal-oriented seminorm induced by an output quantity of interest can be minimized by defining a weighting function as a linear functional of the solution. We establish optimality and error bounds for the proposed method, and extensive numerical experiments show that the weighted LSPG method outperforms other spectral methods in minimizing corresponding target weighted norms.

97 MATHEMATICS AND COMPUTING↗

Juqbox.jl

The Juqbox.jl package implements functionality for solving the quantum optimal control problem for realizing logical gates in closed quantum systems. The dynamics of the quantum system is modeled by Schroedinger's equation, which takes to form of a linear system of ordinary differential equations (ODE). Juqbox.jl solves this ODE by numerical time stepping and applies a gradient-based optimization technique to determine control pulses for driving an initial state to a final state, according to the desired logical gate transformation. To evaluate the gradient, Juqbox.jl applies the ``first discretize, then optimize'' approach based on a discrete adjoint time stepping technique. The actual optimization is performed by the open source Ipopt libaray. Juqbox.jl is written in the Julia programming language which, among many other features, provides a convenient interface to the Ipopt library.

PETERSSON, NILSA.↗

Computing an Optimal Entanglement Path with Throughput and Fidelity Considerations

Entanglement distribution is a core function of quantum networks essential for operations including teleportation, distributed quantum sensing, and multisite computation. Entanglement throughput and fidelity are two critical performance measures that depend on the quantum transmission along the links and swapping operations at the repeaters along the path. We study the problem of computing a end-to-end entanglement path that satisfies both fidelity and throughput requirements, leveraging qubit buffers at the nodes and considering the sequential swapping order. We show that the general problem of simultaneously satisfying both metrics to be NP-hard, and develop an algorithm to maximize throughput subject to a given fidelity threshold. We introduce the concepts of entanglement probability distribution and path domination and exploit them in the design of our algorithm. Extensive numerical results show that our algorithm can find optimal solutions in networks with thousands of nodes in less than a second. We also describe practical and possible implementation aspects of this algorithm in terms of devices and architecture support.

Xue, Guoliang [Arizona State University]↗

A trust-region algorithm for the optimization of PSA processes using reduced-order modeling

The last few decades have seen a considerable increase in the applications of adsorptive gas separation technologies, such as pressure swing adsorption (PSA); the applications range from bulk separations to trace contaminant removal. PSA processes are based on solid-gas equilibrium and operate under periodic transient conditions [1]. Bed models for these processes are therefore defined by coupled nonlinear partial differential and algebraic equations (PDAEs) distributed in space and time with periodic boundary conditions that connect the processing steps together and high nonlinearities arising from non-isothermal effects and nonlinear adsorption isotherms. As a result, the optimization of such systems for either design or operation represents a significant computational challenge to current nonlinear programming algorithms. Model reduction is a powerful methodology that permits systematic generation of cost-efficient low-order representations of large-scale systems that result from discretization of such PDAEs. In particular, low-dimensional approximations can be obtained from reduced order modeling (ROM) techniques based on proper orthogonal decomposition (POD) and can be used as surrogate models in the optimization problems. In this approach, a representative ensemble of solutions of the dynamic PDAE system is constructed by solving a higher-order discretization of the model using the method of lines, followed by the application of Karhunen-Loeve expansion to derive a small set of empirical eigenfunctions (POD modes). These modes are used as basis functions within a Galerkin's projection framework to derive a low-order DAE system that accurately describes the dominant dynamics of the PDAE system. This approach leads to a DAE system of significantly lower order, thus replacing the one obtained from spatial discretization before and making optimization problem computationally efficient [2]. The ROM methodology has been successfully applied to a 2-bed 4-step PSA process used for separating a hydrogen-methane mixture in [3]. The reduced order model developed was successfully used to optimize this process to maximize hydrogen recovery within a trust-region. We extend this approach in this work to develop a rigorous trust-region algorithm for ROM-based optimization of PSA processes. The trust-region update rules and sufficient decrease condition for the objective is used to determine the size of the trust-region. Based on the decrease in the objective function and error in the ROM, a ROM updation strategy is designed [4, 5]. The inequalities and bounds are handled in the algorithm using exact penalty formulation, and a non-smooth trust-region algorithm by Conn et al. [6] is used to handle non-differentiability. To ensure that the first order consistency condition is met and the optimum obtained from ROM-based optimization corresponds to the optimum of the original problem, a scaling function, such as one proposed by Alexandrov et al. [7], is incorporated in the objective function. Such error control mechanism is also capable of handling numerical inconsistencies such as unphysical oscillations in the state variable profiles. The proposed methodology is applied to optimize a PSA process to concentrate CO{sub 2} from a nitrogen-carbon dioxide mixture. As in [3], separate ROMs are developed for each operating step with different POD modes for each state variable. Numerical results will be presented for optimization case studies which involve maximizing CO{sub 2} recovery, feed throughput or minimizing overall power consumption.

97 MATHEMATICS AND COMPUTING↗

Toward a Unified Framework for WEC Numerical Modeling

This presentation is about moving toward a united framework for WEC numerical modeling. A unified framework for WEC numerical modeling could help device developers on three fronts: 1) optimization; 2) more accurate load estimates; 3) validation.

modeling↗

Running Primal-Dual Gradient Method for Time-Varying Nonconvex Problems

This paper focuses on a time-varying constrained nonconvex optimization problem, and considers the synthesis and analysis of online regularized primal-dual gradient methods to track a Karush-Kuhn-Tucker (KKT) trajectory. The proposed regularized primal-dual gradient method is implemented in a running fashion, in the sense that the underlying optimization problem changes during the execution of the algorithms. In order to study its performance, we first derive its continuous-time limit as a system of differential inclusions. We then study sufficient conditions for tracking a KKT trajectory, and also derive asymptotic bounds for the tracking error (as a function of the time-variability of a KKT trajectory). Further, we provide a set of sufficient conditions for the KKT trajectories not to bifurcate or merge, and also investigate the optimal choice of the parameters of the algorithm. Illustrative numerical results for a time-varying nonconvex problem are provided.

differential inclusion↗