Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization applications”

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 199 records · Page 11

Engineering applications of heuristic multilevel optimization methods

Some engineering applications of heuristic multilevel optimization methods are presented and the discussion focuses on the dependency matrix that indicates the relationship between problem functions and variables. Coordination of the subproblem optimizations is shown to be typically achieved through the use of exact or approximate sensitivity analysis. Areas for further development are identified.

Barthelemy, Jean-Francois M.↗

COEK

COEK (C++ Optimization Expression Kernel) is a C++ library that supports the expression and manipulation of algebraic expressions commonly used in optimization applications. COEK. Supports several mechanisms for defining and managing expressions and performing automatic differentiation. COEK also includes low-level interfaces for defining optimization models and interfacing with optimization solvers.SAND2019-14491 M Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

Hart, William↗

Nonlinear dynamics optimization with particle swarm and genetic algorithms for SPEAR3 emittance upgrade

Nonlinear dynamics optimization is carried out for a low emittance upgrade lattice of SPEAR3 in order to improve its dynamic aperture and Touschek lifetime. Two multi-objective optimization algorithms, a genetic algorithm and a particle swarm algorithm, are used for this study. The performance of the two algorithms are compared. The result shows that the particle swarm algorithm converges significantly faster to similar or better solutions than the genetic algorithm and it does not require seeding of good solutions in the initial population. These advantages of the particle swarm algorithm may make it more suitable for many accelerator optimization applications.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Isopod (inverse Optimization And Design): Moose-based Application For Performing Inverse Optimization On Multiphysics Modeling And Simulation

ISOPOD (InverSe OPtimizatiOn and Design) will be a MOOSE (Multiphysics Object Oriented Simulation Environment)-based framework which will iteratively estimate the parameters by minimizing the difference between simulated and experimental observables. While inverse optimization has long been used for parameter estimation, the unique feature of ISOPOD is rapid solution of new inverse problems, leading to accelerated Research, Development and Demonstration (RD&D) for complex parameter estimation problems. This will be achieved by extending the software structure of MOOSE to inverse optimization, as well as building on the unique automatic differentiation feature of MOOSE.

Munday, LynnB↗

COMPARING NUMERICAL METHODS FOR ISOTHERMAL MAGNETIZED SUPERSONIC TURBULENCE

Many astrophysical applications involve magnetized turbulent flows with shock waves. Ab initio star formation simulations require a robust representation of supersonic turbulence in molecular clouds on a wide range of scales imposing stringent demands on the quality of numerical algorithms. We employ simulations of supersonic super-Alfvenic turbulence decay as a benchmark test problem to assess and compare the performance of nine popular astrophysical MHD methods actively used to model star formation. The set of nine codes includes: ENZO, FLASH, KT-MHD, LL-MHD, PLUTO, PPML, RAMSES, STAGGER, and ZEUS. These applications employ a variety of numerical approaches, including both split and unsplit, finite difference and finite volume, divergence preserving and divergence cleaning, a variety of Riemann solvers, and a range of spatial reconstruction and time integration techniques. We present a comprehensive set of statistical measures designed to quantify the effects of numerical dissipation in these MHD solvers. We compare power spectra for basic fields to determine the effective spectral bandwidth of the methods and rank them based on their relative effective Reynolds numbers. We also compare numerical dissipation for solenoidal and dilatational velocity components to check for possible impacts of the numerics on small-scale density statistics. Finally, we discuss the convergence of various characteristics for the turbulence decay test and the impact of various components of numerical schemes on the accuracy of solutions. The nine codes gave qualitatively the same results, implying that they are all performing reasonably well and are useful for scientific applications. We show that the best performing codes employ a consistently high order of accuracy for spatial reconstruction of the evolved fields, transverse gradient interpolation, conservation law update step, and Lorentz force computation. The best results are achieved with divergence-free evolution of the magnetic field using the constrained transport method and using little to no explicit artificial viscosity. Codes that fall short in one or more of these areas are still useful, but they must compensate for higher numerical dissipation with higher numerical resolution. This paper is the largest, most comprehensive MHD code comparison on an application-like test problem to date. We hope this work will help developers improve their numerical algorithms while helping users to make informed choices about choosing optimal applications for their specific astrophysical problems.

79 ASTRONOMY AND ASTROPHYSICS↗

High-Fidelity Multidisciplinary Design Optimization Methodology with Application to Rotor Blades

A multidisciplinary design optimization procedure has been developed and applied to rotorcraft simulations involving tightly-coupled, high-fidelity computational fluid dynamics and comprehensive analysis. A discretely-consistent, adjoint-based sensitivity analysis available in the fluid dynamics solver provides sensitivities arising from unsteady turbulent flows on unstructured, dynamic, overset meshes, while a complex-variable approach is used to compute structural sensitivities with respect to aerodynamic loads. The multidisciplinary sensitivity analysis is conducted through integrating the sensitivity components from each discipline of the coupled system. Accuracy of the coupled system for high-fidelity rotorcraft analysis is verified; simulation results exhibit good agreement with established solutions. A constrained gradient-based design optimization for a HART-II rotorcraft configuration is demonstrated. The computational cost for individual components of the multidisciplinary sensitivity analysis is assessed and improved.

Wang, Li↗

Application of numerical optimization to the design of supercritical airfoils without drag-creep

Recent applications of numerical optimization to the design of advanced airfoils for transonic aircraft have shown that low-drag sections can be developed for a given design Mach number without an accompanying drag increase at lower Mach numbers. This is achieved by imposing a constraint on the drag coefficient at an off-design Mach number while the drag at the design Mach number is the objective function. Such a procedure doubles the computation time over that for single design-point problems, but the final result is worth the increased cost of computation. The ability to treat such multiple design-point problems by numerical optimization has been enhanced by the development of improved airfoil shape functions. Such functions permit a considerable increase in the range of profiles attainable during the optimization process.

Hicks, R. M.↗

Survey - Applications of structural optimization methods to fixed wing aircraft and spacecraft

Results of a technical survey of the practical applications of structural optimization methods in the U.S. aerospace industry through 1980s are summarized. One of the most important developments in the 80s is the more widespread acceptance of structural optimization as one of the design tools that support practical structural design. Another significant advance is the development of large software tools for production applications. Attention is also given to the tailoring of the computerized design process to the specific environment of each company. The two most important aspects of this tailoring are seamless and easy-to-use incorporation of structural optimization in the overall aerospace design/production process and multidisciplinary integration aimed at ultimate performance optimization of the final product. Some specific applications discussed include the X-29 forward swept wing demonstrator aircraft, composite wing and vertical tail program, fighter wing redesign evaluations, high speed aircraft design, and space structures.

Miura, Hirokazu↗

POEK

POEK (Python Optimization Expression Kernel) is a Python library that supports the expression and manipulation of algebraic expressions commonly used in optimization applications. POEK interfaces with the COEK library to support fast methods for defining and managing expressions and performing automatic differentiation. POEK also interfaces with COEK to directly interface with optimization solvers (i.e. without relying on file I/O). SAND2019-14492 M Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Hart, William↗

Global Trees: A Framework for Linked Data Structures on Distributed Memory Parallel Systems

This paper describes the Global Trees (GT) system that provides a multi-layered interface to a global address space view of distributed tree data structures, while providing scalable performance on distributed memory systems. The Global Trees system utilizes coarse-grained data movement to enhance locality and communication efficiency. We describe the design and implementation of GT, illustrate its use in the context of a gravitational simulation application, and provide experimental results that demonstrate the effectiveness of the approach. The key benefits of using this system include efficient sharedmemory style programming of distributed trees, tree-specific optimizations for data access and computation, and the ability to customize many aspects of GT to optimize application performance.

97 MATHEMATICS AND COMPUTING↗

Automated Finite Element Modeling of Wing Structures for Shape Optimization

The displacement formulation of the finite element method is the most general and most widely used technique for structural analysis of airplane configurations. Modem structural synthesis techniques based on the finite element method have reached a certain maturity in recent years, and large airplane structures can now be optimized with respect to sizing type design variables for many load cases subject to a rich variety of constraints including stress, buckling, frequency, stiffness and aeroelastic constraints (Refs. 1-3). These structural synthesis capabilities use gradient based nonlinear programming techniques to search for improved designs. For these techniques to be practical a major improvement was required in computational cost of finite element analyses (needed repeatedly in the optimization process). Thus, associated with the progress in structural optimization, a new perspective of structural analysis has emerged, namely, structural analysis specialized for design optimization application, or.what is known as "design oriented structural analysis" (Ref. 4). This discipline includes approximation concepts and methods for obtaining behavior sensitivity information (Ref. 1), all needed to make the optimization of large structural systems (modeled by thousands of degrees of freedom and thousands of design variables) practical and cost effective.

Harvey, Michael Stephen↗

A Tchebycheff-based multi-objective combined with a PSO–SQP dynamic real-time optimization framework for cycling energy systems

The aim in this work is to develop an optimization framework to address cycling of baseload energy systems due to the penetration of renewables into the grid. The developed strategy corresponds to a multi-objective and dynamic real-time optimization (MOO-DRTO) framework applied to a postcombustion MEA-based CO 2 capture process from a baseload coal-fired power plant under cycling conditions. A Tchebycheff-based method is used for the multi-objective optimization (MOO) component. Also, a hybrid approach consisting of Particle Swarm Optimization (PSO) and Sequential Quadratic Programming (SQP) is implemented for the first time in process systems engineering to solve the dynamic real-time optimization (DRTO) component. The objectives considered in the MOO-DRTO framework are economic and environmental. The proposed MOO-DRTO strategy is successfully implemented and 24-h optimal output trajectories for the carbon capture system under cycling are generated. Also, the optimal compromise is chosen from the Pareto front according to a set of selected weights for the objectives with minimal interaction between the framework and decision maker. The results indicated that the developed framework has potential to be extended to plant-wide optimization applications under cycling.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Monotonically convergent optimization in quantum control using Krotov's method

The non-linear optimization method developed by A. Konnov and V. Krotov [Autom. Remote Cont. (Engl. Transl.) 60, 1427 (1999)] has been used previously to extend the capabilities of optimal control theory from the linear to the non-linear Schroedinger equation [S. E. Sklarz and D. J. Tannor, Phys. Rev. A 66, 053619 (2002)]. Here we show that based on the Konnov-Krotov method, monotonically convergent algorithms are obtained for a large class of quantum control problems. It includes, in addition to nonlinear equations of motion, control problems that are characterized by non-unitary time evolution, nonlinear dependencies of the Hamiltonian on the control, time-dependent targets, and optimization functionals that depend to higher than second order on the time-evolving states. We furthermore show that the nonlinear (second order) contribution can be estimated either analytically or numerically, yielding readily applicable optimization algorithms. We demonstrate monotonic convergence for an optimization functional that is an eighth-degree polynomial in the states. For the ''standard'' quantum control problem of a convex final-time functional, linear equations of motion and linear dependency of the Hamiltonian on the field, the second-order contribution is not required for monotonic convergence but can be used to speed up convergence. We demonstrate this by comparing the performance of first- and second-order algorithms for two examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Evaluation of nickel-hydrogen battery for space application

Results of electrical space qualification tests of nickel-hydrogen battery type HR 23S are presented. The results obtained for the nickel-cadmium battery type VO 23S are similar except that the voltage level and the charge conservation characteristics vary significantly. The electrical and thermal characteristics permit predictions of the following optimal applications: charge coefficient in the order of 1.3 to 1.4 at 20C; charge current density higher than C/10 at 20C; discharge current density from C/10 to C/3 at 20C; maximum discharge temperature: OC; storage temperature: -20C.

Billard, J. M.↗

Application of stochastic optimization to nuclear power plant asset management decisions

We describe the development and application of stochastic optimization models and algorithms to address an issue of critical importance in the strategic allocation of resources; namely, the selection of a portfolio of capital investment projects under the constraints of a limited and uncertain budget. This issue is significant and one that faces decision-makers across all industries. The objective of this strategic decision process is generally self evident - to maximize the value obtained from the portfolio of selected projects (with value usually measured in terms of the portfolio's net present value). However, heretofore, many organizations have developed processes to make these investment decisions using simplistic rule-based rank-ordering schemes. This approach has the significant limitation of not accounting for the (often large) uncertainties in the costs or economic benefits associated with the candidate projects or in the uncertainties in the actual funds available to be expended over the projected period of time. As a result, the simple heuristic approaches that typically are employed in industrial practice generate outcomes that are non-optimal and do not achieve the level of benefits intended. In this paper we describe the results of research performed to utilize stochastic optimization models and algorithms to address this limitation by explicitly incorporating the evaluation of uncertainties in the analysis and decision making process. (authors)

97 MATHEMATICS AND COMPUTING↗

HPC Resource Allocation Under Energy Constraints

We discuss the new problem faced by High-Performance Computing (HPC) facilities in allocating resources to users of their facilities: while facilities once allocated a single finite resource—node-hours—now facilities must also concurrently allocate a second scarce resource: electrical energy, which is bounded within each facility's annual operations budget. Current application optimization practices encourage conservation of the first resource, but can be potentially unaffordably wasteful of the second. We describe a framework for reasoning about such allocations that can be utilized by facilities to articulate policy, while encouraging scientific application developers to write code mindfully of both constraints. We outline the requirements on facilities, on developers, and on hardware vendors and integrators that are necessary to enable the implementation of this framework.

97 MATHEMATICS AND COMPUTING↗