Differential operators and their adjoints under integral and multiple point boundary conditions
Differential operators and adjoint systems derived from Green function and Hilbert spaces
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.
Differential operators and adjoint systems derived from Green function and Hilbert spaces
Failure analysis of adjoint systems method for determining optimal trajectories
Transport computer program for calculating real and adjoint flux for NASA zero power reactor
Adjoint field in elastic stability problems for nondissipative nonconservative systems
Theory of nonself-adjoint ordinary second order differential operators, discussing solution algorithms
Characterization of eigenvalues of singular nonself-adjoint differential operator of second order
Differential operators and adjoints defined on Hilbert space of n x 1 matrices under integral and multiple point boundary conditions
Trajectory differential equations in state- variable form, presenting compatible difference equation adjoint scheme for trajectory integration
Adjoint system for determining equilibrium stability of elastic continuum subjected to follower type surface tractions
Nonstationary adjoint statistical wind model for flight control systems analysis
Keplerian integrals analogy to integrals of adjoint equations suggested by optimum space navigation trajectories considerations
Analytic approximation for initial adjoint vector for optimal /minimum propellant/ space trajectories
This paper deals with multigrid methods for computational problems that arise in the theory of bifurcation and is restricted to the self adjoint case. The basic problem is to solve for arcs of solutions, a task that is done successfully with an arc length continuation method. Other important issues are, for example, detecting and locating singular points as part of the continuation process, switching branches at bifurcation points, etc. Multigrid methods have been applied to continuation problems. These methods work well at regular points and at limit points, while they may encounter difficulties in the vicinity of bifurcation points. A new continuation method that is very efficient also near bifurcation points is presented here. The other issues mentioned above are also treated very efficiently with appropriate multigrid algorithms. For example, it is shown that limit points and bifurcation points can be solved for directly by a multigrid algorithm. Moreover, the algorithms presented here solve the corresponding problems in just a few work units (about 10 or less), where a work unit is the work involved in one local relaxation on the finest grid.
It is shown that the adjoints of a spline based approximation scheme for delay equations do not converge strongly.
The spline scheme of Banks and Kappel (1979) is used as an aproximation method for calculating optimal feedback gains for control systems governed by functional differential equations. It is shown that the adjoints of the spline-based approximation scheme for delay equations do not converge strongly.
Adjoint sensitivity equations are presented, which can be solved simultaneously (i.e., forward in time) with the dynamics of a nonlinear neural network. These equations provide the foundations for a new methodology which enables the implementation of temporal learning algorithms in a highly efficient manner.
Electronic neural networks made to synthesize initially unknown mathematical models of time-dependent phenomena or to learn temporally evolving patterns by use of algorithms based on adjoint operators. Algorithms less complicated, involve less computation and solve learning equations forward in time possibly simultaneously with equations of evolution of neural network, thereby both increasing computational efficiency and making real-time applications possible.
A model inverse design problem is used to investigate the effect of flow discontinuities on the optimization process. The optimization involves finding the cross-sectional area distribution of a duct that produces velocities that closely match a targeted velocity distribution. Quasi-one-dimensional flow theory is used, and the target is chosen to have a shock wave in its distribution. The objective function which quantifies the difference between the targeted and calculated velocity distributions may become non-smooth due to the interaction between the shock and the discretization of the flowfield. This paper offers two techniques to resolve the resulting problems for the optimization algorithms. The first, shock-fitting, involves careful integration of the objective function through the shock wave. The second, coordinate straining with shock penalty, uses a coordinate transformation to align the calculated shock with the target and then adds a penalty proportional to the square of the distance between the shocks. The techniques are tested using several popular sensitivity and optimization methods, including finite-differences, and direct and adjoint discrete sensitivity methods. Two optimization strategies, Gauss-Newton and sequential quadratic programming (SQP), are used to drive the objective function to a minimum.