Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Adjoint Computation”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Demonstrating Computational Equivalence Between Continuous and Discrete Adjoint Methods by Calculating Time-Dependent Adjoint Solutions with Neutron Diffusion Models

The continuous adjoint method and the discrete adjoint method are two alternative approaches used to calculate adjoint solutions for adjoint systems. The continuous adjoint method derives adjoint equations analytically from continuous forward equations and then solves the adjoint equations either analytically or numerically in a discretized form whereas the discrete adjoint method calculates the adjoint solutions directly from the discretized forward equations. With regard to the methodology development and calculation procedure, distinct differences are well recognized between the two methods. For certain reasons, both methods are exclusively preferred and commonly used by different computational communities, but limited studies clarify the connections between the two adjoint methods from either of the communities. Herein, this paper demonstrates the computational equivalence between the continuous and discrete adjoint methods by investigating time-dependent adjoint solutions to the two-group neutron diffusion model in nuclear reactor analysis problems using both methods. Adjoint solutions can be used to estimate system parameters for reactor safety analysis. Appropriate final state conditions for the adjoint systems are specified in both of the methods, and the conditions are clarified with proper physical explanations. With the help of an event-based case study on neutron diffusion models, the accuracy of the time-dependent adjoint fluxes obtained from both methods is verified, and the pros and cons of both adjoint methods are examined. More importantly, the computational equivalence of both methods is demonstrated when they are applied to multigroup neutron diffusion systems. The advantage of calculating time-dependent adjoint fluxes by directly solving time-dependent adjoint systems rather than taking steady-state approximations as in common practice is also demonstrated.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2017

Calculating Control Rod Differential Worth Using Adjoint-Weighted Method

Recently, there are more and more research on using Monte Carlo method to calculate reactor important parameters. Control rod worth is one of the important parameters as it can determine the critical control rod position. There are two presentations of the control rod worth for utilization purpose, integral and differential. The former is the total reactivity change, while the latter is the reactivity change caused by per unit movement. In Monte Carlo calculation, differential control rod worth of a particular position is estimated by finite difference of reactivity between a small gap divided by gap distance. Though easy to implemented, the problem of this approach lies in that too large gap will enlarge error between 'differential' and 'difference', while too small gap will be disturbed by error caused by random fluctuation. Monte Carlo perturbation theory has been used to calculate the k{sub eff} sensitivity to certain parameters for a long time. By calculating the differential coefficient along with the k{sub eff}, this method is quite time-consuming and relatively accurate compared to finite difference method. Nevertheless, most of perturbation research focus on the perturbation of nuclide density or nuclear data. For geometrical perturbation, limited research was done before. Takahashi estimated the k{sub eff} sensitivity to reflector movement of pulsed fast reactor. MCNP6 used adjoint-weighted method for Godiva, Zeus and uranium oxyfluoride solution container benchmarks. This paper tries to apply the perturbation method to the determination of control rod differential worth. In this paper, based on RMC, a continuous-energy Reactor Monte Carlo transport code, Iterated Fission Probability method (IFP) is researched to calculate control rod differential worth on assembly level. IFP was originally developed by Hurwitz, and has been adopted by most of Monte Carlo code to compute adjoint-weighted parameters. This paper is organized with four parts. The first is introduction. Adjoint-weighted method is introduced in the second part. Problem 4 of benchmark from CASL is built to verify the method. Conclusion is given in final part.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
NASA NTRS1992

Neural network training by integration of adjoint systems of equations forward in time

A method and apparatus for supervised neural learning of time dependent trajectories exploits the concepts of adjoint operators to enable computation of the gradient of an objective functional with respect to the various parameters of the network architecture in a highly efficient manner. Specifically, it combines the advantage of dramatic reductions in computational complexity inherent in adjoint methods with the ability to solve two adjoint systems of equations together forward in time. Not only is a large amount of computation and storage saved, but the handling of real-time applications becomes also possible. The invention has been applied it to two examples of representative complexity which have recently been analyzed in the open literature and demonstrated that a circular trajectory can be learned in approximately 200 iterations compared to the 12000 reported in the literature. A figure eight trajectory was achieved in under 500 iterations compared to 20000 previously required. The trajectories computed using our new method are much closer to the target trajectories than was reported in previous studies.

Toomarian, Nikzad↗
NASA NTRS1999

Neural Network Training by Integration of Adjoint Systems of Equations Forward in Time

A method and apparatus for supervised neural learning of time dependent trajectories exploits the concepts of adjoint operators to enable computation of the gradient of an objective functional with respect to the various parameters of the network architecture in a highly efficient manner. Specifically. it combines the advantage of dramatic reductions in computational complexity inherent in adjoint methods with the ability to solve two adjoint systems of equations together forward in time. Not only is a large amount of computation and storage saved. but the handling of real-time applications becomes also possible. The invention has been applied it to two examples of representative complexity which have recently been analyzed in the open literature and demonstrated that a circular trajectory can be learned in approximately 200 iterations compared to the 12000 reported in the literature. A figure eight trajectory was achieved in under 500 iterations compared to 20000 previously required. Tbc trajectories computed using our new method are much closer to the target trajectories than was reported in previous studies.

Toomarian, Nikzad↗
DOE OSTI2015

Second-order adjoint sensitivity analysis methodology (2ND-ASAM) for computing exactly and efficiently first- and second-order sensitivities in large-scale systems - 14356

This work presents the second-order adjoint sensitivity analysis methodology (2.-ASAM) for computing exactly and efficiently the second-order functional derivatives ('sensitivities') of system responses to the system's model parameters. For a physical system comprising N{sub α} parameters and N{sub r} responses, forward methods require a total of at least (N{sup 2}{sub α}/2+3N{sub α}/2) large-scale computations for obtaining all of the first- and second-order sensitivities, for all N{sub r} system responses. On the other hand, for one functional-type system response, the 2.-ASAM requires one large-scale computation using the first-level adjoint sensitivity system (1.-LASS) for obtaining all of the first-order sensitivities, followed by at most (2N{sub α}+1) large-scale computations using the second-level adjoint sensitivity systems (2.-LASS) for obtaining all of the second-order sensitivities. The second-order sensitivities contribute decisively to causing asymmetries in the response distribution, since they are the leading contributors to the third-order response correlations (skewness). They also cause the 'expected value of the response' to differ from the 'computed nominal value of the response'. The implementation of the 2.-ASAM requires very little additional effort beyond the construction of the adjoint sensitivity system needed for computing the first-order sensitivities. Only the sources on the right-sides of the diffusion (differential) operator needed to be modified; the left-side of the differential equations (and hence the 'solver' in large-scale practical applications) remain unchanged. The application of the 2.-ASAM is illustrated on a benchmark heat conduction/convection problem, which makes transparent the underlying mathematical derivations. For this illustrative problem, 4 'large-scale' adjoint computations suffice for computing exactly all of the 6 first- and 21 distinct second-order derivatives. The 2.-ASAM presented in this work should enable the hitherto very difficult, if not intractable, exact computation of all of the second-order response sensitivities for large-systems involving many parameters, which is expected to affect significantly other fields that need efficiently computed second-order response sensitivities, such as optimization, data assimilation/adjustment, model calibration, and predictive modeling. (author)

42 ENGINEERING↗
DOE OSTI2018

Evaluating importance maps for TRIPOLI-4{sup R} using deterministic or on-line methods - 25446

Variance reduction is a key ingredient for solving radiation-protection problems with Monte-Carlo particle-transport codes. Many variance-reduction methods require the definition of an importance map and exhibit optimal performance if the importance map is given by the adjoint flux, the solution of the adjoint Boltzmann equation. This paper presents the implementation of the Consistent Adjoint-Driven Importance Sampling (CADIS) methodology via a coupling between the TRIPOLI-4 R Monte-Carlo particle-transport code and the IDT deterministic solver, Additionally, we describe the implementation of a new TRIPOLI-4 R score that makes it possible to estimate the adjoint flux during a direct Monte-Carlo calculation. These new features are expected to simplify the solution of difficult shielding problems. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2022

Invertible Neural Networks for Aerodynamic Design of Wind Turbine Blades

The state-of-the-practice methods for aerodynamic design of wind turbine blads use linearized blade element momentum theory (BEM) to optimize the twist and chord profiles from a pre-selected set of 2D airfoil shapes. In this work, we apply invertible neural network (INN) tools to enable the rapid inverse aerodynamic design of wind turbine blades including component airfoils. The INN is trained on data obtained through the use of robust automated mesh generation and the HAMSTR computational fluid dynamics solver with advanced turbulence and transition models validated for turbine applications. Our design technique is a significant improvement over the state-of-the-practice linearized blade element momentum (BEM) techniques in capturing 3D nonlinear aerodynamic effects that are critical for optimal design of the rotors. This is made possible by developing sparse, invertible neural networks (INNs) for inverse design and optimization that realize a 100x cost reduction compared to adjoint-based computational fluid dynamics (CFD) approaches, while enabling increased robustness of the final design. We demonstrate the INN tool for design of a section of the NREL 5-MW blade. All generated shapes satisfy the desired aerodynamic characteristics, demonstrating the success of the INN approach for inverse design of wind turbine blades.

aerodynamic design↗
DOE OSTI2012

A Stochastic Maximum Principle for a Stochastic Differential Game of a Mean-Field Type

We construct a stochastic maximum principle (SMP) which provides necessary conditions for the existence of Nash equilibria in a certain form of N-agent stochastic differential game (SDG) of a mean-field type. The information structure considered for the SDG is of a possible asymmetric and partial type. To prove our SMP we take an approach based on spike-variations and adjoint representation techniques, analogous to that of S. Peng (SIAM J. Control Optim. 28(4):966-979, 1990) in the optimal stochastic control context. In our proof we apply adjoint representation procedures at three points. The first-order adjoint processes are defined as solutions to certain mean-field backward stochastic differential equations, and second-order adjoint processes of a first type are defined as solutions to certain backward stochastic differential equations. Second-order adjoint processes of a second type are defined as solutions of certain backward stochastic equations of a type that we introduce in this paper, and which we term conditional mean-field backward stochastic differential equations. From the resulting representations, we show that the terms relating to these second-order adjoint processes of the second type are of an order such that they do not appear in our final SMP equations. A comparable situation exists in an article by R. Buckdahn, B. Djehiche, and J. Li (Appl. Math. Optim. 64(2):197-216, 2011) that constructs a SMP for a mean-field type optimal stochastic control problem; however, the approach we take of using these second-order adjoint processes of a second type to deal with the type of terms that we refer to as the second form of quadratic-type terms represents an alternative to a development, to our setting, of the approach used in their article for their analogous type of term.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A persistent adjoint method with dynamic time-scaling and an application to mass action kinetics

In this article, we consider an optimization problem where the objective function is evaluated at the fixed-point of a contraction mapping parameterized by a control variable, and optimization takes place over this control variable. Since the derivative of the fixed-point with respect to the parameter can usually not be evaluated exactly, an adjoint dynamical system can be used to estimate gradients. Using this estimation procedure, the optimization algorithm alternates between derivative estimation and an approximate gradient descent step. We analyze a variant of this approach involving dynamic time-scaling, where after each parameter update the adjoint system is iterated until a convergence threshold is passed. Here, we prove that, under certain conditions, the algorithm can find approximate stationary points of the objective function. We demonstrate the approach in the settings of an inverse problem in chemical kinetics, and learning in attractor networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Invertible Neural Networks for Airfoil Design

We report the airfoil design problem, in which an engineer seeks a shape with desired performance characteristics, is fundamental to aerodynamics. Design workflows traditionally rely on iterative optimization methods using low-fidelity integral boundary-layer methods as higher-fidelity adjoint-based computational fluid dynamics methods are computationally expensive. Surrogate-based approaches can accelerate the design process but still rely on some iterative inverse design procedure. In this work, we leverage emerging invertible neural network (INN) tools to enable the rapid inverse design of airfoil shapes for wind turbines. INNs are specialized deep-learning models with well-defined inverse mappings. When trained appropriately, INN surrogate models are capable of forward prediction of aerodynamic and structural quantities for a given airfoil shape as well as inverse recovery of airfoil shapes with specified aerodynamic and structural characteristics. The INN approach offers a roughly 100 times speed-up compared to adjoint-based methods for inverse design. We demonstrate the INN tool for inverse design on three test cases of 100 airfoils each that satisfy the performance characteristics close to those of airfoils used in wind-turbine blades. All generated shapes satisfy the desired aerodynamic characteristics, demonstrating the success of the INN approach for inverse design of airfoils.

17 WIND ENERGY↗
DOE OSTI2022

Scientific Computational Imaging Code (SCICO)

Scientific Computational Imaging Code (SCICO) is a Python package for solving the inverse problems that arise in scientific imaging applications. Its primary focus is providing methods for solving ill-posed inverse problems by using an appropriate prior model of the reconstruction space. SCICO includes a growing suite of operators, cost functionals, regularizers, and optimization routines that may be combined to solve a wide range of problems, and is designed so that it is easy to add new building blocks. SCICO is built on top of JAX rather than NumPy, enabling GPU/TPU acceleration, just-in-time compilation, and automatic gradient functionality, which is used to automatically compute the adjoints of linear operators. An example of how to solve a multi-channel tomography problem with SCICO is shown in Figure 1. The SCICO source code is available from GitHub, and pre-built packages are available from PyPI. It has extensive online documentation, including API documentation and usage examples, which can be run online at Google Colab and binder.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Blade planform design optimization to enhance turbine wake control

Abstract This study considers optimizing the planform of wind turbine blades to ultimately enhance wind plant controls, namely, wake steering strategies. Adjoint‐enabled unsteady actuator line simulations are carried out to obtain gradients for optimization of several different performance objectives with respect to blade chord length at 10 locations along blade span. We demonstrate different blade design optimizations that can maximize time‐averaged lateral wake deflection, entrainment of kinetic energy, or total power of multiple turbines. Our optimized designs can produce a 4+% increase in wake deflection, a 4× increase in vertical kinetic energy entrainment, or a 3.6% increase in power when compared with the baseline case. While lateral wake deflection is only modestly sensitive to chord changes, we find that increasing the outboard chord length can dramatically increase kinetic energy entrainment, resulting in faster wake recovery and gains in net power. While this work develops only a few case studies emphasizing relative performance improvements and general trends, these results show the promise of a framework that combines mid‐fidelity computation with adjoint‐based optimization for control and design problems.

WIND ENERGY↗
DOE OSTI2015

Implementation and Validation of Reference Sensitivity Profile Calculations in TRIPOLI 4 - 14247

In current neutron transport calculations, particularly on continuous-energy Monte-Carlo codes, the major source of uncertainty is coming from nuclear data. In order to improve nuclear data evaluations, integral experiments are used. Feedback is then precisely obtained by re-estimating cross-section levels and correlations according to their sensitivity. k{sub eff}-sensitivity coefficients are traditionally obtained using deterministic codes since hands-on methods were not yet implemented in continuous energy Monte Carlo codes. In this paper, an Iterated-Fission-Probability-based method newly developed in the continuous energy Monte Carlo code TRIPOLI-4 will be used to calculate sensitivity coefficient breakdown on isotopes and reactions and results will be compared to those of ERANOS deterministic code. Objective is twofold: to show the reliability of the new TRIPOLI-4 method and to identify where and why profiles are slightly different. Sensitivity profiles, forward and adjoint fluxes are thus meticulously compared using a fine 1968-group energy structure. An OECD international benchmark (Uncertainty Analysis for Criticality Safety Assessment - UACSA - Phase III) is taken as working example to enforce validation and to compare to independent results (e.g. MCNP-6). This benchmark is constituted of two bare spheres filled with homogeneous mixture of uranium and polyethylene (respectively 2% and 50% U-235 enrichments) and gives an overview of issues encountered in thermal reactor cores. Several energy-group structures (1968G, 172G, 33G) are also tested in ERANOS to identify multi-group and implicit effects. Lessons learnt are that continuous Monte Carlo methods seem to be mature and compare well with deterministic codes. Only damper the U-238 elastic - and on certain conditions the U-238 capture - sensitivity coefficient for which difference can reach 30% between TRIPOLI-4 and ERANOS. Indeed concerning U-238, implicit effects are emphasized and multi-group theory remains limited by hypothesis; even a 1968-group structure is not refined enough to properly calculate U-238 elastic scattering k{sub eff}-sensitivity. This reference 3D continuous-energy sensitivity capability in TRIPOLI4-IFP will be extensively used in the uncertainty automated tool RIB of the French Criticality-Safety package CRISTAL. (authors)

42 ENGINEERING↗
DOE OSTI2022

The Impulse Approximation Scattering Function and Its Use in Monte Carlo Photon Transport Simulations

The viability of using the impulse approximation scattering function in Monte Carlo photon transport simulations is explored. This scattering function can be constructed from the double differential incoherent scattering cross section developed by Ribberfors and Berggren. A commonly used method for modeling photon Doppler broadening, which is referred to as the hybrid Doppler broadening method, can also be derived from this cross section. A new photon Doppler broadening method, called the consistent Doppler broadening method, is derived and discussed. This method eliminates some of the commonly employed approximations in the hybrid Doppler broadening method, in part, by using the impulse approximation scattering function. Integrated incoherent cross sections generated using the impulse approximation scattering function and the widely used Waller-Hartree scattering function are in good agreement above 20 keV. Below 20 keV, differences as high as 70% are observed, which differs from the roughly 5% differences observed by Ribberfors for some of the materials. Integral and spectral quantities for two problems are also generated using the Monte Carlo photon transport capabilities of the Framework for REsearch in Nuclear ScIence and Engineering (FRENSIE). Due to the small, relative result differences observed when using the impulse approximation scattering function, it is considered a viable alternative to the Waller-Hartree scattering function. In addition, some small, but expected, differences in spectral fluxes at low energies can be avoided by adopting the consistent Doppler broadening method.

42 ENGINEERING↗
DOE OSTI2014

SU-E-I-93: Improved Imaging Quality for Multislice Helical CT Via Sparsity Regularized Iterative Image Reconstruction Method Based On Tensor Framelet

Purpose: Inspired by compressive sensing, sparsity regularized iterative reconstruction method has been extensively studied. However, its utility pertinent to multislice helical 4D CT for radiotherapy with respect to imaging quality, dose, and time has not been thoroughly addressed. As the beginning of such an investigation, this work carries out the initial comparison of reconstructed imaging quality between sparsity regularized iterative method and analytic method through static phantom studies using a state-of-art 128-channel multi-slice Siemens helical CT scanner. Methods: In our iterative method, tensor framelet (TF) is chosen as the regularization method for its superior performance from total variation regularization in terms of reduced piecewise-constant artifacts and improved imaging quality that has been demonstrated in our prior work. On the other hand, X-ray transforms and its adjoints are computed on-the-fly through GPU implementation using our previous developed fast parallel algorithms with O(1) complexity per computing thread. For comparison, both FDK (approximate analytic method) and Katsevich algorithm (exact analytic method) are used for multislice helical CT image reconstruction. Results: The phantom experimental data with different imaging doses were acquired using a state-of-art 128-channel multi-slice Siemens helical CT scanner. The reconstructed image quality was compared between TF-based iterative method, FDK and Katsevich algorithm with the quantitative analysis for characterizing signal-to-noise ratio, image contrast, and spatial resolution of high-contrast and low-contrast objects. Conclusion: The experimental results suggest that our tensor framelet regularized iterative reconstruction algorithm improves the helical CT imaging quality from FDK and Katsevich algorithm for static experimental phantom studies that have been performed.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

Wind Turbine Rotor Design Using High-Fidelity Aerostructural Optimization

Large wind turbines yield more energy but demand careful aeroelastic blade design. Coupled multiphysics design strategies can reduce wind energy costs by exploiting fluid-structure interactions. This work presents the first high-fidelity aerostructural optimization study of a large wind turbine rotor. We use blade-resolved fluid dynamics and structural solvers in a monolithic gradient-based optimization framework to explore steady-state torque and blade mass tradeoffs. The coupled-adjoint approach computes gradients efficiently, enabling the optimization of over 100 structural and geometric parameters simultaneously. Our optimization study modifies a DTU 10 MW benchmark with a simplified structure and isotropic material properties. The tightly coupled optimizations increase torque by 14% while reducing rotor mass by 9% or reduce blade mass by 27% while maintaining torque. Blade-resolved models provide greater design freedom, enabling 5% higher mass reductions than conventional parameterizations at equal torque. This framework paves the way for more detailed high-fidelity optimization studies to complement conventional design approaches.

17 WIND ENERGY↗