Search NASA⌕ Search

SEARCH · Search NASA

Results for “Adjoint methods”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

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

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

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

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

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

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

Adjoint Sensitivity Computations for an Embedded-Boundary Cartesian Mesh Method and CAD Geometry

Cartesian-mesh methods are perhaps the most promising approach for addressing the issues of flow solution automation for aerodynamic design problems. In these methods, the discretization of the wetted surface is decoupled from that of the volume mesh. This not only enables fast and robust mesh generation for geometry of arbitrary complexity, but also facilitates access to geometry modeling and manipulation using parametric Computer-Aided Design (CAD) tools. Our goal is to combine the automation capabilities of Cartesian methods with an eficient computation of design sensitivities. We address this issue using the adjoint method, where the computational cost of the design sensitivities, or objective function gradients, is esseutially indepeudent of the number of design variables. In previous work, we presented an accurate and efficient algorithm for the solution of the adjoint Euler equations discretized on Cartesian meshes with embedded, cut-cell boundaries. Novel aspects of the algorithm included the computation of surface shape sensitivities for triangulations based on parametric-CAD models and the linearization of the coupling between the surface triangulation and the cut-cells. The objective of the present work is to extend our adjoint formulation to problems involving general shape changes. Central to this development is the computation of volume-mesh sensitivities to obtain a reliable approximation of the objective finction gradient. Motivated by the success of mesh-perturbation schemes commonly used in body-fitted unstructured formulations, we propose an approach based on a local linearization of a mesh-perturbation scheme similar to the spring analogy. This approach circumvents most of the difficulties that arise due to non-smooth changes in the cut-cell layer as the boundary shape evolves and provides a consistent approximation tot he exact gradient of the discretized abjective function. A detailed gradient accurace study is presented to verify our approach. Thereafter, we focus on a shape optimization problem for an Apollo-like reentry capsule. The optimization seeks to enhance the lift-to-drag ratio of the capsule by modifyjing the shape of its heat-shield in conjunction with a center-of-gravity (c.g.) offset. This multipoint and multi-objective optimization problem is used to demonstrate the overall effectiveness of the Cartesian adjoint method for addressing the issues of complex aerodynamic design. This abstract presents only a brief outline of the numerical method and results; full details will be given in the final paper.

Nemec, Marian↗
DOE OSTI2021

Adjoint Klein-Nishina Sampling Methods: Efficiency, Speed and Applications

Three new rejection sampling methods for generating samples from the adjoint Klein-Nishina cross section are discussed: the two-branch rejection sampling procedure, the three-branch linear rejection sampling procedure and the three-branch inverse rejection sampling procedure. These methods have all been implemented in the Framework for REsearch in Nuclear ScIence and Engineering (FRENSIE). The efficiency and sample generation rate of each of these methods are evaluated to characterize the methods and to make recommendations regarding their use. The use of these methods in realistic transport simulations is also evaluated by incorporating a scattering function into the sampling process. Furthermore, the results of an infinite medium problem are presented to verify that the sampling procedure can be used in an adjoint Monte Carlo simulation to generate results that are in agreement with an equivalent forward simulation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Multiscale modeling high-order methods and data-driven modeling

Projection-based reduced-order models (ROMs) comprise a promising set of data-driven approaches for accelerating the simulation of high-fidelity numerical simulations. Standard projection-based ROM approaches, however, suffer from several drawbacks when applied to the complex nonlinear dynamical systems commonly encountered in science and engineering. These limitations include a lack of stability, accuracy, and sharp a posteriori error estimators. This work addresses these limitations by leveraging multiscale modeling, least-squares principles, and machine learning to develop novel reduced-order modeling approaches, along with data-driven a posteriori error estimators, for dynamical systems. Theoretical and numerical results demonstrate that the two ROM approaches developed in this work - namely the windowed least-squares method and the Adjoint Petrov - Galerkin method - yield substantial improvements over state-of-the-art approaches. Additionally, numerical results demonstrate the capability of the a posteriori error models developed in this work.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Diagnosing the sensitivity of grounding-line flux to changes in sub-ice-shelf melting

Abstract. Using a numerical ice flow model, we study changes in ice shelf buttressing and grounding-line flux due to localized ice thickness perturbations, a proxy for localized changes in sub-ice-shelf melting. From our experiments, applied to idealized (MISMIP+) and realistic (Larsen C) ice shelf domains, we identify a correlation between a locally derived buttressing number on the ice shelf, based on the first principal stress, and changes in the integrated grounding-line flux. The origin of this correlation, however, remains elusive from the perspective of a theoretical or physically based understanding. This and the fact that the correlation is generally much poorer when applied to realistic ice shelf domains motivate us to seek an alternative approach for predicting changes in grounding-line flux. We therefore propose an adjoint-based method for calculating the sensitivity of the integrated grounding-line flux to local changes in ice shelf geometry. We show that the adjoint-based sensitivity is identical to that deduced from pointwise, diagnostic model perturbation experiments. Based on its much wider applicability and the significant computational savings, we propose that the adjoint-based method is ideally suited for assessing grounding-line flux sensitivity to changes in sub-ice-shelf melting.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2016

Implementation of Material and Geometry Criticality Search in RMC Code

RMC is a continuous-energy Reactor Monte Carlo neutron and photon transport code being developed by Department of Engineering Physics at Tsinghua University, Beijing. For the use of simulation of reactor control or design of reactor with unknown material and geometry parameters, an accurate and efficient method of eigenvalue search is implemented in RMC code. The eigenvalue search focuses on two types of parameters. One is nuclide atom density, called material search, which includes the fuel density, enrichment or boron concentration. Perturbation theory of Monte Carlo Code, like differential operator method and adjoint-weighted perturbation method has been widely researched in sensitivity and uncertainty study. For material search, the perturbation algorithm needs to coupled with flexible material control block and optimized strategy. The other type of parameter is surface position, called geometry search, which includes fuel rod diameter, pitch and control rod position. MC21 iterated on surface position based on bisection method or regula-falsi method, and directly recalculated k-eff until it converged to target error interval. In this paper, the differential operator method, improved Newton-Raphson method is introduced. Based on these methods, the global material search is implemented. Then based on material search and finite method, global geometry search is implement. Finally, fuel enrichment, boron concentration and control rod position in normal PWR assembly are searched. The results show that RMC can search material and geometry parameters accurately and efficiently. In this paper, global eigenvalue search of material and geometry parameters have been implemented in RMC code. They are based on the differential operator method in Monte Carlo perturbation theory. The differential operator method samples δk/δρ{sub r}, δ{sup 2}k/δρ{sub r}{sup 2} along with k-eff estimator. Therefore it won't take up too much additional computational resource. For homogeneous material search, fission source effect has little effect of accuracy and can be ignored. The results of fuel enrichment and boron concentration searches in assembly show that improved Newton-Raphson method can iterate efficiently until k-eff is in the error interval. Based on material search and finite difference formula, the geometry parameter, like control rod axial position, can iterate until k-eff is in the error interval. However, the tiny perturbed region may not contain enough tracks to simulate. Besides, the large number density's relative change up to -1 may cause underestimation of Δk-eff, and then slope of k-x curve. This will cause non-convergence for Newton- Raphson method. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Advancing attenuation estimation through integration of the Hessian in multiparameter viscoacoustic full-waveform inversion

Accurate seismic attenuation models of subsurface structures not only enhance subsequent migration processes by improving fidelity, resolution, and facilitating amplitude-compliant angle gather generation but also provide valuable constraints on subsurface physical properties. Leveraging full-wavefield information, multiparameter viscoacoustic full-waveform inversion ( Q-FWI) simultaneously estimates seismic velocity and attenuation ( Q) models. However, a major challenge in Q-FWI is the contamination of crosstalk artifacts, where inaccuracies in the velocity model are mistakenly mapped to the inverted attenuation model. While incorporating the Hessian is expected to mitigate these artifacts, the explicit implementation is prohibitively expensive due to its formidable computational cost. In this study, we formulate and develop a Q-FWI algorithm via the Newton-conjugate gradient (CG) framework, where the search direction at each iteration is determined through an internal CG loop. In particular, the Hessian is integrated into each CG step in a matrix-free fashion using the second-order adjoint-state method. We find through synthetic experiments that our Newton-CG Q-FWI significantly mitigates crosstalk artifacts compared with the limited-memory Broyden-Fletcher-Goldfarb-Shanno method and the CG method, albeit with a notable computational cost. In the discussion of several key implementation details, we also determine the significance of the approximate Gauss-Newton Hessian, the second-order adjoint-state method, and the two-stage inversion strategy.

Geochemistry & Geophysics↗
DOE OSTI2021

A general approach to seismic inversion with automatic differentiation

Imaging Earth structure or seismic sources from seismic data involves minimizing a target misfit function, and is commonly solved through gradient-based optimization. The adjoint-state method has been developed to compute the gradient efficiently; however, its implementation can be time-consuming and difficult. We develop a general seismic inversion framework to calculate gradients using reverse-mode automatic differentiation. The central idea is that adjoint-state methods and reverse-mode automatic differentiation are mathematically equivalent. Here, the mapping between numerical PDE simulation and deep learning allows us to build a seismic inverse modeling library, ADSeismic, based on deep learning frameworks, which supports high performance reverse-mode automatic differentiation on CPUs and GPUs. We demonstrate the performance of ADSeismic on inverse problems related to velocity model estimation, rupture imaging, earthquake location, and source time function retrieval. ADSeismic has the potential to solve a wide variety of inverse modeling applications within a unified framework.

58 GEOSCIENCES↗
NASA NTRS1987

Multigrid methods for bifurcation problems: The self adjoint case

This paper deals with multigrid methods for computational problems that arise in the theory of bifurcation and is restricted to the self adjoint case. The basic problem is to solve for arcs of solutions, a task that is done successfully with an arc length continuation method. Other important issues are, for example, detecting and locating singular points as part of the continuation process, switching branches at bifurcation points, etc. Multigrid methods have been applied to continuation problems. These methods work well at regular points and at limit points, while they may encounter difficulties in the vicinity of bifurcation points. A new continuation method that is very efficient also near bifurcation points is presented here. The other issues mentioned above are also treated very efficiently with appropriate multigrid algorithms. For example, it is shown that limit points and bifurcation points can be solved for directly by a multigrid algorithm. Moreover, the algorithms presented here solve the corresponding problems in just a few work units (about 10 or less), where a work unit is the work involved in one local relaxation on the finest grid.

Taasan, Shlomo↗
NASA NTRS1992

New optimality criteria methods - Forcing uniqueness of the adjoint strains by corner-rounding at constraint intersections

In new, iterative continuum-based optimality criteria (COC) methods, the strain in the adjoint structure becomes non-unique if the number of active local constraints is greater than the number of design variables for an element. This brief note discusses the use of smooth envelope functions (SEFs) in overcoming economically computational problems caused by the above non-uniqueness.

Rozvany, G. I. N.↗
NASA NTRSDate not supplied

Verification of Viscous Goal-Based Anisotropic Mesh Adaptation

Adaptive unstructured mesh techniques have a limited, but growing impact on production analysis workflows where the control of discretization error is critical to obtaining reliable simulation results. Recent progress has matured a number of independent implementations of flow solvers, error estimation methods, and anisotropic mesh adaptation mechanics. Anisotropic metric construction methods are evaluated with analytically defined primal and adjoint fields. This allows the comparison of different metric formulations and different implementations of the same formulation without the complications of a flow and adjoint solution method. Unstructured mesh adaptation tools are verified by comparison on analytic primal and dual field before verification on benchmark aerodynamics cases. The documentation of these verification exercises helps to prepare these goal-based methods for routine use in production simulation workflows.

Mesh adaptation↗