Search NASA⌕ Search

SEARCH · Search NASA

Results for “adjoint problem”

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 37 records · Page 2

Three-Dimensional Turbulent RANS Adjoint-Based Error Correction

Engineering problems commonly require functional outputs of computational fluid dynamics (CFD) simulations with specified accuracy. These simulations are performed with limited computational resources. Computable error estimates offer the possibility of quantifying accuracy on a given mesh and predicting a fine grid functional on a coarser mesh. Such an estimate can be computed by solving the flow equations and the associated adjoint problem for the functional of interest. An adjoint-based error correction procedure is demonstrated for transonic inviscid and subsonic laminar and turbulent flow. A mesh adaptation procedure is formulated to target uncertainty in the corrected functional and terminate when error remaining in the calculation is less than a user-specified error tolerance. This adaptation scheme is shown to yield anisotropic meshes with corrected functionals that are more accurate for a given number of grid points then isotropic adapted and uniformly refined grids.

Park, Michael A.↗

A New Recycling Method to Generate Turbulent Inflow Profiles

The accuracy of the scale-resolving simulations for practical geometries strongly depends on the inflow boundary conditions. Imposing experimentally observed turbulent inflow profiles for the numerical simulations is a major challenge. Existing methods available in the literature assume self-similar behavior, which is not true for most of the experiments. In the present work, we formulate the turbulent inflow profile generation technique as an optimization problem. An adjoint technique is exploited to evaluate the sensitivities of multiple input parameters for the present problem. The present formulation is then tested to generate a laminar boundary layer profile, turbulent boundary layer profile, and turbulent jet profile.

Garai, Anirban↗

Adjoint-Based Diagnostics in Atmospheric Data Assimilation

With the adjoint of a data assimilation system, the impact of any or all assimilated observations on measures of forecast or analysis skill can be estimated accurately and efficiently. The approach is especially well-suited for assessing the impact of hyper-spectral satellite instruments on numerical weather forecasts because it easily allows aggregation of results in terms of individual data types, channels or locations, all computed simultaneously based on a single pass of the Adjoint- system. This talk 'provides a general overview of the use of Adjoint-based diagnostic tools in data assimilation. We will focus on the theoretical basis and practical implementation of these tools, as well as their application to specific problems. Adjoint-based Impact calculations will be compared with results from standard observing system experiments (OSEs) and their application to related problems, such as the calibration of Observing System Simulation Experiments (OSSEs) will be discussed.

Gelaro, Ronald↗

Adjoint Algorithm for CAD-Based Shape Optimization Using a Cartesian Method

Adjoint solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape optimization. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (geometric parameters that control the shape). More recently, emerging adjoint applications focus on the analysis problem, where the adjoint solution is used to drive mesh adaptation, as well as to provide estimates of functional error bounds and corrections. The attractive feature of this approach is that the mesh-adaptation procedure targets a specific functional, thereby localizing the mesh refinement and reducing computational cost. Our focus is on the development of adjoint-based optimization techniques for a Cartesian method with embedded boundaries.12 In contrast t o implementations on structured and unstructured grids, Cartesian methods decouple the surface discretization from the volume mesh. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin et developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation. Central to automated shape optimization algorithms is the issue of geometry modeling and control. The need to optimize complex, "real-life" geometry provides a strong incentive for the use of parametric-CAD systems within the optimization procedure. In previous work, we presented an effective optimization framework that incorporates a direct-CAD interface. In this work, we enhance the capabilities of this framework with efficient gradient computations using the discrete adjoint method. We present details of the adjoint numerical implementation, which reuses the domain decomposition, multigrid, and time-marching schemes of the flow solver. Furthermore, we explain and demonstrate the use of CAD in conjunction with the Cartesian adjoint approach. The final paper will contain a number of complex geometry, industrially relevant examples with many design variables to demonstrate the effectiveness of the adjoint method on Cartesian meshes.

Nemec, Marian↗

Numerical algorithms for finite element computations on arrays of microprocessors

The development of a multicolored successive over relaxation (SOR) program for the finite element machine is discussed. The multicolored SOR method uses a generalization of the classical Red/Black grid point ordering for the SOR method. These multicolored orderings have the advantage of allowing the SOR method to be implemented as a Jacobi method, which is ideal for arrays of processors, but still enjoy the greater rate of convergence of the SOR method. The program solves a general second order self adjoint elliptic problem on a square region with Dirichlet boundary conditions, discretized by quadratic elements on triangular regions. For this general problem and discretization, six colors are necessary for the multicolored method to operate efficiently. The specific problem that was solved using the six color program was Poisson's equation; for Poisson's equation, three colors are necessary but six may be used. In general, the number of colors needed is a function of the differential equation, the region and boundary conditions, and the particular finite element used for the discretization.

Ortega, J. M.↗

Iterative spectral methods and spectral solutions to compressible flows

A spectral multigrid scheme is described which can solve pseudospectral discretizations of self-adjoint elliptic problems in O(N log N) operations. An iterative technique for efficiently implementing semi-implicit time-stepping for pseudospectral discretizations of Navier-Stokes equations is discussed. This approach can handle variable coefficient terms in an effective manner. Pseudospectral solutions of compressible flow problems are presented. These include one dimensional problems and two dimensional Euler solutions. Results are given both for shock-capturing approaches and for shock-fitting ones.

Hussaini, M. Y.↗

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

Trajectory Optimization Using Adjoint Method and Chebyshev Polynomial Approximation for Minimizing Fuel Consumption During Climb

This paper describes two methods of trajectory optimization to obtain an optimal trajectory of minimum-fuel- to-climb for an aircraft. The first method is based on the adjoint method, and the second method is based on a direct trajectory optimization method using a Chebyshev polynomial approximation and cubic spine approximation. The approximate optimal trajectory will be compared with the adjoint-based optimal trajectory which is considered as the true optimal solution of the trajectory optimization problem. The adjoint-based optimization problem leads to a singular optimal control solution which results in a bang-singular-bang optimal control.

Chebyshev Polynomial↗

Adjoint operator approach to shape design for internal incompressible flows

The problem of determining the profile of a channel or duct that provides the maximum static pressure rise is solved. Incompressible, laminar flow governed by the steady state Navier-Stokes equations is assumed. Recent advances in computational resources and algorithms have made it possible to solve the direct problem of determining such a flow through a body of known geometry. It is possible to obtain a set of adjoint equations, the solution to which permits the calculation of the direction and relative magnitude of change in the diffuser profile that leads to a higher pressure rise. The solution to the adjoint problem can be shown to represent an artificially constructed flow. This interpretation provides a means to construct numerical solutions to the adjoint equations that do not compromise the fully viscous nature of the problem. The algorithmic and computational aspects of solving the adjoint equations are addressed. The form of these set of equations is similar but not identical to the Navier-Stokes equations. In particular some issues related to boundary conditions and stability are discussed.

Cabuk, H.↗

Inversion of Gravity Fields From the Spacecraft Orbital Data Using an Adjoint Operator Approach

In perturbation approximation, the forward problem of orbital dynamics (equations with initial conditions) is linear with respect to variations of coordinates and/or velocities of the spacecraft and to corresponding variations of the gravity field in the models used. The linear operator adjoint to the linear operator of such forward problem turns out to be instrumental in inversion of differences between observed and predicted coordinates/velocities in terms of the updates of harmonics in the initial gravity field model. Based on this approach, the solution of resulting adjoint problem of orbital dynamics can be used to directly evaluate the matrix of partial derivatives of observable differences with respect to the gravity field harmonics. General discussion of the adjoint problem of orbital dynamics is given and an example of a mathematical formalism for the practical retrieval algorithm is presented.

Ustinov, E. A.↗

Admitting the Inadmissible: Adjoint Formulation for Incomplete Cost Functionals in Aerodynamic Optimization

We derive the adjoint equations for problems in aerodynamic optimization which are improperly considered as "inadmissible." For example, a cost functional which depends on the density, rather than on the pressure, is considered "inadmissible" for an optimization problem governed by the Euler equations. We show that for such problems additional terms should be included in the Lagrangian functional when deriving the adjoint equations. These terms are obtained from the restriction of the interior PDE to the control surface. Demonstrations of the explicit derivation of the adjoint equations for "inadmissible" cost functionals are given for the potential, Euler, and Navier-Stokes equations.

Arian, Eyal↗

An adaptive, multi-level method for elliptic boundary value problems

Subroutine PLTMG is a FORTRAN program for solving self-adjoint elliptic boundary value problems in general regions of R-squared. It is based on a piecewise linear triangle finite element method, an adaptive grid refinement procedure, and a multi-level iterative method to solve the resulting sets of linear equations. This paper describes the method and presents some numerical results and comparisons.

Bank, R. E.↗

Direct Linearization and Adjoint Approaches to Evaluation of Atmospheric Weighting Functions and Surface Partial Derivatives: General Principles, Synergy and Areas of Application

This slide presentation reviews the observable radiances as functions of atmospheric parameters and of surface parameters; the mathematics of atmospheric weighting functions (WFs) and surface partial derivatives (PDs) are presented; and the equation of the forward radiative transfer (RT) problem is presented. For non-scattering atmospheres this can be done analytically, and all WFs and PDs can be computed analytically using the direct linearization approach. For scattering atmospheres, in general case, the solution of the forward RT problem can be obtained only numerically, but we need only two numerical solutions: one of the forward RT problem and one of the adjoint RT problem to compute all WFs and PDs we can think of. In this presentation we discuss applications of both the linearization and adjoint approaches

remote sensing↗

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