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 163 records · Page 9

Uncertainty of Observation Impact Estimation in an Adjoint Model Investigated with an Observing System Simulation Experiment

Adjoint models are often used to estimate the impact of different observations on short-term forecast skill. A common difficulty with the evaluation of short term forecast quality is the choice of verification fields. The use of self-analysis fields for verification is typical but incestuous, and introduces uncertainty due to biases and errors in the analysis field. In this study, an observing system simulation experiment (OSSE) is used to explore the uncertainty in adjoint model estimations of observation impact. The availability of the true state for verification in the OSSE framework in the form of the Nature Run allows calculation of the observation impact without the uncertainties present in self-analysis verification. These impact estimates are compared to estimates calculated using self-analysis verification. The Global Earth Observing System version 5 (GEOS-5) forecast model with Gridpoint Statistical Interpolation (GSI) is used with the National Aeronautics and Space Administration Global Modeling and Assimilation Office (NASA/GMAO) OSSE capability. The adjoint model includes moist processes, with total wet energy selected as the norm for evaluation of observation impacts. The results show that there are measurable but small discrepancies in the adjoint model estimation of observation impact. In general, observations of temperature and winds tend to have overestimated impacts with self-analysis verification, while observations of humidity and moisture-affected observations tend to have underestimated impacts. The small magnitude of the differences in impact estimates supports the robustness of the adjoint method of estimating observation impacts.

N C Prive↗

High-Fidelity Multidisciplinary Sensitivity Analysis Framework for Multipoint Rotorcraft Optimization

A multidisciplinary, gradient-based sensitivity-analysis methodology is evaluated for optimization of rotorcraft configurations. The tightly coupled discipline models include physics-based fluid dynamics and rotorcraft comprehensive analysis. A discretely-consistent adjoint method accounts for sensitivities of the unsteady flow and unstructured, dynamic, over set grids, while sensitivities of structural responses to aerodynamic loads are computed using a complex-variable method. The methodology is applied to optimize the shape of UH-60A Blackhawk helicopter blades for hover and forward flight conditions. The objective of the multipoint design is to simultaneously increase the rotorcraft figure of merit in a hover flight and reduce the rotor power in a forward flight. Trimmed loose-coupling solutions for the baseline configuration are used to initiate the tight-coupling multidisciplinary analysis. Target thrust and rolling and pitching moments are enforced as optimization constraints. The optimized configuration improves the optimization metrics at both design points. The improved performance and all constraints are maintained over many revolutions beyond the optimization interval, satisfying the required flight conditions. Computational cost of the optimization cycle is assessed in a high-performance computing environment and found affordable for design of rotorcraft in general level-flight conditions.

Wang, Li↗

Runaway electrons in tokamaks

The generation of runaway electrons is a complex and important phenomenon that impacts many areas of plasma physics. Due to the decrease of electron collision frequency with increasing velocity, electrons under strong electric field can experience unlimited “runaway” acceleration. In tokamaks, runaway electrons can be produced in disruptions, due to the strong inductive electric field formed as the thermal energy of plasma gets rapidly lost. This population of runaway electrons can undergo an exponential growth, denoted the runaway electron avalanche, due to hard collisions between relativistic runaway electrons and low energy electrons. It is predicted that in a large tokamak device like the International Thermonuclear Experimental Reactor (ITER), a runway electron beam generated in a disruption event can potentially cause severe damage to the device, which poses a significant challenge for ITER to achieve its mission. It is therefore extremely important to seek an effective mitigation mechanism for runaway electrons. Experimental efforts have been made to study the properties of runaway electrons in tokamaks, including their generation, diffusion, and radiation. In order to understand these experimental results, extensive theoretical and simulation studies of runaway electron physics are required. The main topic of this thesis is to study the wave particle interaction associated with runaway electron beams in tokamaks. The runaway electrons can emit and absorb electromagnetic waves through resonances, and can be diffused in momentum space by the waves. Initially, we address the Cherenkov radiation of runaway electrons, which originates from the polarization of the plasma medium. The energy and momentum loss of the Cherenkov radiation can be modeled by adding a correction to the Coulomb logarithm in the collisional drag force. Subsequently, we address pitch angle scattering caused by normal modes in the plasma, which are driven unstable by the anisotropicity of the runaway electron beam. The fluctuating electromagnetic fields are found to act as a seed for the unstable normal modes. Numerical simulations show that the pitch angle scattering effect from the normal modes, mainly whistler waves, can be significantly larger than that from collisional pitch angle scattering. Finally, we present a synthetic diagnostic tool we developed to calculate the electron cyclotron emission (ECE) from the runaway electrons, and successfully reproduce the prompt growth of the ECE signal observed in DIII-D quiescent runaway electron (QRE) experiments. Within the thesis, we also present the application of the adjoint method to runaway electron research, and show the calculations of the runaway probability function (RPF) and the expected loss time (ELT). These calculations not only help depict the dynamics of runaway electrons in momentum space, but also can be used to efficiently calculate experimentally relevant quantities such as the critical electric field for runaway electron avalanche and the avalanche growth rate.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The Adjoint Petrov–Galerkin method for non-linear model reduction

Here, we formulate a new projection-based reduced-order modeling technique for non-linear dynamical systems. The proposed technique, which we refer to as the Adjoint Petrov–Galerkin (APG) method, is derived by decomposing the generalized coordinates of a dynamical system into a resolved coarse-scale set and an unresolved fine-scale set. A Markovian finite memory assumption within the Mori–Zwanzig formalism is then used to develop a reduced-order representation of the coarse scales. This procedure leads to a closed reduced-order model that displays commonalities with the adjoint stabilization method used in finite elements. The formulation is shown to be equivalent to a Petrov–Galerkin method with a non-linear, time-varying test basis, thus sharing some similarities with the Least-Squares Petrov–Galerkin method. Theoretical analysis examining a priori error bounds and computational cost is presented. Numerical experiments on the compressible Navier–Stokes equations demonstrate that the proposed method can lead to improvements in numerical accuracy, robustness, and computational efficiency over the Galerkin method on problems of practical interest. Improvements in numerical accuracy and computational efficiency over the Least-Squares Petrov–Galerkin method are observed in most cases.

42 ENGINEERING↗

An adjoint-based optimization method for jointly inverting heterogeneous material properties and fault slip from earthquake surface deformation data

SUMMARY Analysis of tectonic and earthquake-cycle associated deformation of the crust can provide valuable insights into the underlying deformation processes including fault slip. How those processes are expressed at the surface depends on the lateral and depth variations of rock properties. The effect of such variations is often tested by forward models based on a priori geological or geophysical information. Here, we first develop a novel technique based on an open-source finite-element computational framework to invert geodetic constraints directly for heterogeneous media properties. We focus on the elastic, coseismic problem and seek to constrain variations in shear modulus and Poisson’s ratio, proxies for the effects of lithology and/or temperature and porous flow, respectively. The corresponding nonlinear inversion is implemented using adjoint-based optimization that efficiently reduces the cost function that includes the misfit between the calculated and observed displacements and a penalty term. We then extend our theoretical and numerical framework to simultaneously infer both heterogeneous Earth’s structure and fault slip from surface deformation. Based on a range of 2-D synthetic cases, we find that both model parameters can be satisfactorily estimated for the megathrust setting-inspired test problems considered. Within limits, this is the case even in the presence of noise and if the fault geometry is not perfectly known. Our method lays the foundation for a future reassessment of the information contained in increasingly data-rich settings, for example, geodetic GNSS constraints for large earthquakes such as the 2011 Tohoku-oki M9 event, or distributed deformation along plate boundaries as constrained from InSAR.

Geochemistry & Geophysics↗

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↗

Adjoint-Based Sensitivity and Uncertainty Analysis for Density and Composition: A User’s Guide

The ability to perform sensitivity analyses using adjoint-based first-order sensitivity theory has existed for decades. This paper provides guidance on how adjoint sensitivity methods can be used to predict the effect of material density and composition uncertainties in critical experiments, including when these uncertain parameters are correlated or constrained. Two widely used Monte Carlo codes, MCNP6 (Ref. 2) and SCALE 6.2 (Ref. 3), are both capable of computing isotopic density sensitivities in continuous energy and angle. Additionally, Perkó et al. have shown how individual isotope density sensitivities, easily computed using adjoint methods, can be combined to compute constrained first-order sensitivities that may be used in the uncertainty analysis. This paper provides details on how the codes are used to compute first-order sensitivities and how the sensitivities are used in an uncertainty analysis. Constrained first-order sensitivities are computed in a simple example problem.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Adjoint-Based Sensitivity and Uncertainty Analysis for Density and Composition: A User's Guide

The ability to perform sensitivity analyses using adjoint-based sensitivity theory has existed for decades . This paper provides guidance on how adjoint sensitivity methods can be used to predict the effect of material density and composition uncertainties in critical experiments, including when these uncertain parameters are correlated or constrained. Two widely used Monte Carlo codes, MCNP6 and SCALE, are both capable of computing isotopic sensitivities in continuous energy and angle. Additionally, Perko et al. have shown how individual isotope sensitivities, easily computed using adjoint methods, can be combined to compute constrained sensitivities that may be used in the uncertainty analysis. This paper provides details on how the codes are used to compute sensitivities and how the sensitivities are used in an uncertainty analysis. Constrained sensitivities are computed in a simple example problem. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Comparison of the FW-CADIS and MR-CADIS Variance Reduction Methods

The Consistent Adjoint Driven Importance Sampling (CADIS) method, which uses an adjoint deterministic estimate for making variance reduction parameters that optimize Monte Carlo (MC) shielding calculations, was introduced in 1998. This method was designed to optimize a single tally, typically an integrated response such as a detector count rate or a dose rate. Because both deterministic and stochastic methods are employed, CADIS is referred to as a hybrid method. In 2007, the forward-weighted CADIS (FW-CADIS) method was introduced to optimize several tallies at once, giving more uniform relative uncertainties among the tallies for both high-flux and low-flux areas of the problem. This method can be used for several small detectors, for semi-global problems (mesh tally over a large fraction of the problem), or for global problems (mesh tally over the entire problem). Optimization can be done for an integrated response such as a dose rate D(r) as a function of position, the total flux {phi}(r) as a function of position, or the space/energy flux {phi}(r,E). Both the CADIS and FW-CADIS methods have been in the MAVRIC sequence of SCALE for three versions (6.0 in 2009, 6.1 in 2011, and 6.2 in 2016). The ADVANTG package released in 2015 uses the CADIS and FW-CADIS methods to accelerate MCNP neutron/photon shielding calculations. In 2014, the multi-response CADIS (MR-CADIS) method was presented as a way to obtain even more uniform relative uncertainties for problems with multiple tallies than those obtained with FW-CADIS. The method does not use a forward deterministic calculation but instead uses one adjoint calculation for every tally to be optimized in the Monte Carlo calculation. This work compares the above methods.

42 ENGINEERING↗

Comparison of hybrid methods for global variance reduction in shielding calculations

For Monte Carlo shielding problems that calculate a mesh tally over the entire problem, the statistical uncertainties computed for each voxel can vary widely. This can lead to unacceptably long run times in order to reduce the uncertainties in all areas of the problem to a reasonably low level. Hybrid methods - using estimates from deterministic calculations to create importance maps for variance reduction in Monte Carlo calculations - have been successfully used to optimize the calculation of specific tallies. For the global problem, several methods have been proposed to create importance maps that distribute Monte Carlo particles in such a way as to achieve a more uniform distribution of relative uncertainty across the problem. The goal is to compute a mesh tally with nearly the same relative uncertainties in the low flux/dose areas as in the high flux/dose areas. Methods based on only forward deterministic estimates and methods using both forward and adjoint deterministic methods have been implemented in the SCALE/MAVRIC package and have been compared against each other by computing global mesh tallies on several representative shielding problems. Methods using both forward and adjoint estimates provide better performance for computing more uniform relative uncertainties across a global mesh tally. (authors)

97 MATHEMATICS AND COMPUTING↗

Adjoint-based deviational Monte Carlo methods for phonon transport calculations

In the field of linear transport, adjoint formulations exploit linearity to derive powerful reciprocity relations between a variety of quantities of interest. We develop an adjoint formulation of the linearized Boltzmann transport equation for phonon transport. We use this formulation for accelerating deviational Monte Carlo simulations of complex, multiscale problems. Benefits include significant computational savings via direct variance reduction, or by enabling formulations which allow more efficient use of computational resources, such as formulations which provide high resolution in a particular phase-space dimension (e.g., spectral). We show that the proposed adjoint-based methods are particularly well suited to problems involving a wide range of length scales (e.g., nanometers to hundreds of microns) and lead to computational methods that can calculate quantities of interest with a cost that is independent of the system characteristic length scale, thus removing the traditional stiffness of kinetic descriptions. Applications to problems of current interest, such as simulation of transient thermoreflectance experiments or spectrally resolved calculation of the effective thermal conductivity of nanostructured materials, are presented and discussed in detail.

42 ENGINEERING↗

Semi-analytical sensitivity analysis for nonlinear transient problems

Efficient analytical sensitivity computations are essential elements of gradient-based optimization schemes; however, they can be difficult to implement. This implementation issue is often resolved by adopting the semi-analytical method which exhibits the efficiency of the analytical methods and the ease of implementation of the finite difference method. However, care must be taken as semi-analytical sensitivities may exhibit errors due to truncation and round-off. Additional errors are introduced if the convergence tolerance of the primal analysis is not sufficiently small. This paper gives a general overview and some new developments of the analytical and semi-analytical sensitivity analyses for nonlinear steady-state, transient, and dynamic problems. We discuss the restrictive assumptions, accuracy, and consistency of these methods. Both adjoint and direct differentiation methods are studied. Numerical examples are provided.

42 ENGINEERING↗

Comparison Of Hybrid Methods For Global Variance Reduction In Shielding Calculations

For Monte Carlo shielding problems that calculate a mesh tally over the entire problem, the relative uncertainties computed for each voxel can vary widely. This can lead to unacceptably long run times in order to reduce the uncertainties in all areas of the problem to a reasonably low level. Hybrid methods using estimates from deterministic calculations to create importance maps for variance reduction in Monte Carlo calculations have been successfully used to optimize the calculation of specific tallies. For the global problem, several methods have been proposed that create importance maps that distribute Monte Carlo particles in such a way as to achieve a more uniform distribution of relative uncertainty across the problem. The goal is to compute a mesh tally with nearly the same relative uncertainties in the low flux/dose areas as in the high flux/dose areas. Methods based on only forward deterministic estimates and methods using both forward and adjoint deterministic methods have been implemented the SCALE/MAVRIC package and have been compared against each other by computing global mesh tallies on several representative shielding problems. Methods using both forward and adjoint estimates provide better performance for computing more uniform relative uncertainties across a global mesh tally.

FW-CADIS↗

Adjoint DSMC for nonlinear Boltzmann equation constrained optimization

Applications for kinetic equations such as optimal design and inverse problems often involve finding unknown parameters through gradient-based optimization algorithms. Based on the adjoint-state method, we derive two different frameworks for approximating the gradient of an objective functional constrained by the nonlinear Boltzmann equation. While the forward problem can be solved by the DSMC method, it is difficult to efficiently solve the high-dimensional continuous adjoint equation obtained by the “optimize-then-discretize” approach. This challenge motivates us to propose an adjoint DSMC method following the “discretize-then-optimize” approach for Boltzmann-constrained optimization. We also analyze the properties of the two frameworks and their connections. Here, several numerical examples are presented to demonstrate their accuracy and efficiency.

97 MATHEMATICS AND COMPUTING↗