Search NASA⌕ Search

SEARCH · Search NASA

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 109 records · Page 6

Derivatives of buckling loads and vibration frequencies with respect to stiffness and initial strain parameters

A uniform variational approach to sensitivity analysis of vibration frequencies and bifurcation loads of nonlinear structures is developed. Two methods of calculating the sensitivities of bifurcation buckling loads and vibration frequencies of nonlinear structures, with respect to stiffness and initial strain parameters, are presented. A direct method requires calculation of derivatives of the prebuckling state with respect to these parameters. An adjoint method bypasses the need for these derivatives by using instead the strain field associated with the second-order postbuckling state. An operator notation is used and the derivation is based on the principle of virtual work. The derivative computations are easily implemented in structural analysis programs. This is demonstrated by examples using a general purpose, finite element program and a shell-of-revolution program.

Haftka, Raphael T.↗

Development of a Multiphase Adjoint Capability in OpenFOAM

Thermal hydraulic predictions of flow regimes within nuclear reactor cores require significant computational resources and accuracy to ensure that the core design does not violate the thermal limits of materials. Multiphase computational fluid dynamics (CFD) has become a valuable computational capability for predicting flow characteristics as they relate to applications such as nuclear reactor safety and mixing phenomena around spacer grids within fuel assemblies. Multiphase CFD requires closure relationships for both the effects of turbulence as well as the transfer of mass, momentum, and energy between phases. Understanding the sensitivity of the parameters used in closure relationships is important for improving accuracy, but performing rigorous sensitivity analysis is computationally expensive. Adjoint mathematics have been utilized for reactor physics and fluid dynamics applications with respect to verification, sensitivity analysis, adaptive mesh refinement, and optimization. The usage of adjoint methods to predict the sensitivities of a variety of closure relationship parameters within a given problem has been shown to return sensitivity responses with significantly fewer computations than normal 'large-scale' methods. As the complexity of multiphase CFD methods increases, the demand for accurate verification tools and improvements in computational efficiency also increases, making the development of adjoint capabilities an attractive option. Closure relationships that describe interphase momentum physics in multiphase CFD modelling rely heavily on prescribed constants determined from experimental data. Due to the computational efficiency of an adjoint approach, the time to derive these closure relationships could be dramatically reduced, and data assimilation techniques could be used to return probability density functions of closure models derived using experimental data. This work develops a multiphase adjoint capability for the Eulerian-Eulerian two field, two phase equations. Specifically, the adjoint capability has been developed for the sub-cooled nucleate boiling solver boilEulerFoam developed by Dr. Nam Dinh of NC State University within the open-source CFD library OpenFOAM.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Application of Adjoint Methodology in Various Aspects of Sonic Boom Design

One of the advances in computational design has been the development of adjoint methods allowing efficient calculation of sensitivities in gradient-based shape optimization. This paper discusses two new applications of adjoint methodology that have been developed to aid in sonic boom mitigation exercises. In the first, equivalent area targets are generated using adjoint sensitivities of selected boom metrics. These targets may then be used to drive the vehicle shape during optimization. The second application is the computation of adjoint sensitivities of boom metrics on the ground with respect to parameters such as flight conditions, propagation sampling rate, and selected inputs to the propagation algorithms. These sensitivities enable the designer to make more informed selections of flight conditions at which the chosen cost functionals are less sensitive.

Rallabhandi, Sriram K.↗

An autoencoder compression approach for accelerating large-scale inverse problems

Abstract Partial differential equation (PDE)-constrained inverse problems are some of the most challenging and computationally demanding problems in computational science today. Fine meshes required to accurately compute the PDE solution introduce an enormous number of parameters and require large-scale computing resources such as more processors and more memory to solve such systems in a reasonable time. For inverse problems constrained by time-dependent PDEs, the adjoint method often employed to compute gradients and higher order derivatives efficiently requires solving a time-reversed, so-called adjoint PDE that depends on the forward PDE solution at each timestep. This necessitates the storage of a high-dimensional forward solution vector at every timestep. Such a procedure quickly exhausts the available memory resources. Several approaches that trade additional computation for reduced memory footprint have been proposed to mitigate the memory bottleneck, including checkpointing and compression strategies. In this work, we propose a close-to-ideal scalable compression approach using autoencoders to eliminate the need for checkpointing and substantial memory storage, thereby reducing the time-to-solution and memory requirements. We compare our approach with checkpointing and an off-the-shelf compression approach on an earth-scale ill-posed seismic inverse problem. The results verify the expected close-to-ideal speedup for the gradient and Hessian-vector product using the proposed autoencoder compression approach. To highlight the usefulness of the proposed approach, we combine the autoencoder compression with the data-informed active subspace (DIAS) prior showing how the DIAS method can be affordably extended to large-scale problems without the need for checkpointing and large memory.

Mathematics↗

Pillars of the Mantle: Imaging the Interior of the Earth with Adjoint Tomography. In: PEARC17 Proceedings of the Practice and Experience in Advanced Research Computing 2017 on Sustainability, Success and Impact, Article No. 75

In this work, we investigate global seismic tomographic models obtained by spectral-element simulations of seismic wave propagation and adjoint methods. Global crustal and mantle models are obtained based on an iterative conjugate-gradient type of optimization scheme. Forward and adjoint seismic wave propagation simulations, which result in synthetic seismic data to make measurements and data sensitivity kernels to compute gradient for model updates, respectively, are performed by the SPECFEM3D_GLOBE package [1] [2] at the Oak Ridge Leadership Computing Facility (OLCF) to study the structure of the Earth at unprecedented levels. Using advances in solver techniques that run on the GPUs on Titan at the OLCF, scientists are able to perform large-scale seismic inverse modeling and imaging. Using seismic data from global and regional networks from global CMT earthquakes, scientists are using SPECFEM3D_GLOBE to understand the structure of the mantle layer of the Earth. Visualization of the generated data sets provide an effective way to understand the computed wave perturbations which define the structure of mantle in the Earth.

Pugmire, David↗

Recent Improvements in Aerodynamic Design Optimization on Unstructured Meshes

Recent improvements in an unstructured-grid method for large-scale aerodynamic design are presented. Previous work had shown such computations to be prohibitively long in a sequential processing environment. Also, robust adjoint solutions and mesh movement procedures were difficult to realize, particularly for viscous flows. To overcome these limiting factors, a set of design codes based on a discrete adjoint method is extended to a multiprocessor environment using a shared memory approach. A nearly linear speedup is demonstrated, and the consistency of the linearizations is shown to remain valid. The full linearization of the residual is used to precondition the adjoint system, and a significantly improved convergence rate is obtained. A new mesh movement algorithm is implemented and several advantages over an existing technique are presented. Several design cases are shown for turbulent flows in two and three dimensions.

Nielsen, Eric J.↗

Fuel-Optimal Trajectory Optimization of Mach 0.745 Transonic Truss-Braced Wing with Variable Camber Continuous Trailing Edge Flap

This paper describes a fuel-optimal trajectory optimization of the Mach 0.745 Transonic Truss-Braced Wing with the variable camber continuous trailing edge flaps (VCCTEF) capable of changing the chordwise pressure distribution and spanwise lift distribution to minimize drag. The trajectory optimization is posed as a minimization of the fuel burn over a fixed cruise range. The trajectory optimization is formulated by the adjoint method which results in a two-point boundary value problem. A numerical shooting method is implemented to solve the minimum-fuel trajectory optimization. The results indicates a fuel burn reduction of 793 lbs or 5.5% for a cruise range of 3000 miles. An approximate trajectory optimization is proposed using a single adjoint variable. This leads to a greatly simplified analytical solution of the adjoint solution. The results of the approximate trajectory optimization are in excellent agreement with those obtained by the shooting method. The approximate trajectory optimization produces a fuel burn reduction of 615 lbs or 4.3%.

Trajectory Optimization↗

A Preconditioning Method for Shape Optimization Governed by the Euler Equations

We consider a classical aerodynamic shape optimization problem subject to the compressible Euler flow equations. The gradient of the cost functional with respect to the shape variables is derived with the adjoint method at the continuous level. The Hessian (second order derivative of the cost functional with respect to the shape variables) is approximated also at the continuous level, as first introduced by Arian and Ta'asan (1996). The approximation of the Hessian is used to approximate the Newton step which is essential to accelerate the numerical solution of the optimization problem. The design space is discretized in the maximum dimension, i.e., the location of each point on the intersection of the computational mesh with the airfoil is taken to be an independent design variable. We give numerical examples for 86 design variables in two different flow speeds and achieve an order of magnitude reduction in the cost functional at a computational effort of a full solution of the analysis partial differential equation (PDE).

Arian, Eyal↗

Source identification in acoustics and structural mechanics using Sierra/SD.

In this report we derive both time and frequency-domain methods for inverse identification of sources in elastodynamics and acoustics. The inverse/design problem is cast in a PDE-constrained optimization framework with efficient computation of gradients using the adjoint method. The implementation of source inversion in Sierra/SD is described, and results from both time and frequency domain source inversion are compared to actual experimental data for a weapon store used in captive carry on a military aircraft. The inverse methodology is advantageous in that it provides a method for creating ground based acoustic and vibration tests that can reduce the actual number of flight tests, and thus, saving costs and time for the program.

Walsh, Timothy Francis↗

Adjoint sensitivity analysis of chaotic dynamical systems with non-intrusive least squares shadowing

This paper presents a discrete adjoint version of the recently developed non-intrusive least squares shadowing (NILSS) algorithm, which circumvents the instability that conventional adjoint methods encounter for chaotic systems. The NILSS approach involves solving a smaller minimization problem than other shadowing approaches and can be implemented with only minor modifications to preexisting tangent and adjoint solvers. Adjoint NILSS is demonstrated on a small chaotic ODE, a one-dimensional scalar PDE, and a direct numerical simulation (DNS) of the minimal flow unit, a turbulent channel flow on a small spatial domain. This is the first application of an adjoint shadowing-based algorithm to a three-dimensional turbulent flow. - Highlights: • A discrete adjoint non-intrusive least squares shadowing (NILSS) is presented. • The NILSS approach is closely related to multiple shooting shadowing (MSS). • Adjoint NILSS prevents exponential growth in time of the adjoint field. • Adjoint NILSS is demonstrated on a simulation of wall-bounded turbulent flow.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Unsteady Adjoint of Pressure Loss for a Fundamental Transonic Turbine Vane

High-fidelity simulations, e.g., large eddy simulation (LES), are often needed for accurately predicting pressure losses due to wake mixing and boundary layer development in turbomachinery applications. An unsteady adjoint of high-fidelity simulations is useful for design optimization in such aerodynamic applications. In this paper, we present unsteady adjoint solutions using a large eddy simulation model for an inlet guide vane from von Karman Institute (VKI) using aerothermal objectives. The unsteady adjoint method is effective in capturing the gradient for a short time interval aerothermal objective, whereas the method provides diverging gradients for long time-averaged thermal objectives. As the boundary layer on the suction side near the trailing edge of the vane is turbulent, it poses a challenge for the adjoint solver. The chaotic dynamics cause the adjoint solution to diverge exponentially from the trailing edge region when solved backward in time. This results in the corruption of the sensitivities obtained from the adjoint solutions. An energy analysis of the unsteady compressible Navier–Stokes adjoint equations indicates that adding artificial viscosity to the adjoint equations can dissipate the adjoint energy while potentially maintaining the accuracy of the adjoint sensitivities. Analyzing the growth term of the adjoint energy provides a metric for identifying the regions in the flow where the adjoint term is diverging. Results for the vane obtained from simulations performed on the Titan supercomputer are demonstrated.

Engineering↗

Nonlinear optimization for a tumor invasion PDE model

In this work, we introduce a methodology to approximate unknown parameters that appear on a non-linear reaction–diffusion model of tumor invasion. These equations consider that tumor-induced alteration of micro-environmental pH furnishes a mechanism for cancer invasion. A coupled system reaction–diffusion explaining this model is given by three partial differential equations for the non-dimensional spatial distribution and temporal evolution of the density of normal tissue, the neoplastic tissue growth and the excess concentration of H{sup +} ions. The tumor model parameters have a corresponding biological meaning: the reabsorption rate, the destructive influence of H{sup +} ions in the healthy tissue, the growth rate of tumor tissue and the diffusion coefficient. We propose to solve the direct problem using the Finite Element Method (FEM) and minimize an appropriate functional including both the real data (obtained via in-vitro experiments and fluorescence ratio imaging microscopy) and the numerical solution. The gradient of the functional is computed by the adjoint method.

60 APPLIED LIFE SCIENCES↗

Practical implementation of an accurate method for multilevel design sensitivity analysis

Solution techniques for handling large scale engineering optimization problems are reviewed. Potentials for practical applications as well as their limited capabilities are discussed. A new solution algorithm for design sensitivity is proposed. The algorithm is based upon the multilevel substructuring concept to be coupled with the adjoint method of sensitivity analysis. There are no approximations involved in the present algorithm except the usual approximations introduced due to the discretization of the finite element model. Results from the six- and thirty-bar planar truss problems show that the proposed multilevel scheme for sensitivity analysis is more effective (in terms of computer incore memory and the total CPU time) than a conventional (one level) scheme even on small problems. The new algorithm is expected to perform better for larger problems and its applications on the new generation of computer hardwares with 'parallel processing' capability is very promising.

Nguyen, Duc T.↗

Differential methods for assessing sensitivity in biological models

Differential sensitivity analysis is indispensable in fitting parameters, understanding uncertainty, and forecasting the results of both thought and lab experiments. Although there are many methods currently available for performing differential sensitivity analysis of biological models, it can be difficult to determine which method is best suited for a particular model. In this paper, we explain a variety of differential sensitivity methods and assess their value in some typical biological models. First, we explain the mathematical basis for three numerical methods: adjoint sensitivity analysis, complex perturbation sensitivity analysis, and forward mode sensitivity analysis. We then carry out four instructive case studies. (a) The CARRGO model for tumor-immune interaction highlights the additional information that differential sensitivity analysis provides beyond traditional naive sensitivity methods, (b) the deterministic SIR model demonstrates the value of using second-order sensitivity in refining model predictions, (c) the stochastic SIR model shows how differential sensitivity can be attacked in stochastic modeling, and (d) a discrete birth-death-migration model illustrates how the complex perturbation method of differential sensitivity can be generalized to a broader range of biological models. Finally, we compare the speed, accuracy, and ease of use of these methods. We find that forward mode automatic differentiation has the quickest computational time, while the complex perturbation method is the simplest to implement and the most generalizable.

59 BASIC BIOLOGICAL SCIENCES↗

Aerodynamic Design Optimization on Unstructured Meshes Using the Navier-Stokes Equations

A discrete adjoint method is developed and demonstrated for aerodynamic design optimization on unstructured grids. The governing equations are the three-dimensional Reynolds-averaged Navier-Stokes equations coupled with a one-equation turbulence model. A discussion of the numerical implementation of the flow and adjoint equations is presented. Both compressible and incompressible solvers are differentiated and the accuracy of the sensitivity derivatives is verified by comparing with gradients obtained using finite differences. Several simplifying approximations to the complete linearization of the residual are also presented, and the resulting accuracy of the derivatives is examined. Demonstration optimizations for both compressible and incompressible flows are given.

Nielsen, Eric J.↗

Adjoint-Based Design of Rotors using the Navier-Stokes Equations in a Noninertial Reference Frame

Optimization of rotorcraft flowfields using an adjoint method generally requires a time-dependent implementation of the equations. The current study examines an intermediate approach in which a subset of rotor flowfields are cast as steady problems in a noninertial reference frame. This technique permits the use of an existing steady-state adjoint formulation with minor modifications to perform sensitivity analyses. The formulation is valid for isolated rigid rotors in hover or where the freestream velocity is aligned with the axis of rotation. Discrete consistency of the implementation is demonstrated using comparisons with a complex-variable technique, and a number of single- and multi-point optimizations for the rotorcraft figure of merit function are shown for varying blade collective angles. Design trends are shown to remain consistent as the grid is refined.

Nielsen, Eric J.↗

Adjoint-Based Design of Rotors Using the Navier-Stokes Equations in a Noninertial Reference Frame

Optimization of rotorcraft flowfields using an adjoint method generally requires a time-dependent implementation of the equations. The current study examines an intermediate approach in which a subset of rotor flowfields are cast as steady problems in a noninertial reference frame. This technique permits the use of an existing steady-state adjoint formulation with minor modifications to perform sensitivity analyses. The formulation is valid for isolated rigid rotors in hover or where the freestream velocity is aligned with the axis of rotation. Discrete consistency of the implementation is demonstrated by using comparisons with a complex-variable technique, and a number of single- and multipoint optimizations for the rotorcraft figure of merit function are shown for varying blade collective angles. Design trends are shown to remain consistent as the grid is refined.

Nielsen, Eric J.↗

Covering Resilience: A Recent Development for Binomial Checkpointing

In terms of computing time, adjoint methods offer a very attractive alternative to compute gradient information, required, e.g., for optimization purposes. However, together with this very favorable temporal complexity result comes a memory requirement that is in essence proportional with the operation count of the underlying function, e.g., if algorithmic differentiation is used to provide the adjoints. For this reason, checkpointing approaches in many variants have become popular. This paper analyzes an extension of the so-called binomial approach to cover also possible failures of the computing systems. Such a measure of precaution is of special interest for massive parallel simulations and adjoint calculations where the mean time between failure of the large scale computing system is smaller than the time needed to complete the calculation of the adjoint information. We describe the extensions of standard checkpointing approaches required for such resilience, provide a corresponding implementation and discuss first numerical results.

Walther, Andrea↗