Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Program 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 145 records · Page 8

User's manual for an aerodynamic optimization scheeme that updates flow variables and design parameters simultaneously

This user's manual is presented for an aerodynamic optimization program that updates flow variables and design parameters simultaneously. The program was developed for solving constrained optimization problems in which the objective function and the constraint function are dependent on the solution of the nonlinear flow equations. The program was tested by applying it to the problem of optimizing propeller designs. Some reference to this particular application is therefore made in the manual. However, the optimization scheme is suitable for application to general aerodynamic design problems. A description of the approach used in the optimization scheme is first presented, followed by a description of the use of the program.

Rizk, Magdi H.↗

Aerodynamic Optimization of the High Speed Civil Transport

The aerodynamic optimization program used for wing and fuselage optimization of the High Speed Civil Transport was modified for utilization of multiple processors on parallel processor computers. The modified version uses multiple processors to simultaneously conduct three-dimensional flow solutions of different wing and fuselage geometries for calculations of the gradient functions and for directional searches to minimize an objective function. Demonstrations have shown the parallel program to be useful for coarse grid optimization, however memory problems for processors on the IBM SP2 were encountered when finer grid sizes were used.

Brawley, Stephen C.↗

Improved Nystrom Integrators

New formulation for Nystrom integrators offers increased precision and speed of computation. Formulation takes advantage of capabilities of modern electronic computers. Independent and dependent variables and various partial and total derivatives expressed via compact tensor notation. In this approach, typical set of constraint equations derived in about 1 day. Solution of constraint equations speeded by SEARCH computer program. Is general-purpose optimization program, which maximizes or minimizes cost function defined by user. Used successfully, to make least-squares fit of about 4,000 equations in 12 unknowns.

Lear, William M.↗

Computer program for parameter optimization

Flexible, large scale digital computer program was designed for the solution of a wide range of multivariable parameter optimization problems. The program has the ability to solve constrained optimization problems involving up to one hundred parameters.

Glatt, C. R.↗

Optimal control computer programs

The solution of the optimal control problem, even with low order dynamical systems, can usually strain the analytical ability of most engineers. The understanding of this subject matter, therefore, would be greatly enhanced if a software package existed that could simulate simple generic problems. Surprisingly, despite a great abundance of commercially available control software, few, if any, address the part of optimal control in its most generic form. The purpose of this paper is, therefore, to present a simple computer program that will perform simulations of optimal control problems that arise from the first necessary condition and the Pontryagin's maximum principle.

Kuo, F.↗

Performance Analysis and Design Synthesis (PADS) computer program. Volume 3: User manual

The two-fold purpose of the Performance Analysis and Design Synthesis (PADS) computer program is discussed. The program can size launch vehicles in conjunction with calculus-of-variations optimal trajectories and can also be used as a general purpose branched trajectory optimization program. For trajectory optimization alone or with sizing, PADS has two trajectory modules. The first trajectory module uses the method of steepest descent. The second module uses the method of quasi-linearization, which requires a starting solution from the first trajectory module.

Source record↗

Minimum impulse transfers to rotate the line of apsides

While an optimal scenario for the general two-impulse transfer between coplanar orbits is not known, there are optimal scenarios for various special cases. We consider in-plane rotations of the line of apsides. Numerical comparisons with a trajectory optimization program support the claim that the optimal deltaV required by two impulses is about half that required by a single impulse, regardless of semi-major axes. We observe that this estimate becomes more conservative with larger angles of rotation and eccentricities, and thus also present a more accurate two-impulse rotation deltaV estimator.

orbit rotation↗

Optimization guide for programs compiled under IBM FORTRAN H (OPT=2)

Guidelines are given to provide the programmer with various techniques for optimizing programs when the FORTRAN IV H compiler is used with OPT=2. Subroutines and programs are described in the appendices along with a timing summary of all the examples given in the manual.

Smith, D. M.↗

Gear optimization

The use of formal numerical optimization methods for the design of gears is investigated. To achieve this, computer codes were developed for the analysis of spur gears and spiral bevel gears. These codes calculate the life, dynamic load, bending strength, surface durability, gear weight and size, and various geometric parameters. It is necessary to calculate all such important responses because they all represent competing requirements in the design process. The codes developed here were written in subroutine form and coupled to the COPES/ADS general purpose optimization program. This code allows the user to define the optimization problem at the time of program execution. Typical design variables include face width, number of teeth and diametral pitch. The user is free to choose any calculated response as the design objective to minimize or maximize and may impose lower and upper bounds on any calculated responses. Typical examples include life maximization with limits on dynamic load, stress, weight, etc. or minimization of weight subject to limits on life, dynamic load, etc. The research codes were written in modular form for easy expansion and so that they could be combined to create a multiple reduction optimization capability in future.

Vanderplaats, G. N.↗

Modeling and Analysis of Power Processing Systems (MAPPS). Volume 2: Appendices

The computer programs and derivations generated in support of the modeling and design optimization program are presented. Programs for the buck regulator, boost regulator, and buck-boost regulator are described. The computer program for the design optimization calculations is presented. Constraints for the boost and buck-boost converter were derived. Derivations of state-space equations and transfer functions are presented. Computer lists for the converters are presented, and the input parameters justified.

Lee, F. C.↗

Optimizing for minimum weight when two different finite element models and analyses are required

The Finite Element Structural Optimization Program's (FESOP) ability to perform minimum weight optimization using two different finite element analyses and models is discussed. FESOP uses the ADS optimizer developed by Dr. Garret Vanderplaats to solve the nonlinear constrained optimization problem. The design optimization problem requires a response spectrum analysis and model to evaluate the stress and displacement constraints. However, the problem needs a frequency analysis and model to calculate the natural frequencies used to evaluate the frequency range constraints. The results of both the successful and unsuccessful approaches used to solve this difficult weight minimization problem are summarized. The results show that no one ADS optimization algorithm worked in all cases. However, the Sequential Convex Programming and Modified Method of Feasible Directions algorithms were the most successful.

Hall, Jeffrey C.↗