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 253 records · Page 14

Methods for Detector Placement and Analysis of Criticality Accident Alarm Systems

Determining the optimum placement to minimize the number of detectors for a criticality accident alarm system (CAAS) in a large manufacturing facility is a complex problem. There is typically a target for the number of detectors that can be used over a given zone of the facility. A study to optimize detector placement typically begins with some initial guess at the placement of the detectors and is followed by either predictive calculations of accidents at specific locations or adjoint calculations based on preferred detector locations. Within an area of a facility, there may be a large number of potential criticality accident sites. For any given placement of the detectors, the list of accident sites can be reduced to a smaller number of locations at which accidents may be difficult for detectors to detect. Developing the initial detector placement and determining the list of difficult accident locations are both based on the practitioner's experience. Simulations following fission particles released from an accident location are called 'forward calculations.' These calculations can be used to answer the question 'where would an alarm be triggered?' by an accident at a specified location. Conversely, 'adjoint calculations' start at a detector site using the detector response function as a source and essentially run in reverse. These calculations can be used to answer the question 'where would an accident be detected?' by a specified detector location. If the number of accidents, P, is much less than the number of detectors, Q, then forward simulations may be more convenient and less time-consuming. If Q is large or the detectors are not placed yet, then a mesh tally of dose observed by a detector at any location must be computed over the entire zone. If Q is much less than P, then adjoint calculations may be more efficient. Adjoint calculations employing a mesh tally can be even more advantageous because they do not rely on a list of specific difficult-to-detect accident sites, which may not have included every possible accident location. Analog calculations (no biasing) simply follow particles naturally. For sparse buildings and line-of-sight calculations, analog Monte Carlo (MC) may be adequate. For buildings with internal walls or large amounts of heavy equipment (dense geometry), variance reduction may be required. Calculations employing the CADIS method use a deterministic calculation to create an importance map and a matching biased source distribution that optimize the final MC to quickly calculate one specific tally. Calculations employing the FW-CADIS method use two deterministic calculations (one forward and one adjoint) to create an importance map and a matching biased source distribution that are designed to make the MC calculate a mesh tally with more uniform uncertainties in both high-dose and low-dose areas. Depending on the geometry of the problem, the number of detectors, and the number of accident sites, different approaches to CAAS placement studies can be taken. These are summarized in Table I. SCALE 6.1 contains the MAVRIC sequence, which can be used to perform any of the forward-based approaches outlined in Table I. For analog calculations, MAVRIC simply calls the Monaco MC code. For CADIS and FW-CADIS, MAVRIC uses the Denovo discrete ordinates (SN) deterministic code to generate the importance map and biased source used by Monaco. An adjoint capability is currently being added to Monaco and should be available in the next release of SCALE. An adjoint-based approach could be performed with Denovo alone - although fine meshes, large amounts of memory, and long computation times may be required to obtain accurate solutions. Coarse-mesh SN simulations could be employed for adjoint-based scoping studies until the adjoint capability in Monaco is complete. CAAS placement studies, especially those dealing with mesh tallies, require some extra utilities to aid in the analysis. Detectors must receive a minimum dose rate in order to alarm; therefore, a simple yes/no plot could be more useful to the analyst than a standard dose rate contour plot. Alarm systems that require several detectors to alarm simultaneously for a given accident would need to combine several yes/no plots in order to show accident sites where multiple detectors would be triggered. This could require a plot of 'areas of coverage' that is mapped over the building geometry. Several new utilities (which will be part of SCALE 6.2) were created to help with CAAS analysis.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A scalable matrix-free spectral element approach for unsteady PDE constrained optimization using PETSc/TAO

In this work, we provide a new approach for the efficient matrix-free application of the transpose of the Jacobian for the spectral element method for the adjoint-based solution of partial differential equation (PDE) constrained optimization. This results in optimizations of nonlinear PDEs using explicit integrators where the integration of the adjoint problem is not more expensive than the forward simulation. Solving PDE constrained optimization problems entails combining expertise from multiple areas, including simulation, computation of derivatives, and optimization. The Portable, Extensible Toolkit for Scientific computation (PETSc) together with its companion package, the Toolkit for Advanced Optimization (TAO), is an integrated numerical software library that contains an algorithmic/software stack for solving linear systems, nonlinear systems, ordinary differential equations, differential algebraic equations, and large-scale optimization problems and, as such, is an ideal tool for performing PDE-constrained optimization. This paper describes an efficient approach in which the software stack provided by PETSc/TAO can be used for large-scale nonlinear time-dependent problems. Time integration can involve a range of high-order methods, both implicit and explicit. The PDE-constrained optimization algorithm used is gradient-based and seamlessly integrated with the simulation of the physical problem.

97 MATHEMATICS AND COMPUTING↗

A theoretical approach for analyzing the restabilization of wakes

Recently reported experimental results demonstrate that restabilization of the low-Reynolds-number flow past a circular cylinder can be achieved by the placement of a smaller cylinder in the wake of the first at particular locations. Traditional numerical procedures for modeling such phenomena are computationally expensive. An approach is presented here in which the properties of the adjoint solutions to the linearized equations of motion are exploited to map quickly the best positions for the small cylinder's placement. Comparisons with experiment and previous computations are favorable. The approach is shown to be applicable to general flows, illustrating how strongly control mechanisms that involve sources of momentum couple to unstable (or stable) modes of the system.

Hill, D. C.↗

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↗

Uniqueness of MHV Gravity Amplitudes

We investigate MHV tree-level gravity amplitudes as defined on the spinor-helicity variety. Unlike their gluon counterparts, the gravity amplitudes do not have logarithmic singularities and do not admit Amplituhedron-like construction. Importantly, they are not determined just by their singularities, but rather their numerators have interesting zeroes. We make a conjecture about the uniqueness of the numerator and explore this feature from a more mathematical perspective. This leads us to a new approach for examining adjoints. We outline steps of our proposed proof and provide computational evidence for its validity in specific cases.

adjoints↗

Consistent Adjoint Driven Importance Sampling using Space, Energy and Angle

For challenging radiation transport problems, hybrid methods combine the accuracy of Monte Carlo methods with the global information present in deterministic methods. One of the most successful hybrid methods is CADIS Consistent Adjoint Driven Importance Sampling. This method uses a deterministic adjoint solution to construct a biased source distribution and consistent weight windows to optimize a specific tally in a Monte Carlo calculation. The method has been implemented into transport codes using just the spatial and energy information from the deterministic adjoint and has been used in many applications to compute tallies with much higher figures-of-merit than analog calculations. CADIS also outperforms user-supplied importance values, which usually take long periods of user time to develop. This work extends CADIS to develop weight windows that are a function of the position, energy, and direction of the Monte Carlo particle. Two types of consistent source biasing are presented: one method that biases the source in space and energy while preserving the original directional distribution and one method that biases the source in space, energy, and direction. Seven simple example problems are presented which compare the use of the standard space/energy CADIS with the new space/energy/angle treatments.

Peplow, Douglas E.↗

Generalized Perturbation Theory-Free Sensitivity Analysis for Eigenvalue Problems

Generalized perturbation theory (GPT) has been recognized as the most computationally efficient approach for performing sensitivity analysis for models with many input parameters, which renders forward sensitivity analysis computationally overwhelming. In critical systems, GPT involves the solution of the adjoint form of the eigenvalue problem with a response-dependent fixed source. Although conceptually simple to implement, most neutronics codes that can solve the adjoint eigenvalue problem do not have a GPT capability unless envisioned during code development. We introduce in this manuscript a reduced-order modeling approach based on subspace methods that requires the solution of the fundamental adjoint equations but allows the generation of response sensitivities without the need to set up GPT equations, and that provides an estimate of the error resulting from the reduction. Moreover, the new approach solves the eigenvalue problem independently of the number or type of responses. This allows for an efficient computation of sensitivities when many responses are required. This paper introduces the theory and implementation details of the GPT-free approach and describes how the errors could be estimated as part of the analysis. The applicability is demonstrated by estimating the variations in the flux distribution everywhere in the phase space of a fast critical sphere and a high-temperature gas-cooled reactor prismatic lattice. The variations generated by the GPT-free approach are benchmarked to the exact variations generated by direct forward perturbations.

99 GENERAL AND MISCELLANEOUS↗

Adaptive mesh refinement for steady flows in Nek5000

Adaptive mesh refinement is performed in the framework of the spectral element method augmented by approaches to error estimation and control. The h-refinement technique is used for adapting the mesh, where selected grid elements are split by a quadtree (2D) or octree (3D) structure. Continuity between parent-child elements is enforced by high-order interpolation of the solution across the common faces. Parallel mesh partitioning and grid management respectively, are taken care of by the external libraries ParMETIS and p4est. Two methods are considered for estimating and controlling the error of the solution. The first error estimate is local and based on the spectral properties of the solution on each element. This method gives a local measure of the L-2-norm of the solution over the entire computational domain. The second error estimate uses the dual-weighted residuals method - it is based on and takes into account both the local properties of the solution and the global dependence of the error in the solution via an adjoint problem. The objective of this second approach is to optimize the computation of a given functional of physical interest. The simulations are performed by using the code Nek5000 and three steady-state test cases are studied: a two-dimensional lid-driven cavity at Re = 7, 500, a two-dimensional flow past a cylinder at Re = 40, and a three-dimensional lid-driven cavity at Re = 2,000 with a moving lid tilted by an angle of 30 degrees. Finally, the efficiency of both error estimators is compared in terms of refinement patterns and accuracy on the functional of interest. In the case of the adjoint error estimators, the trend on the error of the functional is shown to be correctly represented up to a multiplicative constant.

42 ENGINEERING↗

Numerical Simulations of a Quiet SuperSonic Technology (QueSST) Aircraft Preliminary Design

Reynolds Averaged Navier-Stokes (RANS) simulations were performed on a Lockheed Martin Quiet SuperSonic Technology (QueSST) aircraft preliminary design to assess inlet performance. The FUN3D flow solver and its adjoint-based grid refinement capability were used for the simulations in hopes of determining internal "best practices" for predicting inlet performance on top-aft-mounted inlets. Several parameters were explored including tetrahedral vs. pentahedral cells in/around the boundary-layer regions, an engine axis-aligned linear pressure sensor vs. a pressure box objective as the grid adaptation metric, and the number of grid adaptation cycles performed. Additional simulations were performed on manually refined grids for comparison with the adjoint-based adapted grids. Results showed poor agreement in predicted inlet performance on the refined grids compared to experimental data. This was true regardless of whether the refinement was adjoint-based or manual, the cell type in/near the boundary-layer regions, or the grid adaptation metric used. In addition, the 40-probe total pressure recovery was shown to decrease asymptotically as the number of adaptation cycles is increased. Solutions on the unadapted grids generally had better agreement with experimental data than their refined grid counterparts.

Inlet Performance↗

Adjoint approach to calculating shape gradients for three-dimensional magnetic confinement equilibria

The shape gradient quantifies the change in some figure of merit resulting from differential perturbations to a shape. Shape gradients can be applied to gradient-based optimization, sensitivity analysis and tolerance calculation. An efficient technique for computing the shape gradient for toroidal three-dimensional magnetohydrodynamic (MHD) equilibria is introduced. The method is based on the self-adjoint property of the equations for driven perturbations of MHD equilibria and is similar to the Onsager symmetry of transport coefficients. Two versions of the shape gradient are considered. One describes the change in a figure of merit due to an arbitrary displacement of the outer flux surface; the other describes the change in the figure of merit due to the displacement of a coil. The method is implemented for several example figures of merit and compared with direct calculation of the shape gradient. In these examples the adjoint method reduces the number of equilibrium computations by factors of $O(N)$ , where $N$ is the number of parameters used to describe the outer flux surface or coil shapes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Discrete Adjoint-Based Design Optimization of Unsteady Turbulent Flows on Dynamic Unstructured Grids

An adjoint-based methodology for design optimization of unsteady turbulent flows on dynamic unstructured grids is described. The implementation relies on an existing unsteady three-dimensional unstructured grid solver capable of dynamic mesh simulations and discrete adjoint capabilities previously developed for steady flows. The discrete equations for the primal and adjoint systems are presented for the backward-difference family of time-integration schemes on both static and dynamic grids. The consistency of sensitivity derivatives is established via comparisons with complex-variable computations. The current work is believed to be the first verified implementation of an adjoint-based optimization methodology for the true time-dependent formulation of the Navier-Stokes equations in a practical computational code. Large-scale shape optimizations are demonstrated for turbulent flows over a tiltrotor geometry and a simulated aeroelastic motion of a fighter jet.

Nielsen, Eric J.↗

Linearized Frequency-Domain Gust Analysis and Adjoint-Based Sensitivities

Gust analysis is added to a linearized frequency-domain method in FUN3D, a NASA computational fluid dynamics solver. The method linearizes about a nonlinear static equilibrium condition and is therefore appropriate for problems with small perturbations such as transonic stochastic gust analysis. In addition to the gust analysis, adjoint-based sensitivities of stochastic gust constraints are implemented for multidisciplinary design optimization. The linearized frequency-domain gust model and adjoint-based sensitivities are described and verified. The method is applied to an optimization for mass minimization of the AGARD 445.6 wing subject to a stochastic gust constraint limiting the displacement of the wing tip.

Aeroelasticity↗

Sensitivity analysis of a model of CO2 exchange in tundra ecosystems by the adjoint method

A model of net primary production (NPP), decomposition, and nitrogen cycling in tundra ecosystems has been developed. The adjoint technique is used to study the sensitivity of the computed annual net CO2 flux to perturbation in initial conditions, climatic inputs, and model's main parameters describing current seasonal CO2 exchange in wet sedge tundra at Barrow, Alaska. The results show that net CO2 flux is most sensitive to parameters characterizing litter chemical composition and more sensitive to decomposition parameters than to NPP parameters. This underlines the fact that in nutrient-limited ecosystems, decomposition drives net CO2 exchange by controlling mineralization of main nutrients. The results also indicate that the short-term (1 year) response of wet sedge tundra to CO2-induced warming is a significant increase in CO2 emission, creating a positive feedback to atmosphreic CO2 accumulation. However, a cloudiness increase during the same year can severely alter this response and lead to either a slight decrease or a strong increase in emitted CO2, depending on its exact timing. These results demonstrate that the adjoint method is well suited to study systems encountering regime changes, as a single run of the adjoint model provides sensitivities of the net CO2 flux to perturbations in all parameters and variables at any time of the year. Moreover, it is shown that large errors due to the presence of thresholds can be avoided by first delimiting the range of applicability of the adjoint results.

Waelbroek, C.↗

A Sparse-Grid Probabilistic Scheme for Approximation of the Runaway Probability of Electrons in Fusion Tokamak Simulation

Runaway electrons (RE) generated during magnetic disruptions present a major threat to the safe operation of plasma nuclear fusion reactors. A critical aspect of understanding RE dynamics is to calculate the runaway probability, i.e., the probability that an electron in the phase space will runaway on, or before, a prescribed time. Such probability can be obtained by solving the adjoint equation of the underlying Fokker-Planck equation that controls the electron dynamics. In this effort, we present a sparse-grid probabilistic scheme for computing the runaway probability. The key ingredient of our approach is to represent the solution of the adjoint equation as a conditional expectation, such that discretizing the differential operator reduces to the approximation of a set of integrals. Adaptive sparse grid interpolation is utilized to approximate the map from the phase space to the runaway probability. The main novelties of this effort are the integration of the sparse-grid method into the probabilistic numerical scheme for computing escape probability, and the application of the proposed method in computing RE probabilities. Two numerical examples are given to illustrate that the proposed method can achieve O(Δt) convergence, and that the local anisotropic adaptive refinement strategy (M. Stoyanov, Adaptive sparse grid construction in a context of local anisotropy and multiple hierarchical parents. In: Sparse Grids and Applications-Miami 2016, Springer, Berlin, 2018, pp. 175–199) can effectively handle the sharp transition layer between the runaway and non-runaway regions.

Yang, Minglei↗

Aerodynamic Shape Optimization of Complex Aircraft Configurations via an Adjoint Formulation

This work describes the implementation of optimization techniques based on control theory for complex aircraft configurations. Here control theory is employed to derive the adjoint differential equations, the solution of which allows for a drastic reduction in computational costs over previous design methods (13, 12, 43, 38). In our earlier studies (19, 20, 22, 23, 39, 25, 40, 41, 42) it was shown that this method could be used to devise effective optimization procedures for airfoils, wings and wing-bodies subject to either analytic or arbitrary meshes. Design formulations for both potential flows and flows governed by the Euler equations have been demonstrated, showing that such methods can be devised for various governing equations (39, 25). In our most recent works (40, 42) the method was extended to treat wing-body configurations with a large number of mesh points, verifying that significant computational savings can be gained for practical design problems. In this paper the method is extended for the Euler equations to treat complete aircraft configurations via a new multiblock implementation. New elements include a multiblock-multigrid flow solver, a multiblock-multigrid adjoint solver, and a multiblock mesh perturbation scheme. Two design examples are presented in which the new method is used for the wing redesign of a transonic business jet.

Reuther, James↗

Comparison of some optimal control methods for the design of turbine blades

This paper attempts a comparative study of some numerical methods for the optimal control design of turbine blades whose vibration characteristics are approximated by Timoshenko beam idealizations with shear and incorporating simple boundary conditions. The blade was synthesized using the following methods: (1) conjugate gradient minimization of the system Hamiltonian in function space incorporating penalty function transformations, (2) projection operator methods in a function space which includes the frequencies of vibration and the control function, (3) epsilon-technique penalty function transformation resulting in a highly nonlinear programming problem, (4) finite difference discretization of the state equations again resulting in a nonlinear program, (5) second variation methods with complex state differential equations to include damping effects resulting in systems of inhomogeneous matrix Riccatti equations some of which are stiff, (6) quasi-linear methods based on iterative linearization of the state and adjoint equation. The paper includes a discussion of some substantial computational difficulties encountered in the implementation of these techniques together with a resume of work presently in progress using a differential dynamic programming approach.

Desilva, B. M. E.↗

Distributed Blowing and Suction for the Purpose of Streak Control in a Boundary Layer Subjected to a Favorable Pressure Gradient

An analysis of the optimal control by blowing and suction in order to generate stream- wise velocity streaks is presented. The problem is examined using an iterative process that employs the Parabolized Stability Equations for an incompressible uid along with its adjoint equations. In particular, distributions of blowing and suction are computed for both the normal and tangential velocity perturbations for various choices of parameters.

Forgoston, Eric↗

Optimization of a neutron detector design using adjoint transport simulation

A synthetic aperture approach has been developed and investigated for Special Nuclear Materials (SNM) detection in vehicles passing a checkpoint at highway speeds. SNM is postulated to be stored in a moving vehicle and detector assemblies are placed on the road-side or in chambers embedded below the road surface. Neutron and gamma spectral awareness is important for the detector assembly design besides high efficiencies, so that different SNMs can be detected and identified with various possible shielding settings. The detector assembly design is composed of a CsI gamma-ray detector block and five neutron detector blocks, with peak efficiencies targeting different energy ranges determined by adjoint simulations. In this study, formulations are derived using adjoint transport simulations to estimate detector efficiencies. The formulations is applied to investigate several neutron detector designs for Block IV, which has its peak efficiency in the thermal range, and Block V, designed to maximize the total neutron counts over the entire energy spectrum. Other Blocks detect different neutron energies. All five neutron detector blocks and the gamma-ray block are assembled in both MCNP and deterministic simulation models, with detector responses calculated to validate the fully assembled design using a 30-group library. The simulation results show that the 30-group library, collapsed from an 80-group library using an adjoint-weighting approach with the YGROUP code, significantly reduced the computational cost while maintaining accuracy. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗