Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “adjoint method”

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 127 records · Page 7

Formulation and Implementation of Inflow/Outflow Boundary Conditions to Simulate Propulsive Effects

Boundary conditions appropriate for simulating flow entering or exiting the computational domain to mimic propulsion effects have been implemented in an adaptive Cartesian simulation package. A robust iterative algorithm to control mass flow rate through an outflow boundary surface is presented, along with a formulation to explicitly specify mass flow rate through an inflow boundary surface. The boundary conditions have been applied within a mesh adaptation framework based on the method of adjoint-weighted residuals. This allows for proper adaptive mesh refinement when modeling propulsion systems. The new boundary conditions are demonstrated on several notional propulsion systems operating in flow regimes ranging from low subsonic to hypersonic. The examples show that the prescribed boundary state is more properly imposed as the mesh is refined. The mass-flowrate steering algorithm is shown to be an efficient approach in each example. To demonstrate the boundary conditions on a realistic complex aircraft geometry, two of the new boundary conditions are also applied to a modern low-boom supersonic demonstrator design with multiple flow inlets and outlets.

Boundary↗

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↗

An Adjoint-Based Analysis of the Sampling Footprints of Tall Tower, Aircraft and Potential Future Lidar Observations of CO2

A detailed mechanistic understanding of the sources and sinks of CO2 will be required to reliably predict future CO2 levels and climate. A commonly used technique for deriving information about CO2 exchange with surface reservoirs is to solve an 'inverse problem', where CO2 observations are used with an atmospheric transport model to find the optimal distribution of sources and sinks. Synthesis inversion methods are powerful tools for addressing this question, but the results are disturbingly sensitive to the details of the calculation. Studies done using different atmospheric transport models and combinations of surface station data have produced substantially different distributions of surface fluxes. Adjoint methods are now being developed that will more effectively incorporate diverse datasets in estimates of surface fluxes of CO2. In an adjoint framework, it will be possible to combine CO2 concentration data from longterm surface and aircraft monitoring stations with data from intensive field campaigns and with proposed future satellite observations. We have recently developed an adjoint for the GSFC 3-D Parameterized Chemistry and Transport Model (PCTM). Here, we will present results from a PCTM Adjoint study comparing the sampling footprints of tall tower, aircraft and potential future lidar observations of CO2. The vertical resolution and extent of the profiles and the observation frequency will be considered for several sites in North America.

Andrews, Arlyn↗

Multi-Impulse to Time Optimal Finite Burn Trajectory Conversion

A novel algorithm is presented that provides an improvement over a traditional parameter optimization method when solving time-optimal, finite-burn pseudo-rendezvous spacecraft trajectory problems. A hybrid optimization procedure is described that converts a set of multiple-impulses, representing high- or low-thrust maneuvers, to an exact time-optimal finite-burn trajectory for a thrust limited, constant exhaust velocity spacecraft. The Hybrid Method applies a control law derived from the Euler-Lagrange system of equations within the classical Indirect Method to a modern Direct Method. An iterative adjoint-control transformation and an evolving constraint vector are introduced to solve the optimal control two-point boundary value problem. This method requires no prior knowledge of the solution, which adds simplicity to the trajectory design process and aids automation. Examples are shown for low-thrust apogee raise maneuvers, non-coplanar Earth orbit transfers, and a modified Deep Space 1 low-thrust trajectory. A numerically significant improvement to objective cost is shown across all application problems compared to a traditional solution method, as well as a significant improvement to convergence speed for a select class of problems.

Joshua A Fogel↗

Numerical methods for evaluating the derivatives of eigenvalues and eigenvectors

Two numerical methods are presented for computing the derivatives of eigenvalues and eigenvectors which do not require complete solution of the eigenvalue problem if only a few derivatives are sought. The 'iterative' method may be used to find the first derivative of one or all of the eigenvectors together with the second derivative of their eigenvalues in a self-adjoint system. If the left- and right-hand eigenvectors are known, the first derivative of the eigenvector corresponding to the largest eigenvalue and the second derivative of the largest eigenvalue may be obtained for a nonself-adjoint system. The 'algebraic' method may be used to find all orders of the derivatives, provided they exist, without requiring the left-hand eigenvectors.

Rudisill, C. S.↗

Introduction to Adjoint Models

In this lecture, some fundamentals of adjoint models will be described. This includes a basic derivation of tangent linear and corresponding adjoint models from a parent nonlinear model, the interpretation of adjoint-derived sensitivity fields, a description of methods of automatic differentiation, and the use of adjoint models to solve various optimization problems, including singular vectors. Concluding remarks will attempt to correct common misconceptions about adjoint models and their utilization.

EnKF↗

Adjoint Sensitivity Analysis of Orbital Mechanics: Application to Computations of Observables' Partials with Respect to Harmonics of the Planetary Gravity Fields

An approach is presented to the inversion of gravity fields based on evaluation of partials of observables with respect to gravity harmonics using the solution of adjoint problem of orbital dynamics of the spacecraft. Corresponding adjoint operator is derived directly from the linear operator of the linearized forward problem of orbital dynamics. The resulting adjoint problem is similar to the forward problem and can be solved by the same methods. For given highest degree N of gravity harmonics desired, this method involves integration of N adjoint solutions as compared to integration of N2 partials of the forward solution with respect to gravity harmonics in the conventional approach. Thus, for higher resolution gravity models, this approach becomes increasingly more effective in terms of computer resources as compared to the approach based on the solution of the forward problem of orbital dynamics.

gravity fields↗

Eigenvector derivatives of repeated eigenvalues using singular value decomposition

An explicit formula is obtained for the first-order eigenvector derivative that corresponds to the eigenvector of a repeated eigenvalue, in the case of the nonself-adjoint eigenvalue problem. This method applies to the class of nondefective problems whose first eigenvalue derivatives of the repeated eigenvalues are distinct. A singular-value decomposition approach is used to compute four requisite bases for eigenspaces, as well as to keep track of the dimensions of state variables and the conditioning of the state equations.

Lim, Kyong B.↗

Recent Progress in Parallel Schur Complement Preconditioning for Computational Fluid

We consider preconditioning methods for nonself-adjoint advective-diffusive systems based on a nonoverlapping Schur complement procedure for arbitrary triangulated domains. The triangulation is first partitioned using the METIS multi-level $k$-way partitioning code. This partitioning of the triangulation induces a natural 2x2 partitioning of the demoralization matrix. By considering various inverse approximations of the 2x2 system we have developed a family of robust preconditioning techniques. The performance of these approximations will be discussed and numerous examples shown to illustrate the efficiency of the technique.

Barth, Tim↗

Progress in Parallel Schur Complement Preconditioning for Computational Fluid Dynamics

We consider preconditioning methods for nonself-adjoint advective-diffusive systems based on a non-overlapping Schur complement procedure for arbitrary triangulated domains. The ultimate goal of this research is to develop scalable preconditioning algorithms for fluid flow discretizations on parallel computing architectures. In our implementation of the Schur complement preconditioning technique, the triangulation is first partitioned into a number of subdomains using the METIS multi-level k-way partitioning code. This partitioning induces a natural 2X2 partitioning of the p.d.e. discretization matrix. By considering various inverse approximations of the 2X2 system, we have developed a family of robust preconditioning techniques. A computer code based on these ideas has been developed and tested on the IBM SP2 and the SGI Power Challenge array using MPI message passing protocol. A number of example CFD calculations will be presented to illustrate and assess various Schur complement approximations.

Barth, Timothy J.↗

Application of Exactly Linearized Error Transport Equations to AIAA CFD Prediction Workshops

The computational fluid dynamics (CFD) prediction workshops sponsored by the AIAA have created invaluable opportunities in which to discuss the predictive capabilities of CFD in areas in which it has struggled, e.g., cruise drag, high-lift, and sonic boom pre diction. While there are many factors that contribute to disagreement between simulated and experimental results, such as modeling or discretization error, quantifying the errors contained in a simulation is important for those who make decisions based on the computational results. The linearized error transport equations (ETE) combined with a truncation error estimate is a method to quantify one source of errors. The ETE are implemented with a complex-step method to provide an exact linearization with minimal source code modifications to CFD and multidisciplinary analysis methods. The equivalency of adjoint and linearized ETE functional error correction is demonstrated. Uniformly refined grids from a series of AIAA prediction workshops demonstrate the utility of ETE for multidisciplinary analysis with a connection between estimated discretization error and (resolved or under-resolved) flow features.

Derlaga, Joseph M.↗

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.↗

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↗

Spectral multigrid methods for elliptic equations

An alternative approach which employs multigrid concepts in the iterative solution of spectral equations was examined. Spectral multigrid methods are described for self adjoint elliptic equations with either periodic or Dirichlet boundary conditions. For realistic fluid calculations the relevant boundary conditions are periodic in at least one (angular) coordinate and Dirichlet (or Neumann) in the remaining coordinates. Spectral methods are always effective for flows in strictly rectangular geometries since corners generally introduce singularities into the solution. If the boundary is smooth, then mapping techniques are used to transform the problem into one with a combination of periodic and Dirichlet boundary conditions. It is suggested that spectral multigrid methods in these geometries can be devised by combining the techniques.

Zang, T. A.↗

Extension of the Time-Spectral Approach to Overset Solvers for Arbitrary Motion

Forced periodic flows arise in a broad range of aerodynamic applications such as rotorcraft, turbomachinery, and flapping wing configurations. Standard practice involves solving the unsteady flow equations forward in time until the initial transient exits the domain and a statistically stationary flow is achieved. It is often required to simulate through several periods to remove the initial transient making unsteady design optimization prohibitively expensive for most realistic problems. An effort to reduce the computational cost of these calculations led to the development of the Harmonic Balance method [1, 2] which capitalizes on the periodic nature of the solution. The approach exploits the fact that forced temporally periodic flow, while varying in the time domain, is invariant in the frequency domain. Expanding the temporal variation at each spatial node into a Fourier series transforms the unsteady governing equations into a steady set of equations in integer harmonics that can be tackled with the acceleration techniques afforded to steady-state flow solvers. Other similar approaches, such as the Nonlinear Frequency Domain [3,4,5], Reduced Frequency [6] and Time-Spectral [7, 8, 9] methods, were developed shortly thereafter. Additionally, adjoint-based optimization techniques can be applied [10, 11] as well as frequency-adaptive methods [12, 13, 14] to provide even more flexibility to the method. The Fourier temporal basis functions imply spectral convergence as the number of harmonic modes, and correspondingly number of time samples, N, is increased. Some elect to solve the equations in the frequency domain directly, while others choose to transform the equations back into the time domain to simplify the process of adding this capability to existing solvers, but each harnesses the underlying steady solution in the frequency domain. These temporal projection methods will herein be collectively referred to as Time-Spectral methods. Time-Spectral methods have demonstrated marked success in reducing the computational costs associated with simulating periodic forced flows, but have yet to be fully applied to overset or Cartesian solvers for arbitrary motion with dynamic hole-cutting. Overset and Cartesian grid methodologies are versatile techniques capable of handling complex geometry configurations in practical engineering applications, and the combination of the Time-Spectral approach with this general capability potentially provides an enabling new design and analysis tool. In an arbitrary moving-body scenario for these approaches, a Lagrangian body moves through a fixed Eulerian mesh and mesh points in the Eulerian mesh interior to the solid body are removed (cut or blanked), leaving a hole in the Eulerian mesh. During the dynamic motion some gridpoints in the domain are blanked and do not have a complete set of time-samples preventing a direct implementation of the Time-Spectral method. Murman[6] demonstrated the Time-Spectral approach for a Cartesian solver with a rigid domain motion, wherein the hole cutting remains constant. Similarly, Custer et al. [15, 16] used the NASA overset OVERFLOW solver and limited the amount of relative motion to ensure static hole-cutting and interpolation. Recently, Mavriplis and Mundis[17] demonstrated a qualitative method for applying the Time-Spectral approach to an unstructured overset solver for arbitrary motion. The goal of the current work is to develop a robust and general method for handling arbitrary motion with the Time-Spectral approach within an overset or Cartesian mesh method, while still approaching the spectral convergence rate of the original Time-Spectral approach. The viscous OVERFLOW solver will be augmented with the new Time-Spectral algorithm and the capability of the method for benchmark problems in rotorcraft and turbomachinery will be demonstrated. This abstract begins with a brief synopsis of the Time-Spectral approach for overset grids and provides details of e current approach to allow for arbitrary motion. Model problem results in one and two dimensions are included to demonstrate the viability of the method and the convergence properties. Section IV briefly outlines the implementation into the OVERFLOW solver, and the abstract closes with a description of the benchmark test cases which will be included in the final paper.

Leffell, Joshua Isaac↗

Modal identification of gyroscopic distributed-parameter systems

A new modal identification method for gyroscopic distributed-parameter systems is presented. The method represents an extension of previous work for the class of self-adjoint distributed-parameter systems. The modal identification method is formulated as a variational problem in which stationary values of a functional quotient are sought. The computation of the functional quotient is carried out using a set of admissible functions defined over the spatial domain of the system. As an illustration, the modal identification of a whirling shaft undergoing bending vibration is carried out and the effectiveness of the method is verified.

Norris, Mark A.↗