SEARCH · Engineering Papers

Results for “adjoint equation”

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.

SourceResearch connectionFrom yearThrough year

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

At least 37 records · Page 2

All sources NASA NTRS DOE OSTI

NASA NTRS2022

Computing Sensitivities in Evolutionary Systems: A Real-time Reduced Order Modeling Strategy

We present a new methodology for computing sensitivities in evolutionary systems using a model-driven low-rank approximation. To this end, we formulate a variational principle that seeks to minimize the distance between the time derivative of the reduced approximation and sensitivity dynamics. The first order optimality condition of the variational principle leads to a system of closed form evolution equations for an orthonormal basis and corresponding sensitivity coefficients. This approach allows for the computation of sensitivities with respect to a large number of parameters in an accurate and tractable manner by extracting correlations between different sensitivities on the fly. The presented method requires solving forward evolution equations, sidestepping the restrictions imposed by the forward/backward workflow of adjoint sensitivities. For example, the presented method, unlike the adjoint equation, does not impose any input/output load and can be used in applications in which real-time sensitivities are of interest. We demonstrate the utility of the method for three test cases: (1) computing sensitivity with respect to model parameters in the Rössler system, (2) computing sensitivity with respect to an infinite-dimensional forcing parameter in the chaotic Kuramoto--Sivashinsky equation, and (3) computing sensitivity with respect to reaction parameters for species transport in a turbulent reacting flow.

Reduced order model↗

NASA NTRS1984

A solution of Mx(double dot) + Cx(dot) + Kx = 0 applicable to the design of active dampers

A solution is presented for the equations of motion for the damped linear oscillator, Mx(double dot) + Cx(dot) + Kx = 0. The algorithm solves a transformed set of equations in terms of the modal variables of the undamped system and, at the same time, solves the adjoint equation of the transformed problem. The adjoint solution is normalized to give the inverse of the solution matrix of the transformed problem. The normalized inverse is useful in design for direct computation of sensitivity derivatives of damping ratios with respect to damping rates. The algorithm is programmed to reduce storage requirements by a factor of three-fourths compared to standard complex eigenvalue subroutines. A numerical example is included.

Thurston, G. A.↗

NASA NTRS1973

The Dirichlet problem for the two-dimensional Helmholtz equation for an open boundary

Development of a complete theory of the two-dimensional Dirichlet problem for an open boundary. It is shown that the solution of the Dirichlet problem for an open boundary requires the solution of a Fredholm integral equation of the first kind. Although a Fredholm integral equation of the first kind usually has no solution if the kernel is continuous, owing to the logarithmic singularity of the kernel, the equation in this case is converted to a singular integral equation with a Cauchy kernel. It is proven that the homogeneous adjoint equation of the singular integral equation has no nonzero solution. By virtue of this result, and with the aid of an existence theorem known in the theory of singular integral equations, the existence of solutions of the singular integral equation, and then of the unique solution of the Fredholm integral equation of the first kind is proved.

Hayashi, Y.↗

NASA NTRS1977

Comparison of some optimal control methods for the design of turbine blades

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.

Desilva, B. M. E.↗

DOE OSTI2023

Probability of Initiation in Neutron Transport

We discuss the numerical solution of the nonlinear integro-differential equation for the probability of a divergent neutron chain in a stationary system (i.e., the probability of initiation (POI)). We follow the development described in Bell’s classic paper on the stochastic theory of neutron transport. As noted by Bell, the linearized form of this equation resembles the linear adjoint neutron transport equation. A matrix formalism for the discretized steady state (or forward) neutron equation in slab geometry is first developed and is then used to derive the discrete adjoint equation. A main advantage of this discrete development is that the resulting discrete adjoint equation does not depend upon how the multigroup cross sections for the forward problem are obtained. That is, we derive the discrete adjoint directly from the discrete forward equations rather than discretizing directly the adjoint equation. This also guarantees that the discrete adjoint operator is consistent with the inner product used to define the adjoint operator. We discuss three approaches for the numerical solution of the POI equations, and present numerical results on several test problems. The three solution methods are a simple fixed-point iteration, a second approach that is akin to a nonlinear Power iteration, and a third approach which uses a Newton-Krylov nonlinear solver. We also give sufficient conditions to guarantee the existence and uniqueness of nontrivial solutions to our discrete POI equations when the discrete system is supercritical, and that only the trivial solution exists when the discrete system is subcritical. Our approach is modeled after the analysis presented for the continuous POI equations by Mokhtar-Kharroubi and Jarmouni-Idrissi, and by Pazy and Rabinowitz.

42 ENGINEERING↗

NASA NTRS1990

Discrete approximations to optimal trajectories using direct transcription and nonlinear programming

A recently developed method for solving optimal trajectory problems uses a piecewise-polynomial representation of the state and control variables, enforces the equations of motion via a collocation procedure, and thus approximates the original calculus-of-variations problem with a nonlinear-programming problem, which is solved numerically. This paper identifies this method as a direct transcription method and proceeds to investigate the relationship between the original optimal-control problem and the nonlinear-programming problem. The discretized adjoint equation of the collocation method is found to have deficient accuracy, and an alternate scheme which discretizes the equations of motion using an explicit Runge-Kutta parallel-shooting approach is developed. Both methods are applied to finite-thrust spacecraft trajectory problems, including a low-thrust escape spiral, a three-burn rendezvous, and a low-thrust transfer to the moon.

Enright, Paul J.↗

NASA NTRS1997

A Nonlinear Programming Perspective on Sensitivity Calculations for Systems Governed by State Equations

This paper discusses the calculation of sensitivities. or derivatives, for optimization problems involving systems governed by differential equations and other state relations. The subject is examined from the point of view of nonlinear programming, beginning with the analytical structure of the first and second derivatives associated with such problems and the relation of these derivatives to implicit differentiation and equality constrained optimization. We also outline an error analysis of the analytical formulae and compare the results with similar results for finite-difference estimates of derivatives. We then attend to an investigation of the nature of the adjoint method and the adjoint equations and their relation to directions of steepest descent. We illustrate the points discussed with an optimization problem in which the variables are the coefficients in a differential operator.

Lewis, Robert Michael↗

NASA NTRS1976

Optimal reusable-tug and expendable-kickstage trajectories for high-energy planetary missions including correction for nodal precession

Equations are derived by using branched trajectory optimization techniques and the maximum principle to maximize the payload capability of a reusable tug/expendable kickstage vehicle configuration for planetary missions. The two stages and the payload are launched into a low earth orbit by a single space shuttle. The analysis includes correction for precession of the orbit. This correction is done by the tug. The tug propels the payload and the kickstage to an energy beyond earth escape and returns within a specified time to the precessed orbit. After separating from the tug, the kickstage accelerates the payload to the required injection conditions. Planetary injection conditions are specified by the mission energy and a fixed declination and right ascension of the outgoing asymptote. The multipoint boundary value problem resulting from the analysis is solved by a Newton-Raphson iteration technique. Partial derivatives of the boundary conditions are obtained by perturbing the initial conditions one at a time, integrating the trajectory and adjoint equations, and observing the changes in boundary conditions. Maximum payload capability is derived for two typical mission energies. In addition, the variations of several mission and stage parameters are also examined.

Borsody, J.↗

NASA NTRS1972

An Optimization study on a hybrid computer

The maximum principle is applied to minimum-time optimal-control problems, and an optimization algorithm is presented which can be implemented on a hybrid computer. The state and adjoint equations are set up on ASTRAC 2, a high-speed analog computer capable of 1000 differential equation solutions per second. The optimization algorithm is implemented on a PDP-9, an 18-bit, digital computer. The optimization scheme has global and local search phases and uses a vector optimization criterion. Second and third-order bang-bang control systems are studied as examples.

Gonzalez, R. S.↗

NASA NTRS1971

Optimal startup control of a jacketed tubular reactor.

The optimal startup policy of a jacketed tubular reactor, in which a first-order, reversible, exothermic reaction takes place, is presented. A distributed maximum principle is presented for determining weak necessary conditions for optimality of a diffusional distributed parameter system. A numerical technique is developed for practical implementation of the distributed maximum principle. This involves the sequential solution of the state and adjoint equations, in conjunction with a functional gradient technique for iteratively improving the control function.

Hahn, D. R.↗

NASA NTRS1975

A steepest descents method for reentry optimization

A steepest descents optimization program is applied to the problem of a lifting vehicle entering the earth's atmosphere. The program employs penalty functions representing terminal conditions and inflight inequality constraints. During each iteration, it reduces a single performance measure which is the sum of the performance index and the penalty functions. Therefore, only one set of adjoint equations must be integrated per iteration. Values of weight factors, multiplying the penalty functions, are automatically adjusted before each iteration in order that the penalty functions will approach acceptable values. This method is shown to be a form of the classical Lagrange multiplier methods.

Andrus, J. F.↗

NASA NTRS1995

Supersonic wing and wing-body shape optimization using an adjoint formulation

This paper describes the implementation of optimization techniques based on control theory for wing and wing-body design of supersonic configurations. The work represents an extension of our earlier research in which control theory is used to devise a design procedure that significantly reduces the computational cost by employing an adjoint equation. In previous studies it was shown that control theory could be used to~eviseransonic design methods for airfoils and wings in which the shape and the surrounding body-fitted mesh are both generated analytically, and the control is the mapping function. The method has also been implemented for both transonic potential flows and transonic flows governed by the Euler equations using an alternative formulation which employs numerically generated grids, so that it can treat more general configurations. Here results are presented for three-dimensional design cases subject to supersonic flows governed by the Euler equation.

Reuther, James↗

NASA NTRS1996

Variational Methods in Sensitivity Analysis and Optimization for Aerodynamic Applications

Variational methods (VM) sensitivity analysis, which is the continuous alternative to the discrete sensitivity analysis, is employed to derive the costate (adjoint) equations, the transversality conditions, and the functional sensitivity derivatives. In the derivation of the sensitivity equations, the variational methods use the generalized calculus of variations, in which the variable boundary is considered as the design function. The converged solution of the state equations together with the converged solution of the costate equations are integrated along the domain boundary to uniquely determine the functional sensitivity derivatives with respect to the design function. The determination of the sensitivity derivatives of the performance index or functional entails the coupled solutions of the state and costate equations. As the stable and converged numerical solution of the costate equations with their boundary conditions are a priori unknown, numerical stability analysis is performed on both the state and costate equations. Thereafter, based on the amplification factors obtained by solving the generalized eigenvalue equations, the stability behavior of the costate equations is discussed and compared with the state (Euler) equations. The stability analysis of the costate equations suggests that the converged and stable solution of the costate equation is possible only if the computational domain of the costate equations is transformed to take into account the reverse flow nature of the costate equations. The application of the variational methods to aerodynamic shape optimization problems is demonstrated for internal flow problems at supersonic Mach number range. The study shows, that while maintaining the accuracy of the functional sensitivity derivatives within the reasonable range for engineering prediction purposes, the variational methods show a substantial gain in computational efficiency, i.e., computer time and memory, when compared with the finite difference sensitivity analysis.

Ibrahim, A. H.↗

NASA NTRS1997

Aerodynamic Design on Unstructured Grids for Turbulent Flows

An aerodynamic design algorithm for turbulent flows using unstructured grids is described. The current approach uses adjoint (costate) variables for obtaining derivatives of the cost function. The solution of the adjoint equations is obtained using an implicit formulation in which the turbulence model is fully coupled with the flow equations when solving for the costate variables. The accuracy of the derivatives is demonstrated by comparison with finite-difference gradients and a few example computations are shown. In addition, a user interface is described which significantly reduces the time required for setting up the design problems. Recommendations on directions of further research into the Navier Stokes design process are made.

Anderson, W. Kyle↗

NASA NTRS2012

Unsteady Adjoint Approach for Design Optimization of Flapping Airfoils

This paper describes the work for optimizing the propulsive efficiency of flapping airfoils, i.e., improving the thrust under constraining aerodynamic work during the flapping flights by changing their shape and trajectory of motion with the unsteady discrete adjoint approach. For unsteady problems, it is essential to properly resolving time scales of motion under consideration and it must be compatible with the objective sought after. We include both the instantaneous and time-averaged (periodic) formulations in this study. For the design optimization with shape parameters or motion parameters, the time-averaged objective function is found to be more useful, while the instantaneous one is more suitable for flow control. The instantaneous objective function is operationally straightforward. On the other hand, the time-averaged objective function requires additional steps in the adjoint approach; the unsteady discrete adjoint equations for a periodic flow must be reformulated and the corresponding system of equations solved iteratively. We compare the design results from shape and trajectory optimizations and investigate the physical relevance of design variables to the flapping motion at on- and off-design conditions.

Lee, Byung Joon↗

NASA NTRS1995

Viscous aerodynamic design using the adjoint variable approach

The use of classical optimal control methods, in particular variational methods, to solve the airfoil optimization problem, by deriving a set of adjoint (costate) equations and boundary conditions has already been done for inviscid (potential and Euler flows) and two dimensional, steady state, incompressible flow governed by the Navier-Stokes equations. The interior and boundary terms of the volume integral have been derived (in this work) for the steady Navier-Stokes equations in three dimensions for a viscous, compressible heat conducting fluid. This can be used to derive the adjoint equations and numerical boundary conditions for general classes of problems and hence paves the way for a solution to the aerodynamic optimization problem for compressible viscous flows. The next steps to the realization of that goal are projected as below. The usual square integral pressure functional as an objective function is being replaced by a more realistic drag functional subject to a lift constraint. The feasibility of attempting the more difficult time dependent problem is being investigated. It remains to get the full system of adjoint equations and boundary conditions with the new functional. The state and adjoint equations must be discretized and coded. An appropriate optimization program must be used (steepest descents seems inadequate) and various known airfoil shapes should be recovered in test cases of the computer program.

DeRise, George↗

NASA NTRS1992

Neural network training by integration of adjoint systems of equations forward in time

A method and apparatus for supervised neural learning of time dependent trajectories exploits the concepts of adjoint operators to enable computation of the gradient of an objective functional with respect to the various parameters of the network architecture in a highly efficient manner. Specifically, it combines the advantage of dramatic reductions in computational complexity inherent in adjoint methods with the ability to solve two adjoint systems of equations together forward in time. Not only is a large amount of computation and storage saved, but the handling of real-time applications becomes also possible. The invention has been applied it to two examples of representative complexity which have recently been analyzed in the open literature and demonstrated that a circular trajectory can be learned in approximately 200 iterations compared to the 12000 reported in the literature. A figure eight trajectory was achieved in under 500 iterations compared to 20000 previously required. The trajectories computed using our new method are much closer to the target trajectories than was reported in previous studies.

Toomarian, Nikzad↗

NASA NTRS1999

Neural Network Training by Integration of Adjoint Systems of Equations Forward in Time

A method and apparatus for supervised neural learning of time dependent trajectories exploits the concepts of adjoint operators to enable computation of the gradient of an objective functional with respect to the various parameters of the network architecture in a highly efficient manner. Specifically. it combines the advantage of dramatic reductions in computational complexity inherent in adjoint methods with the ability to solve two adjoint systems of equations together forward in time. Not only is a large amount of computation and storage saved. but the handling of real-time applications becomes also possible. The invention has been applied it to two examples of representative complexity which have recently been analyzed in the open literature and demonstrated that a circular trajectory can be learned in approximately 200 iterations compared to the 12000 reported in the literature. A figure eight trajectory was achieved in under 500 iterations compared to 20000 previously required. Tbc trajectories computed using our new method are much closer to the target trajectories than was reported in previous studies.

Toomarian, Nikzad↗