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 91 records · Page 5

Numerically Optimized Coronagraph Designs for the Habitable Exoplanet Imaging Mission (HabEx) Concept

The primary science goal of the Habitable Exoplanet Imaging Mission (HabEx), one of four candidate flagship missions under investigation, is to image and spectrally characterize Earth-like exoplanets. It is well known that pupil obscurations degrade coronagraphic performance and complicate coronagraph design, so HabEx is planned to have an off-axis, unobscured primary mirror. We utilize the circular symmetry of the aperture to investigate 1D-radial coronagraph optimization methods that are prohibitively time-consuming or intractable in 2D, such as diffractive pupil remapping and concurrent, multi-plane optimization. We also directly constrain sensitivities to dynamic, low-order Zernike aberrations, which are separable in polar coordinates and can thus be propagated as 1D-radial integrals. The mask technologies in our designs claim heritage from the extensive modeling and testbed experiments performed by the Wide-Field Infrared Survey Telescope (WFIRST) Coronagraph Instrument (CGI) project. In this paper, we detail our optimization methods and outline future work to complete our design survey.

Balasubramaian, Kunjithapatham↗

Automated tuning of airframe vibration by structural optimization

Numerical optimization techniques are used to modify the dynamic response at a specified point(s) of a helicopter airframe structure due to a steady state narrow band excitation. Calculation of steady state vibration amplitude is reduced to the solution of linear equations with complex coefficients. The sensitivity of the dynamic amplitudes with respect to the structural parameter perturbations can be computed with the same technique as the one used in the static displacement sensitivity without requiring eigenvector sensitivity. Approximate models for critical structural responses are created based on the sensitivity data to reduce the amount of computational effort and to enable the design of structures of practical scale and complexity. This approach is general in that it accommodates static, dynamic, and frequency constraints simultaneously as long as their computational models are available. It can be used in optimizing mass distribution as well as stiffness modifications of practical structures.

Miura, H.↗

Enumerating a Diverse Set of Building Designs Using Discrete Optimization: Preprint

Numerical optimization is a powerful method for identifying energy-efficient building designs. Automating the search process facilitates the evaluation of many more options than is possible with one-off parametric simulation runs. However, input data uncertainties and qualitative aspects of building design work against standard optimization formulations that return a single, so-called optimaldesign. This paper presents a method for harnessing a discrete optimization algorithm to obtain significantly different, economically viable building designs that satisfy an energy efficiency goal. The method is demonstrated using NREL's first-generation building analysis platform, Opt- E-Plus, and two example problems. We discuss the information content of the results, and the computationaleffort required by the algorithm.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

On domains of convergence in optimization problems

Numerical optimization algorithms require the knowledge of an initial set of design variables. Starting from an initial design x(sup 0), improved solutions are obtained by updating the design iteratively in a way prescribed by the particular algorithm used. If the algorithm is successful, convergence is achieved to a local optimal solution. Let A denote the iterative procedure that characterizes a typical optimization algorithm, applied to the problem: Find x belonging to R(sup n) that maximizes f(x) subject to x belonging to Omega contained in R(sup n). We are interested in problems with several local maxima (x(sub j))(sup *), j=1, ..., m, in the feasible design space Omega. In general, convergence of the algorithm A to a specific solution (x(sub j))(sup *) is determined by the choice of initial design x(sup 0). The domain of convergence D(sub j) of A associated with a local maximum (x(sub j))(sup *) is a subset of initial designs x(sup 0) in Omega such that the sequence (x(sup k)), k=0,1,2,... defined by x(sup k+1) = A(x(sup k)), k=0,1,... converges to (x(sub j))(sup *). The set D(sub j) is also called the basin of attraction of (x(sub j))(sup *). Cayley first proposed the problem of finding the basin of attraction for Newton's method in 1897. It has been shown that the basin of attraction for Newton's method exhibits chaotic behavior in problems with polynomial objective. This implies that there may be regions in the feasible design space where arbitrarily close starting points will converge to different local optimal solutions. Furthermore, the boundaries of the domains of convergence may have a very complex, even fractal structure. In this paper we show that even simple structural optimization problems solved using standard gradient based (first order) algorithms exhibit similar features.

Diaz, Alejandro R.↗

The computer for design and optimization

Computerized design using numerical optimization techniques is discussed and guidelines for writing analysis computer codes that can be readily coupled to optimization codes are presented. The following numerical optimization techniques are examined: random search, sequential unconstrained minimization, direct constrained optimization, and one-dimensional search. A number of design applications are considered including high speed airfoil lift maximization, the preliminary design of a wing, design of a planar tower for optimal geometry, and the conceptual design of a tactical fighter aircraft.

Vanderplaats, G. N.↗

Aerodynamic shape optimization using control theory

Aerodynamic shape design has long persisted as a difficult scientific challenge due its highly nonlinear flow physics and daunting geometric complexity. However, with the emergence of Computational Fluid Dynamics (CFD) it has become possible to make accurate predictions of flows which are not dominated by viscous effects. It is thus worthwhile to explore the extension of CFD methods for flow analysis to the treatment of aerodynamic shape design. Two new aerodynamic shape design methods are developed which combine existing CFD technology, optimal control theory, and numerical optimization techniques. Flow analysis methods for the potential flow equation and the Euler equations form the basis of the two respective design methods. In each case, optimal control theory is used to derive the adjoint differential equations, the solution of which provides the necessary gradient information to a numerical optimization method much more efficiently then by conventional finite differencing. Each technique uses a quasi-Newton numerical optimization algorithm to drive an aerodynamic objective function toward a minimum. An analytic grid perturbation method is developed to modify body fitted meshes to accommodate shape changes during the design process. Both Hicks-Henne perturbation functions and B-spline control points are explored as suitable design variables. The new methods prove to be computationally efficient and robust, and can be used for practical airfoil design including geometric and aerodynamic constraints. Objective functions are chosen to allow both inverse design to a target pressure distribution and wave drag minimization. Several design cases are presented for each method illustrating its practicality and efficiency. These include non-lifting and lifting airfoils operating at both subsonic and transonic conditions.

Reuther, James↗

Optimality conditions for the numerical solution of optimization problems with PDE constraints: Theoretical framework and applications to parameter identification and optimal control problems

A theoretical framework for the numerical solution of partial differential equation (PDE) constrained optimization problems is presented in this report. This theoretical framework embodies the fundamental infrastructure required to efficiently implement and solve this class of problems. Detail derivations of the optimality conditions required to accurately solve several parameter identification and optimal control problems are also provided in this report. This will allow the reader to further understand how the theoretical abstraction presented in this report translates to the application.

97 MATHEMATICS AND COMPUTING↗

Efficient, direct compilation of SU(N) operations into SNAP & Displacement gates

We present a function which connects the parameter of a previously published short sequence of selective number-dependent arbitrary phase (SNAP) and displacement gates acting on a qudit encoded into the Fock states of a superconducting cavity, $V_k(\alpha)=D(\alpha)R_\pi(k)D(-2\alpha)R_\pi(k)D(\alpha)$ to the angle of the Givens rotation $G(\theta)$ on levels $|k\rangle,|k+1\rangle$ that sequence approximates, namely $\alpha=\Phi(\theta) = \frac{\theta}{4\sqrt{k+1}}$. Previous publications left the determination of an appropriate $\alpha$ to numerical optimization at compile time. The map $\Phi$ gives us the ability to compile directly any $d$-dimensional unitary into a sequence of SNAP and displacement gates in $O(d^3)$ complex floating point operations with low constant prefactor, avoiding the need for numerical optimization. Numerical studies demonstrate that the infidelity of the generated gate sequence $V_k$ per Givens rotation $G$ scales as approximately $O(\theta^6)$. We find numerically that the error on compiled circuits can be made arbitrarily small by breaking each rotation into $m$$\theta/m$ rotations, with the full $d\times d$ unitary infidelity scaling as approximately $O(m^{-4})$. This represents a significant reduction in the computational effort to compile qudit unitaries either to SNAP and displacement gates or to generate them via direct low-level pulse optimization via optimal control.

Job, Joshua↗

Multiple burn fuel-optimal orbit transfers: Numerical trajectory computation and neighboring optimal feedback guidance

This report describes current work in the numerical computation of multiple burn, fuel-optimal orbit transfers and presents an analysis of the second variation for extremal multiple burn orbital transfers as well as a discussion of a guidance scheme which may be implemented for such transfers. The discussion of numerical computation focuses on the use of multivariate interpolation to aid the computation in the numerical optimization. The second variation analysis includes the development of the conditions for the examination of both fixed and free final time transfers. Evaluations for fixed final time are presented for extremal one, two, and three burn solutions of the first variation. The free final time problem is considered for an extremal two burn solution. In addition, corresponding changes of the second variation formulation over thrust arcs and coast arcs are included. The guidance scheme discussed is an implicit scheme which implements a neighboring optimal feedback guidance strategy to calculate both thrust direction and thrust on-off times.

Chuang, C.-H.↗

Supersonic transport grid generation, validation, and optimization

The ever present demand for reduced flight times has renewed interest in High Speed Civil Transports (HSCT). The need for an HSCT becomes especially apparent when the long distance, over-sea, high growth Pacific rim routes are considered. Crucial to any successful HSCT design are minimal environmental impact and economic viability. Vital is the transport's aerodynamic efficiency, ultimately effecting both the environmental impact and the operating cost. Optimization, including numerical optimization, coupled with the use of computational fluid dynamics (CFD) technology, has and will offer a significant improvement beyond traditional methods.

Aaronson, Philip G.↗

Numerical Airfoil Optimization Using a Reduced Number of Design Coordinates

A method is presented for numerical airfoil optimization whereby a reduced number of design coordinates are used to define the airfoil shape. The approach is to define the airfoil as a linear combination of shapes. These basic shapes may be analytically or numerically defined, allowing the designer to use his insight to propose candidate designs. The design problem becomes one of determining the participation of each such function in defining the optimum airfoil. Examples are presented for two-dimensional airfoil design and are compared with previous results based on a polynomial representation of the airfoil shape. Four existing NACA airfoils are used as basic shapes. Solutions equivalent to previous results are achieved with a factor of more than 3 improvements in efficiency, while superior designs are demonstrated with an efficiency greater than 2 over previous methods. With this shape definition, the optimization process is shown to exploit the simplifying assumptions in the inviscid aerodynamic analysis used here, thus demonstrating the need to use more advanced aerodynamics for airfoil optimization.

Vanderplaats, G. N.↗

Analysis of a theoretically optimized transonic airfoil

Numerical optimization was used in conjunction with an inviscid, full potential equation, transonic flow analysis computer code to design an upper surface contour for a conventional airfoil to improve its supercritical performance. The modified airfoil was tested in a compressible flow wind tunnel. The modified airfoil's performance was evaluated by comparison with test data for the baseline airfoil and for an airfoil developed by optimization of leading edge of the baseline airfoil. While the leading edge modification performed as expected, the upper surface re-design did not produce all of the expected performance improvements. Theoretical solutions computed using a full potential, transonic airfoil code corrected for viscosity were compared to experimental data for the baseline airfoil and the upper surface modification. These correlations showed that the theory predicted the aerodynamics of the baseline airfoil fairly well, but failed to accurately compute drag characteristics for the upper surface modification.

Lores, M. E.↗

Trajectory optimization for an asymmetric launch vehicle

A numerical optimization technique is used to fully automate the trajectory design process for an symmetric configuration of the proposed Advanced Launch System (ALS). The objective of the ALS trajectory design process is the maximization of the vehicle mass when it reaches the desired orbit. The trajectories used were based on a simple shape that could be described by a small set of parameters. The use of a simple trajectory model can significantly reduce the computation time required for trajectory optimization. A predictive simulation was developed to determine the on-orbit mass given an initial vehicle state, wind information, and a set of trajectory parameters. This simulation utilizes an idealized control system to speed computation by increasing the integration time step. The conjugate gradient method is used for the numerical optimization of on-orbit mass. The method requires only the evaluation of the on-orbit mass function using the predictive simulation, and the gradient of the on-orbit mass function with respect to the trajectory parameters. The gradient is approximated with finite differencing. Prelaunch trajectory designs were carried out using the optimization procedure. The predictive simulation is used in flight to redesign the trajectory to account for trajectory deviations produced by off-nominal conditions, e.g., stronger than expected head winds.

Sullivan, Jeanne Marie↗