Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization methods”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 1,423 records · Page 79
All sourcesNASA NTRSDOE OSTI
NASA NTRS2018

Real-Time Adaptive Drag Minimization Wind Tunnel Investigation of a Flexible Wing with Variable Camber Continuous Trailing Edge Flap System

This paper reports the results of a recently completed real-time adaptive drag minimization wind tunnel investigation of a highly flexible wing wind tunnel model equipped with the Variable Camber Continuous Trailing Flap (VCCTEF) technology at the University of Washington Aeronautical Laboratory (UWAL). The wind tunnel investigation is funded by NASA SBIR Phase II contract with Scientific Systems Company, Inc. (SSCI) and University of Washington (UW) as a subcontractor. The wind tunnel model is a sub-scale Common Research Model (CRM) wing constructed of foam core and fiberglass skin and is aeroelastically scaled to achieve a wing tip deflection of 10% of the wing semi-span which represents a typical wing tip deflection for a modern transport such as Boeing 787. The jig-shape twist of the CRM wing is optimized using a CART3D aero-structural model to achieve the minimum induced drag for the design cruise lift coefficient of 0.5. The wing is equipped with two chord wise cambered segments for each of the six span wise flap sections for a total of 12 individual flap segments that comprise the VCCTEF system. Each of the 12 flap segments is actively controlled by an electric servo-actuator. The real-time adaptive drag optimization strategy includes an on-board aerodynamic model identification, a model excitation, and a real-time drag optimization. The on-board aerodynamic model is constructed parametrically as a function of the angle of attack and flap positions to model the lift and drag coefficients of the wing. The lift coefficient models include a linear model and a second-order model. The drag coefficient models include a quadratic model and a higher-order up to 6th-order model to accurately model the drag coefficient at high angles of attack. The onboard aerodynamic model identification includes a recursive least-squares (RLS) algorithm and a batch least-squares (BLS) algorithm designed to estimate the model parameters. The model excitation method is designed to sample the input set that comprises the angle of attack and the flap positions. Three model excitation methods are developed: random excitation method, sweep method, and iterative angle-of-attack seeking method. The real-time drag optimization includes a generic algorithm developed by SSCI and several optimization methods developed by NASA which include a second-order gradient Newton-Raphson optimization method, an iterative gradient optimization method, a pseudo-inverse optimization method, an analytical optimization method, and an iterative refinement optimization method. The first wind tunnel test entry took place in September 2017. This test revealed major hardware issues and required further redesign of the flap servo mechanisms. The second test entry took place in April 2018. However, the test was not successful due to the issues with the onboard aerodynamic model identification RLS algorithm which incorrectly identified model parameters. This test also provides an experimental comparison study between the VCCTEF and a variable camber discrete trailing edge flap (VCDTEF) without the elastomer transition mechanisms. The experimental result confirms the benefit of the VCCTEF which produces lower drag by 5% than the VCDTEF. The third and final test entry took place in June 2018 after the issues with the RLS algorithm have been identified and corrected. Additional improvements were implemented. These include the BLS algorithm, the iterative angle-of-attack seeking method, the iterative gradient optimization method, and the pseudo-inverse optimization method. The test objectives were successfully demonstrated as the real-time drag optimization identifies several optimal solutions at off-design lift coefficients. The iterative gradient optimization method is found to achieve up to 4.7% drag reduction for the off-design lift coefficient of 0.7. The pseudo-inverse optimization method which does not require the drag coefficient model is found to be quite effective in reducing drag. Up to 9.4% drag reduction for the off-design lift coefficient of 0.7 is achieved with the pseudo-inverse optimization method. The wind tunnel investigation demonstrates the potential of real-time drag optimization technology. Several new capabilities are developed that could enable future adaptive wing technologies for flexible wings equipped with drag control devices such as the VCCTEF.

Drag Optimization↗
DOE OSTI2023

Multi-objective, robust constraints enforced global topology optimizer for optical devices

A method for optimization of photonic devices is disclosed. The method includes receiving a set of unconstrained latent variables; mapping the set of unconstrained latent variables to a constrained space to generate a constrained device; calculating the permittivity across each element of the constrained device; determining a permittivity-constrained width gradient based at least partially on the permittivity across each element; and optimizing the set of unconstrained latent variables by at least partially using the permittivity-constrained width gradient.

Fan, Jonathan↗
NASA NTRS2020

Multidisciplinary Design Optimization of Low-Boom Supersonic Aircraft with Mission Constraints

Conceptual design of low-boom supersonic aircraft is heavily dictated by aircraft volume and lift distributions. These unique design characteristics make it a challenge to enforce mission requirements (such as static margins and trim requirements) during design optimization. This low-boom design challenge is resolved by using reversed equivalent area targets for low-fidelity low-boom inverse design and a block coordinate optimization (BCO) method for multidisciplinary design optimization (MDO). The corresponding low-boom MDO problem includes aircraft mission constraints on ranges, cruise speeds, trim for low-boom cruise, static margins for takeoff/cruise/landing, takeoff/landing field lengths, approach velocity, and tail rotation angles for trim at takeoff/landing, as well as fuselage volume constraints for passengers and main gear storage. The BCO method is developed to optimally resolve the conflicts between the low-boom inverse design objective and other design constraints. This method is successfully applied to design a low-boom supersonic configuration that carries 40 passengers, flies a low-boom mission with cruise Mach of 1.6 and range of 2,500 nm, and cruises overwater at Mach 1.8 with range of 3,600 nm. The generated configuration satisfies all specified mission constraints and has the potential to match a reversed equivalent area target with ground noise level below 70 PLdB.

Multidisciplinary design optimization↗
NASA NTRS2014

Apparatus and Methods for Manipulation and Optimization of Biological Systems

The invention provides systems and methods for manipulating biological systems, for example to elicit a more desired biological response from a biological sample, such as a tissue, organ, and/or a cell. In one aspect, the invention operates by efficiently searching through a large parametric space of stimuli and system parameters to manipulate, control, and optimize the response of biological samples sustained in the system. In one aspect, the systems and methods of the invention use at least one optimization algorithm to modify the actuator's control inputs for stimulation, responsive to the sensor's output of response signals. The invention can be used, e.g., to optimize any biological system, e.g., bioreactors for proteins, and the like, small molecules, polysaccharides, lipids, and the like. Another use of the apparatus and methods includes is for the discovery of key parameters in complex biological systems.

Ho, Chih-Ming↗
DOE OSTI2021

Solar Field Layout and Aimpoint Strategy Optimization

The existing methods that determine heliostat aiming strategies for concentrating solar power (CSP) central receiver plants typically use heuristics and/or are computationally expensive, and they lack flexibility for different desired flux profiles and receiver geometries. Because of the interaction between layout and aimpoint strategy, considering the former without accounting for the latter may yield solutions with superfluous heliostats that cannot be used efficiently without compromising receiver flux constraints. To that end, we develop a software decision tool that uses innovative optimization methods to both optimize aimpoint strategies and improve candidate layouts for the solar collection field of a CSP central receiver plant. A CSP plant’s effectiveness relies on the optical efficiency of the solar field, which may be limited by losses due to (i) the cosine effect, (ii) atmospheric attenuation, (iii) interference (i.e., shading and blocking) between heliostats, (iv) spillage as a result of heliostat positioning and geometry, and (iv) some heliostats’ inability to direct irradiance to the receiver without damage due to excessive thermal flux. The goal of this work is to obtain optimized aiming strategies and improved solar field layouts that reduce capital cost and increase field optical efficiency and utilization, while meeting the power requirements of a given CSP receiver design. We formulate the aimpoint optimization problem as a mixed-integer linear programming model, which we then decompose into submodels that we solve in parallel. The decomposition subdivides the solar field into sections, and aimpoint strategies for each section are obtained independently of the others. To improve existing layouts, we develop a utilization-weighted efficiency metric that we use to relocate heliostats to sections of the solar field with similar efficiency and higher utilization. Finally, to connect our software to high-fidelity flux models, we develop a Python application programming interface for SolarPILOT, a mature software package that characterizes solar field performance and generates the heliostat layouts and flux maps that serve as input to our models.

14 SOLAR ENERGY↗
NASA NTRS1978

A simple method of calculating Stirling engines for engine design optimization

A calculation method is presented for a rhombic drive Stirling engine with a tubular heater and cooler and a screen type regenerator. Generally the equations presented describe power generation and consumption and heat losses. It is the simplest type of analysis that takes into account the conflicting requirements inherent in Stirling engine design. The method itemizes the power and heat losses for intelligent engine optimization. The results of engine analysis of the GPU-3 Stirling engine are compared with more complicated engine analysis and with engine measurements.

Martini, W. R.↗
NASA NTRS1991

Optimal least-squares finite element method for elliptic problems

An optimal least squares finite element method is proposed for two dimensional and three dimensional elliptic problems and its advantages are discussed over the mixed Galerkin method and the usual least squares finite element method. In the usual least squares finite element method, the second order equation (-Delta x (Delta u) + u = f) is recast as a first order system (-Delta x p + u = f, Delta u - p = 0). The error analysis and numerical experiment show that, in this usual least squares finite element method, the rate of convergence for flux p is one order lower than optimal. In order to get an optimal least squares method, the irrotationality Delta x p = 0 should be included in the first order system.

Jiang, Bo-Nan↗
DOE OSTI2022

Evaluation of Protein Extraction Methods for Metaproteomic Analyses of Root-Associated Microbes

Metaproteomics is a powerful tool for the characterization of metabolism, physiology, and functional interactions in microbial communities, including plant-associated microbiota. However, the metaproteomic methods that have been used to study plant-associated microbiota are very laborious and require large amounts of plant tissue, hindering wider application of these methods. We optimized and evaluated different protein extraction methods for metaproteomics of plant-associated microbiota in two different plant species (Arabidopsis and maize). Our main goal was to identify a method that would work with low amounts of input material (40 to 70 mg) and that would maximize the number of identified microbial proteins. We tested eight protocols, each comprising a different combination of physical lysis method, extraction buffer, and cell-enrichment method on roots from plants grown with synthetic microbial communities. We assessed the performance of the extraction protocols by liquid chromatography-tandem mass spectrometry–based metaproteomics and found that the optimal extraction method differed between the two species. For Arabidopsis roots, protein extraction by beating whole roots with small beads provided the greatest number of identified microbial proteins and improved the identification of proteins from gram-positive bacteria. For maize, vortexing root pieces in the presence of large glass beads yielded the greatest number of microbial proteins identified. Based on these data, we recommend the use of these two methods for metaproteomics with Arabidopsis and maize. Furthermore, detailed descriptions of the eight tested protocols will enable future optimization of protein extraction for metaproteomics in other dicot and monocot plants.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1993

Layout optimization using the homogenization method

A generalized layout problem involving sizing, shape, and topology optimization is solved by using the homogenization method for three-dimensional linearly elastic shell structures in order to seek a possibility of establishment of an integrated design system of automotive car bodies, as an extension of the previous work by Bendsoe and Kikuchi. A formulation of a three-dimensional homogenized shell, a solution algorithm, and several examples of computing the optimum layout are presented in this first part of the two articles.

Suzuki, Katsuyuki↗
DOE OSTI2014

Comparison of ADVANTG Simulations to Simple Shielding Measurements - Paper 36

Monte Carlo (MC) radiation transport simulations, like those performed using Monte Carlo N-Particle (MCNP), can be highly accurate but require time to reduce the statistical uncertainties in the calculated detector response(s). Many different 'variance reduction' techniques devised over the years increase the efficiency of MC calculations, but these methods can be more art than science. Many of these methods are problem specific or require careful tuning of parameters for good performance. One of the best variance reduction methods, in terms of both reliable performance increases and ease of use, is the use of weight windows. Weight windows are derived from an importance map in space and energy that allows the transport code to focus more simulation time on particles that have a higher likelihood of being important to the final detector response. Less time is spent simulating particles that have little chance of making a contribution to the detector response. MCNP already includes the abilities to generate and use weight windows. Unfortunately, generating weight windows can take a very long time, perhaps longer than the original problem. Oak Ridge National Laboratory has led the development of hybrid methods using a discrete ordinates adjoint calculation to quickly develop an importance map (weight windows) for use in a Monte Carlo code. The Consistent Adjoint Driven Importance Sampling (CADIS) method uses an adjoint calculation to develop both an importance map and a biased source distribution that work together. This method is reasonably automatic, is easy to use, and has been implemented in the Automated Variance reduction Generator (ADVANTG) package that works with MCNP5. ADVANTG reads an MCNP input file and a small amount of extra user information and then runs an adjoint deterministic calculation using Denovo. The importance map and biased source distribution derived from the CADIS method can then be incorporated back into the original MCNP input file to enhance the figure-of-merit (FOM) of the calculation. The FOM is a measure of the efficiency of the calculation using the amount of run time and corresponding level of statistical uncertainty in the detector result. ADVANTG-enhanced MCNP input files have been shown to increase the FOM of many types of problems, obtaining the same level of statistical uncertainty in a shorter time compared to standard MCNP. ADVANTG can also generate variance reduction parameters (importance map and biased source) using the Forward-Weighted CADIS (FW-CADIS) method for optimizing mesh tallies. The CADIS method creates variance reduction parameters that optimize a tally's total quantity (flux, dose rate, interaction rate, etc.) and will not generally increase performance for all parts of a segmented tally. To optimize a segmented tally, the FW-CADIS method uses two discrete ordinates calculations to make variance reduction parameters that help compute a segmented tally with uniform relative uncertainties in each bin. This report will demonstrate that using ADVANTG for neutron and photon radiation shielding problems will (1) preserve the standard MCNP results and (2) obtain those results either with less statistical uncertainty or in shorter times than the standard MCNP calculation. The four demonstration problems in this report are based on simple neutron or photon transmission measurements through different materials. All of the problems here used the CADIS method and still saw improvement across the flux tallies segmented by particle energy. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗
NASA NTRS2004

Adjoint Algorithm for CAD-Based Shape Optimization Using a Cartesian Method

Adjoint solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape optimization. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (geometric parameters that control the shape). More recently, emerging adjoint applications focus on the analysis problem, where the adjoint solution is used to drive mesh adaptation, as well as to provide estimates of functional error bounds and corrections. The attractive feature of this approach is that the mesh-adaptation procedure targets a specific functional, thereby localizing the mesh refinement and reducing computational cost. Our focus is on the development of adjoint-based optimization techniques for a Cartesian method with embedded boundaries.12 In contrast t o implementations on structured and unstructured grids, Cartesian methods decouple the surface discretization from the volume mesh. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin et developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation. Central to automated shape optimization algorithms is the issue of geometry modeling and control. The need to optimize complex, "real-life" geometry provides a strong incentive for the use of parametric-CAD systems within the optimization procedure. In previous work, we presented an effective optimization framework that incorporates a direct-CAD interface. In this work, we enhance the capabilities of this framework with efficient gradient computations using the discrete adjoint method. We present details of the adjoint numerical implementation, which reuses the domain decomposition, multigrid, and time-marching schemes of the flow solver. Furthermore, we explain and demonstrate the use of CAD in conjunction with the Cartesian adjoint approach. The final paper will contain a number of complex geometry, industrially relevant examples with many design variables to demonstrate the effectiveness of the adjoint method on Cartesian meshes.

Nemec, Marian↗
DOE OSTI2019

An adjoint method for neoclassical stellarator optimization

Stellarators remain an enticing route to steady-state fusion power. However, to achieve the required confinement, the magnetic geometry must be highly optimized. This optimization requires navigating high-dimensional spaces, often necessitating the use of gradient-based methods. The gradient of the neoclassical fluxes is expensive to compute with classical methods, requiring $O(N)$ flux computations, where $N$ is the number of parameters. To reduce the cost of the gradient computation, we present an adjoint method for computing the derivatives of moments of the neoclassical distribution function for stellarator optimization. The linear adjoint method allows derivatives of quantities which depend on solutions of a linear system, such as moments of the distribution function, to be computed with respect to many parameters from the solution of only two linear systems. This reduces the cost of computing the gradient to the point that the finite-collisionality neoclassical fluxes can be used within an optimization loop. With the neoclassical adjoint method, we compute solutions of the drift kinetic equation and an adjoint drift kinetic equation to obtain derivatives of neoclassical quantities with respect to geometric parameters. When the number of parameters in the derivative is large ( $O(10^{2})$ ), this adjoint method provides up to a factor of 200 reduction in cost. We demonstrate adjoint-based optimization of the field strength to obtain minimal bootstrap current on a surface. With adjoint-based derivatives, we also compute the local sensitivity to magnetic perturbations on a flux surface and identify regions where tight tolerances on error fields are required for control of the bootstrap current or radial transport. Moreover, the solve for the ambipolar electric field is accelerated using a Newton method with derivatives obtained from the adjoint method.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1976

Computational methods to obtain time optimal jet engine control

Dynamic Programming and the Fletcher-Reeves Conjugate Gradient Method are two existing methods which can be applied to solve a general class of unconstrained fixed time, free right end optimal control problems. New techniques are developed to adapt these methods to solve a time optimal control problem with state variable and control constraints. Specifically, they are applied to compute a time optimal control for a jet engine control problem.

Basso, R. J.↗
NASA NTRS1996

A Review of High-Order and Optimized Finite-Difference Methods for Simulating Linear Wave Phenomena

This paper presents a review of high-order and optimized finite-difference methods for numerically simulating the propagation and scattering of linear waves, such as electromagnetic, acoustic, or elastic waves. The spatial operators reviewed include compact schemes, non-compact schemes, schemes on staggered grids, and schemes which are optimized to produce specific characteristics. The time-marching methods discussed include Runge-Kutta methods, Adams-Bashforth methods, and the leapfrog method. In addition, the following fourth-order fully-discrete finite-difference methods are considered: a one-step implicit scheme with a three-point spatial stencil, a one-step explicit scheme with a five-point spatial stencil, and a two-step explicit scheme with a five-point spatial stencil. For each method studied, the number of grid points per wavelength required for accurate simulation of wave propagation over large distances is presented. Recommendations are made with respect to the suitability of the methods for specific problems and practical aspects of their use, such as appropriate Courant numbers and grid densities. Avenues for future research are suggested.

Zingg, David W.↗
DOE OSTI2021

Practical implications of SFQ-based two-qubit gates

Scalability of today’s superconducting quantum computers is limited due to the huge costs of generating/routing microwave control pulses per qubit from room temperature. One active research area in both industry and academia is to push the classical controllers to the dilution refrigerator in order to increase the scalability of quantum computers. Superconducting Single Flux Quantum (SFQ) is a classical logic technology with low power consumption and ultra-high speed, and thus is a promising candidate for in-fridge classical controllers with maximized scalability. Prior work has demonstrated high-fidelity SFQ-based single-qubit gates. However, little research has been done on SFQ-based multi-qubit gates, which are necessary to realize SFQ-based universal quantum computing.In this paper, we present the first thorough analysis of SFQ-based two-qubit gates. Our observations show that SFQ-based two-qubit gates tend to have high leakage to qubit non-computational subspace, which presents severe design challenges. We show that despite these challenges, we can realize gates with high fidelity by carefully designing optimal control methods and qubit architectures. We develop optimal control methods that suppress leakage, and also investigate various qubit architectures that reduce the leakage. After carefully engineering our SFQ-friendly quantum system, we show that it can achieve similar gate fidelity and gate time to microwave-based quantum systems. Furthermore, the promising results of this paper show that (1) SFQ-based universal quantum computation is both feasible and effective; and (2) SFQ is a promising approach in designing classical controller for quantum machines because it can increase the scalability while preserving gate fidelity and performance.

42 ENGINEERING↗
NASA NTRS1972

A survey of methods of feasible directions for the solution of optimal control problems

Three methods of feasible directions for optimal control are reviewed. These methods are an extension of the Frank-Wolfe method, a dual method devised by Pironneau and Polack, and a Zontendijk method. The categories of continuous optimal control problems are shown as: (1) fixed time problems with fixed initial state, free terminal state, and simple constraints on the control; (2) fixed time problems with inequality constraints on both the initial and the terminal state and no control constraints; (3) free time problems with inequality constraints on the initial and terminal states and simple constraints on the control; and (4) fixed time problems with inequality state space contraints and constraints on the control. The nonlinear programming algorithms are derived for each of the methods in its associated category.

Polak, E.↗
NASA NTRS2001

Bell-Curve Based Evolutionary Strategies for Structural Optimization

Evolutionary methods are exceedingly popular with practitioners of many fields; more so than perhaps any optimization tool in existence. Historically Genetic Algorithms (GAs) led the way in practitioner popularity. However, in the last ten years Evolutionary Strategies (ESs) and Evolutionary Programs (EPS) have gained a significant foothold. One partial explanation for this shift is the interest in using GAs to solve continuous optimization problems. The typical GA relies upon a cumbersome binary representation of the design variables. An ES or EP, however, works directly with the real-valued design variables. For detailed references on evolutionary methods in general and ES or EP in specific see Back and Dasgupta and Michalesicz. We call our evolutionary algorithm BCB (bell curve based) since it is based upon two normal distributions.

Kincaid, Rex K.↗