SEARCH · Engineering Papers
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.
Computer program fits linear-factored form transfer function to given frequency-response data. Program is based on conjugate-gradient search procedure that minimizes error between given frequency-response data and frequency response of transfer function that is supplied by user.
A frequency domain parameter optimization technique was used to design active pogo suppression controls for the space shuttle. The technique uses a conjugate gradient search procedure and is well suited for designing low-order controllers for higher order systems. The shuttle model was a two-pump and six-structural-mode linear model representing a worst-case condition. A promising feedback controller structure was found to be a lead-lag design.
Lining design procedures generally ignore the effects of discontinuous impedance changes on reflection and modal redistribution of incident energy. The present study involves identification of the mechanisms of optimal suppression by segmented liners, including impedance discontinuity effects. The mathematical model involves rectangular ducts in the absence of mean flow. Segmented acoustic fields are represented by duct eigenfunction expansions, and mode matching is used to ensure continuity of the total field. Extensive parameter studies were used to identify attenuation mechanisms and to define preliminary liner configurations. These are used as starting values in conjugate-gradient optimization studies. Optimal segmented liners are presented and it is shown that, if the sound source is sufficiently well-defined, conventional infinite duct optimum attenuation rates can be improved upon by taking advantage of wall impedance discontinuities. Finally, follow-on work which will involve experimental verification and extension to the case with mean flow in the duct is described.
This paper, assuming steady wind and zero sideslip, presents a discrete-time mathematical model to obtain a control law and three-dimensional flight path to guide an aircraft in a given time from a given initial state (position, velocity and heading) to a prescribed final state subject to the constraints on airspeed acceleration, and pitch and bank angles of the aircraft. For ease in implementing the control law, the control inputs are assumed to be delayed and are applied in a sequential fashion. The guidance problem is formulated as a discrete nonlinear optimal control problem with time delays in dynamics and a cost functional of Bolza form. With a quadratic penalty function to handle terminal constraints on velocity and heading, a solution technique to the control problem based on conjugate gradient algorithm is investigated. Numerical examples are presented to illustrate the applicability of this approach to solution of a terminal area guidance problem in an automated air traffic control environment.
Two computational methods to determine an open loop time optimal control sequence for a simple single spool turbojet engine are described by a set of nonlinear differential equations. Both methods are modifications of widely accepted algorithms which can solve fixed time unconstrained optimal control problems with a free right end. Constrained problems to be considered have fixed right ends and free time. Dynamic programming is defined on a standard problem and it yields a successive approximation solution to the time optimal problem of interest. A feedback control law is obtained and it is then used to determine the corresponding open loop control sequence. The Fletcher-Reeves conjugate gradient method has been selected for adaptation to solve a nonlinear optimal control problem with state variable and control constraints.
Various alternatives to linear quadratic design methods for jet engine control systems are discussed. The main alternatives are classified into two broad categories: nonlinear global mathematical programming methods and linear local multivariable frequency domain methods. Specific studies within these categories include model reduction, the eigenvalue locus method, the inverse Nyquist method, polynomial design, dynamic programming, and conjugate gradient approaches.
A study was conducted to assess the feasibility of performing computerized wing design by numerical optimization. The design program combined a full potential, inviscid aerodynamics code with a conjugate gradient optimization algorithm. Three design problems were selected to demonstrate the design technique. The first involved modifying the upper surface of the inboard 50% of a swept wing to reduce the shock drag subject to a constraint on wing volume. The second involved modifying the entire upper surface of the same swept wing (except the tip section) to increase the lift-drag ratio subject to constraints on wing volume and lift coefficient. The final problem involved modifying the inboard 50% of a low-speed wing to achieve good stall progression. Results from the three cases indicate that the technique is sufficiently accurate to permit substantial improvement in the design objectives.
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.
The NASCAP (NASA Charging Analyzer Program) code simulates the charging process for a complex object in either tenuous plasma or ground test environment. Detailed specifications needed to run the code are presented. The object definition section, OBJDEF, allows the test object to be easily defined in the cubic mesh. The test object is composed of conducting sections which may be wholly or partially covered with thin dielectric coatings. The potential section, POTENT, obtains the electrostatic potential in the space surrounding the object. It uses the conjugate gradient method to solve the finite element formulation of Poisson's equation. The CHARGE section of NASCAP treats charge redistribution among the surface cells of the object as well as charging through radiation bombardment. NASCAP has facilities for extensive graphical output, including several types of object display plots, potential contour plots, space charge density contour plots, current density plots, and particle trajectory plots.
The results of several independent studies are presented. The general question is considered of whether a wetting liquid always rises higher in a small capillary tube than in a larger one, when both are dipped vertically into an infinite reservoir. An analytical investigation is initiated to determine the qualitative behavior of the family of solutions of the equilibrium capillary free-surface equation that correspond to rotationally symmetric pendent liquid drops and the relationship of these solutions to the singular solution, which corresponds to an infinite spike of liquid extending downward to infinity. The block successive overrelaxation-Newton method and the generalized conjugate gradient method are investigated for solving the capillary equation on a uniform square mesh in a square domain, including the case for which the solution is unbounded at the corners. Capillary surfaces are calculated on the ellipse, on a circle with reentrant notches, and on other irregularly shaped domains using JASON, a general purpose program for solving nonlinear elliptic equations on a nonuniform quadrilaterial mesh. Analytical estimates for the nonexistence of solutions of the equilibrium capillary free-surface equation on the ellipse in zero gravity are evaluated.
This paper attempts a comparative study of some numerical methods for the optimal control design of turbine blades whose vibration characteristics are approximated by Timoshenko beam idealizations with shear and incorporating simple boundary conditions. The blade was synthesized using the following methods: (1) conjugate gradient minimization of the system Hamiltonian in function space incorporating penalty function transformations, (2) projection operator methods in a function space which includes the frequencies of vibration and the control function, (3) epsilon-technique penalty function transformation resulting in a highly nonlinear programming problem, (4) finite difference discretization of the state equations again resulting in a nonlinear program, (5) second variation methods with complex state differential equations to include damping effects resulting in systems of inhomogeneous matrix Riccatti equations some of which are stiff, (6) quasi-linear methods based on iterative linearization of the state and adjoint equation. The paper includes a discussion of some substantial computational difficulties encountered in the implementation of these techniques together with a resume of work presently in progress using a differential dynamic programming approach.
A modified lattice-statics method to calculate the atomic displacements associated with a screw dislocation is outlined. The model incorporates an anharmonic region wherein the forces are derived from a pair potential. Appropriate energy and force expressions are derived. The modifications necessary for the implementation of the conjugate-gradient function minimization method are also derived.
A computer program developed for the automated design of low speed airfoils utilizes a generalized Joukowski method for aerodynamic analysis coupled with a conjugate gradient, penalty function, numerical optimization algorithm to give an efficient calculation technique for use with minicomputers. The program designs airfoils with a prescribed pressure distribution as well as those which minimize or maximize some aerodynamic force coefficient. At present the method is restricted to inviscid, incompressible flow. A typical design problem will execute in 4.5 hr on an HP 9830 minicomputer.
The formulation basis for establishing the static or dynamic equilibrium configurations of finite element models of structures which may behave in the nonlinear range are provided. With both geometric and time independent material nonlinearities included, the development is restricted to simple one and two dimensional finite elements which are regarded as being the basic elements for modeling full aircraft-like structures under crash conditions. Representations of a rigid link and an impenetrable contact plane are added to the deformation model so that any number of nodes of the finite element model may be connected by a rigid link or may contact the plane. Equilibrium configurations are derived as the stationary conditions of a potential function of the generalized nodal variables of the model. Minimization of the nonlinear potential function is achieved by using the best current variable metric update formula for use in unconstrained minimization. Powell's conjugate gradient algorithm, which offers very low storage requirements at some slight increase in the total number of calculations, is the other alternative algorithm to be used for extremely large scale problems.
Unlike the Newton-Raphson method, quasi-Newton methods by virture of the updates and step length control procedures are globally convergent and hence better suited for the solution of nonlinear problems of structural analysis and synthesis. Extension of quasi-Newton algorithms to large scale problems has led to the development of sparse update algorithms and to economical strategies for evaluating sparse Hessians. Ill-conditioning problems have led to the development of self-scaled variable metric and conjugate gradient algorithms, as well as the use of the singular perturbation theory. This paper emphasizes the effectiveness of such quasi-Newton algorithms for nonlinear structural analysis and synthesis.
It is noted that the application of finite element or finite difference techniques to the solution of transient heat transfer problems in structures often results in a stiff system of ordinary differential equations. Such systems are usually handled most efficiently by implicit integration techniques which require the solution of large and sparse systems of algebraic equations. The assembly and solution of these systems using the incomplete Cholesky conjugate gradient algorithm is examined. Several examples are used to demonstrate the advantage of the algorithm over other techniques.
Algorithms for assembling in parallel the sparse system of linear equations that result from finite difference or finite element discretizations of elliptic partial differential equations, such as those that arise in structural engineering are developed. Parallel linear stationary iterative algorithms and parallel preconditioned conjugate gradient algorithms are developed for solving these systems. In addition, a model for comparing parallel algorithms on array architectures is developed and results of this model for the algorithms are given.
The problem of preconditioning the pseudospectral Chebyshev approximation of an elliptic operator is considered. The numerical sensitiveness to variations of the coefficients of the operator are investigated for two classes of preconditioning matrices: one arising from finite differences, the other from finite elements. The preconditioned system is solved by a conjugate gradient type method, and by a DuFort-Frankel method with dynamical parameters. The methods are compared on some test problems with the Richardson method and with the minimal residual Richardson method.