Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2014

Towards efficient backward-in-time adjoint computations using data compression techniques

In the context of a posteriori error estimation for nonlinear time-dependent partial differential equations, the state-of-the-practice is to use adjoint approaches which require the solution of a backward-in-time problem defined by a linearization of the forward problem. One of the major obstacles in the practical application of these approaches, we found, is the need to store, or recompute, the forward solution to define the adjoint problem and to evaluate the error representation. Our study considers the use of data compression techniques to approximate forward solutions employed in the backward-in-time integration. The development derives an error representation that accounts for the difference between the standard-approach and the compressed approximation of the forward solution. This representation is algorithmically similar to the standard representation and only requires the computation of the quantity of interest for the forward solution and the data-compressed reconstructed solution (i.e. scalar quantities that can be evaluated as the forward problem is integrated). This approach is then compared with existing techniques, such as checkpointing and time-averaged adjoints. Lastly, we provide numerical results indicating the potential efficiency of our approach on a transient diffusion–reaction equation and on the Navier–Stokes equations. These results demonstrate memory compression ratios up to 450×450× while maintaining reasonable accuracy in the error-estimates.

42 ENGINEERING↗
DOE OSTI2016

An adjoint method for a high-order discretization of deforming domain conservation laws for optimization of flow problems

We report the fully discrete adjoint equations and the corresponding adjoint method are derived for a globally high-order accurate discretization of conservation laws on parametrized, deforming domains. The conservation law on the deforming domain is transformed into one on a fixed reference domain by the introduction of a time-dependent mapping that encapsulates the domain deformation and parametrization, resulting in an Arbitrary Lagrangian–Eulerian form of the governing equations. A high-order discontinuous Galerkin method is used to discretize the transformed equation in space and a high-order diagonally implicit Runge–Kutta scheme is used for the temporal discretization. Quantities of interest that take the form of space–time integrals are discretized in a solver-consistent manner. The corresponding fully discrete adjoint method is used to compute exact gradients of quantities of interest along the manifold of solutions of the fully discrete conservation law. These quantities of interest and their gradients are used in the context of gradient-based PDE-constrained optimization. The adjoint method is used to solve two optimal shape and control problems governed by the isentropic, compressible Navier–Stokes equations. The first optimization problem seeks the energetically optimal trajectory of a 2D airfoil given a required initial and final spatial position. The optimization solver, driven by gradients computed via the adjoint method, reduced the total energy required to complete the specified mission nearly an order of magnitude. The second optimization problem seeks the energetically optimal flapping motion and time-morphed geometry of a 2D airfoil given an equality constraint on the x-directed impulse generated on the airfoil. The optimization solver satisfied the impulse constraint to greater than 8 digits of accuracy and reduced the required energy between a factor of 2 and 10, depending on the value of the impulse constraint, as compared to the nominal configuration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1999

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

Direct computation of magnetic surfaces in Boozer coordinates and coil optimization for quasisymmetry

We propose a new method to compute magnetic surfaces that are parametrized in Boozer coordinates for vacuum magnetic fields. We also propose a measure for quasisymmetry on the computed surfaces and use it to design coils that generate a magnetic field that is quasisymmetric on those surfaces. The rotational transform of the field and complexity measures for the coils are also controlled in the design problem. Using an adjoint approach, we are able to obtain analytic derivatives for this optimization problem, yielding an efficient gradient-based algorithm. Starting from an initial coil set that presents nested magnetic surfaces for a large fraction of the volume, our method converges rapidly to coil systems generating fields with excellent quasisymmetry and low particle losses. In particular for low complexity coils, we are able to significantly improve the performance compared with coils obtained from the standard two-stage approach, e.g. reduce losses of fusion-produced alpha particles born at half-radius from $17.7\,\%$ to $6.6\,\%$ . We also demonstrate 16-coil configurations with alpha loss ${<}1\,\%$ and neoclassical transport magnitude $\epsilon _{\text {eff}}^{3/2}$ less than approximately $5\times 10^{-9}$ .

Physics↗
NASA NTRS1997

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↗
NASA NTRS1981

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

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↗
DOE OSTI2022

Lossy checkpoint compression in full waveform inversion: a case study with ZFPv0.5.5 and the overthrust model

This paper proposes a new method that combines checkpointing methods with error-controlled lossy compression for large-scale high-performance full-waveform inversion (FWI), an inverse problem commonly used in geophysical exploration. This combination can significantly reduce data movement, allowing a reduction in run time as well as peak memory. In the exascale computing era, frequent data transfer (e.g., memory bandwidth, PCIe bandwidth for GPUs, or network) is the performance bottleneck rather than the peak FLOPS of the processing unit. Like many other adjoint-based optimization problems, FWI is costly in terms of the number of floating-point operations, large memory footprint during backpropagation, and data transfer overheads. Past work for adjoint methods has developed checkpointing methods that reduce the peak memory requirements during backpropagation at the cost of additional floating-point computations. Combining this traditional checkpointing with error-controlled lossy compression, we explore the three-way tradeoff between memory, precision, and time to solution. We investigate how approximation errors introduced by lossy compression of the forward solution impact the objective function gradient and final inverted solution. Empirical results from these numerical experiments indicate that high lossy-compression rates (compression factors ranging up to 100) have a relatively minor impact on convergence rates and the quality of the final solution.

58 GEOSCIENCES↗
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.↗
DOE OSTI2016

An optimized treatment for algorithmic differentiation of an important glaciological fixed-point problem

We apply an optimized method to the adjoint generation of a time-evolving land ice model through algorithmic differentiation (AD). The optimization involves a special treatment of the fixed-point iteration required to solve the nonlinear stress balance, which differs from a straightforward application of AD software, and leads to smaller memory requirements and in some cases shorter computation times of the adjoint. The optimization is done via implementation of the algorithm of Christianson (1994) for reverse accumulation of fixed-point problems, with the AD tool OpenAD. For test problems, the optimized adjoint is shown to have far lower memory requirements, potentially enabling larger problem sizes on memory-limited machines. In the case of the land ice model, implementation of the algorithm allows further optimization by having the adjoint model solve a sequence of linear systems with identical (as opposed to varying) matrices, greatly improving performance. Finally, the methods introduced here will be of value to other efforts applying AD tools to ice models, particularly ones which solve a hybrid shallow ice/shallow shelf approximation to the Stokes equations.

58 GEOSCIENCES↗
DOE OSTI2026

Negative fluxes and cell-miss errors in the random ray method

The random ray method is a recently developed stochastic method for solving neutral particle transport problems based on the method of characteristics. Perhaps surprisingly for a characteristics-based method using flat sources, we note that the random ray method can produce negative fluxes which may be numerically troublesome in several situations. These occur most severely in fixed source problems where the source is in a region with a small cross section. Additionally, we briefly discuss another source of bias which can occur in similar situations, namely a ray missing a mesh with a strong source and small cross section, resulting in the entirety of the source being unphysically deposited locally. This paper describes the mechanism by which negative fluxes may occur and several different methods to mitigate their effects. These fixes are tested on an eigenvalue problem, a ‘fusion-like’ shielding problem, and a shielding problem featuring an adjoint calculation. Even when extremely coarse random ray quadratures are used such that 20%–30% of cells are missed during a given iteration, use of the preferred fix technique ensures local flux tally errors remain trivial (below 1%). The preferred fix is now the default option in SCONE and OpenMC.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2015

Negative magnetic eddy diffusivities from the test-field method and multiscale stability theory

The generation of a large-scale magnetic field in the kinematic regime in the absence of an α-effect is investigated by following two different approaches: the test-field method and the multiscale stability theory relying on the homogenization technique. Our computations of the magnetic eddy diffusivity tensor of the parity-invariant flow IV of G. O. Roberts and the modified Taylor–Green flow confirm the findings of previous studies and also explain some of their apparent contradictions. The two flows have large symmetry groups; this is used to considerably simplify the eddy diffusivity tensor. Finally, a new analytic result is presented: upon expressing the eddy diffusivity tensor in terms of solutions to auxiliary problems for the adjoint operator, we derive relations between the magnetic eddy diffusivity tensors that arise for mutually reverse small-scale flows v(x) and −v(x).

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1981

HADY-I, a FORTRAN program for the compressible stability analysis of three-dimensional boundary layers

A computer program HADY-I for calculating the linear incompressible or compressible stability characteristics of the laminar boundary layer on swept and tapered wings is described. The eigenvalue problem and its adjoint arising from the linearized disturbance equations with the appropriate boundary conditions are solved numerically using a combination of Newton-Raphson interative scheme and a variable step size integrator based on the Runge-Kutta-Fehlburh fifth-order formulas. The integrator is used in conjunction with a modified Gram-Schmidt orthonormalization procedure. The computer program HADY-I calculates the growth rates of crossflow or streamwise Tollmien-Schlichting instabilities. It also calculates the group velocities of these disturbances. It is restricted to parallel stability calculations, where the boundary layer (meanflow) is assumed to be parallel. The meanflow solution is an input to the program.

El-Hady, N. M.↗
NASA NTRS1981

Rotating unconstrained modes - A more appropriate dynamic analysis of flexible spinning spacecraft

The objective of the paper is a formation of vehicle modes for gyroscopic space structures through a continuum formulation. This requires examination of adjointness of the associated eigenvalue problems. It is shown that standard conditions of self-adjointness are inadequate even for nongyroscopic structures; modifications required depend on the problem under study. On one hand, in the nongyroscopic case the frequencies appear only quadratically and it is relatively easy to devise the corresponding vehicle modes and the self-adjoint operators. On the other hand in the case of the gyroscopic structures the frequencies appear quadratically as well as linearly; this takes the vehicle mode from a configuration space to a phase space, that is, a Hilbert space in the present case. Four elastic systems of increasing complexity typifying nonspinning and spinning elastic spacecraft are investigated in detail.

Hablani, H. B.↗
NASA NTRS2004

Adjoint Formulation for an Embedded-Boundary Cartesian Method

Many problems in aerodynamic design can be characterized by smooth and convex objective functions. This motivates the use of gradient-based algorithms, particularly for problems with a large number of design variables, to efficiently determine optimal shapes and configurations that maximize aerodynamic performance. Accurate and efficient computation of the gradient, however, remains a challenging task. In optimization problems where the number of design variables dominates the number of objectives and flow- dependent constraints, the cost of gradient computations can be significantly reduced by the use of the adjoint method. The problem of aerodynamic optimization using the adjoint method has been analyzed and validated for both structured and unstructured grids. The method has been applied to design problems governed by the potential, Euler, and Navier-Stokes equations and can be subdivided into the continuous and discrete formulations. Giles and Pierce provide a detailed review of both approaches. Most implementations rely on grid-perturbation or mapping procedures during the gradient computation that explicitly couple changes in the surface shape to the volume grid. The solution of the adjoint equation is usually accomplished using the same scheme that solves the governing flow equations. Examples of such code reuse include multistage Runge-Kutta schemes coupled with multigrid, approximate-factorization, line-implicit Gauss-Seidel, and also preconditioned GMRES. The development of the adjoint method for aerodynamic optimization problems on Cartesian grids has been limited. In contrast to implementations on structured and unstructured grids, Cartesian grid methods decouple the surface discretization from the volume grid. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin e t al. 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.

Nemec, Marian↗