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 55 records · Page 3

Shape optimization governed by the Euler equations using an adjoint method

A numerical approach for the treatment of optimal shape problems governed by the Euler equations is discussed. Focus is on flows with embedded shocks. A very simple problem is considered: the design of a quasi-one-dimensional Laval nozzle. A cost function and a set of Lagrange multipliers are introduced to achieve the minimum. The nature of the resulting costate equations is discussed. A theoretical difficulty that arises for cases with embedded shocks is pointed out and solved. Finally, some results are given to illustrate the effectiveness of the method.

Iollo, Angelo↗

Combined assimilation of hydrography and TOPEX data into an Indian Ocean GCM using the adjoint method

To study seasonal circulation and meridional heat transport of the Indian Ocean by synthesizing dynamics with data, climatological monthly temperatures and salinities, surface heat and freshewater fluxes, and wind stresses, together with monthly ensembles of three years (93-95) of TOPEX-derived surface geostrophic velocity anomalies, are assimilated into an Indian Ocean GCM.

Hydrography Indian Ocean TOPEX meridional heat tra↗

Adjoint Algorithm for CAD-Based Shape Optimization Using a Cartesian Method

Adjoint solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape optimization. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (geometric parameters that control the shape). More recently, emerging adjoint applications focus on the analysis problem, where the adjoint solution is used to drive mesh adaptation, as well as to provide estimates of functional error bounds and corrections. The attractive feature of this approach is that the mesh-adaptation procedure targets a specific functional, thereby localizing the mesh refinement and reducing computational cost. Our focus is on the development of adjoint-based optimization techniques for a Cartesian method with embedded boundaries.12 In contrast t o implementations on structured and unstructured grids, Cartesian methods decouple the surface discretization from the volume mesh. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin et 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. Central to automated shape optimization algorithms is the issue of geometry modeling and control. The need to optimize complex, "real-life" geometry provides a strong incentive for the use of parametric-CAD systems within the optimization procedure. In previous work, we presented an effective optimization framework that incorporates a direct-CAD interface. In this work, we enhance the capabilities of this framework with efficient gradient computations using the discrete adjoint method. We present details of the adjoint numerical implementation, which reuses the domain decomposition, multigrid, and time-marching schemes of the flow solver. Furthermore, we explain and demonstrate the use of CAD in conjunction with the Cartesian adjoint approach. The final paper will contain a number of complex geometry, industrially relevant examples with many design variables to demonstrate the effectiveness of the adjoint method on Cartesian meshes.

Nemec, Marian↗

The fast neutron fluence and the activation detector activity calculations using the effective source method and the adjoint function

This paper describes the application of effective source in forward calculations and the adjoint method to the solution of fast neutron fluence and activation detector activities in the reactor pressure vessel (RPV) and RPV cavity of a VVER-440 reactor. Its objective is the demonstration of both methods on a practical task. The effective source method applies the Boltzmann transport operator to time integrated source data in order to obtain neutron fluence and detector activities. By weighting the source data by time dependent decay of the detector activity, the result of the calculation is the detector activity. Alternatively, if the weighting is uniform with respect to time, the result is the fluence. The approach works because of the inherent linearity of radiation transport in non-multiplying time-invariant media. Integrated in this way, the source data are referred to as the effective source. The effective source in the forward calculations method thereby enables the analyst to replace numerous intensive transport calculations with a single transport calculation in which the time dependence and magnitude of the source are correctly represented. In this work, the effective source method has been expanded slightly in the following way: neutron source data were performed with few group method calculation using the active core calculation code MOBY-DICK. The follow-up neutron transport calculation was performed using the neutron transport code TORT to perform multigroup calculations. For comparison, an alternative method of calculation has been used based upon adjoint functions of the Boltzmann transport equation. Calculation of the three-dimensional (3-D) adjoint function for each required computational outcome has been obtained using the deterministic code TORT and the cross section library BGL440. Adjoint functions appropriate to the required fast neutron flux density and neutron reaction rates have been calculated for several significant points within the RPV and RPV cavity of the VVER-440 reacto rand located axially at the position of maximum power and at the position of the weld. Both of these methods (the effective source and the adjoint function) are briefly described in the present paper. The paper also describes their application to the solution of fast neutron fluence and detectors activities for the VVER-440 reactor. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Local-in-Time Adjoint-Based Method for Optimal Control/Design Optimization of Unsteady Compressible Flows

.We study local-in-time adjoint-based methods for minimization of ow matching functionals subject to the 2-D unsteady compressible Euler equations. The key idea of the local-in-time method is to construct a very accurate approximation of the global-in-time adjoint equations and the corresponding sensitivity derivative by using only local information available on each time subinterval. In contrast to conventional time-dependent adjoint-based optimization methods which require backward-in-time integration of the adjoint equations over the entire time interval, the local-in-time method solves local adjoint equations sequentially over each time subinterval. Since each subinterval contains relatively few time steps, the storage cost of the local-in-time method is much lower than that of the global adjoint formulation, thus making the time-dependent optimization feasible for practical applications. The paper presents a detailed comparison of the local- and global-in-time adjoint-based methods for minimization of a tracking functional governed by the Euler equations describing the ow around a circular bump. Our numerical results show that the local-in-time method converges to the same optimal solution obtained with the global counterpart, while drastically reducing the memory cost as compared to the global-in-time adjoint formulation.

Yamaleev, N. K.↗

Adjoint-Based Methods for Estimating CO2 Sources and Sinks from Atmospheric Concentration Data

Work to develop adjoint-based methods for estimating CO2 sources and sinks from atmospheric concentration data was initiated in preparation for last year's summer institute on Carbon Data Assimilation (CDAS) at the National Center for Atmospheric Research in Boulder, CO. The workshop exercises used the GSFC Parameterized Chemistry and Transport Model and its adjoint. Since the workshop, a number of simulations have been run to evaluate the performance of the model adjoint. Results from these simulations will be presented, along with an outline of challenges associated with incorporating a variety of disparate data sources, from sparse, but highly precise, surface in situ observations to less accurate, global future satellite observations.

Andrews, Arlyn E.↗

An adjoint-based method for optimising MHD equilibria against the infinite- n , ideal ballooning mode

We demonstrate a fast adjoint-based method to optimise tokamak and stellarator equilibria against a pressure-driven instability known as the infinite-n ideal ballooning mode. We present three finite-β (the ratio of thermal to magnetic pressure) equilibria: one tokamak equilibrium and two stellarator equilibria that are unstable against the ballooning mode. Using the self-adjoint property of ideal magnetohydrodynamics, we construct a technique to rapidly calculate the change in the eigenvalue, a measure of ideal ballooning instability. Using the SIMSOPT optimisation framework, we then implement our fast adjoint gradient-based optimiser to minimise the eigenvalue and find stable equilibria for each of the three originally unstable equilibria.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

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↗

Adjoint variational methods in nonconservative stability problems.

A general nonself-adjoint eigenvalue problem is examined and it is shown that the commonly employed approximate methods, such as the Galerkin procedure, the method of weighted residuals and the least square technique lack variational descriptions. When used in their previously known forms they do not yield stationary eigenvalues and eigenfunctions. With the help of an adjoint system, however, several analogous variational descriptions may be developed and it is shown in the present study that by properly restating the method of least squares, stationary eigenvalues may be obtained. Several properties of the adjoint eigenvalue problem, known only for a restricted group, are shown to exist for the more general class selected for study.

Prasad, S. N.↗

Adjoint-Based Methodology for Time-Dependent Optimization

This paper presents a discrete adjoint method for a broad class of time-dependent optimization problems. The time-dependent adjoint equations are derived in terms of the discrete residual of an arbitrary finite volume scheme which approximates unsteady conservation law equations. Although only the 2-D unsteady Euler equations are considered in the present analysis, this time-dependent adjoint method is applicable to the 3-D unsteady Reynolds-averaged Navier-Stokes equations with minor modifications. The discrete adjoint operators involving the derivatives of the discrete residual and the cost functional with respect to the flow variables are computed using a complex-variable approach, which provides discrete consistency and drastically reduces the implementation and debugging cycle. The implementation of the time-dependent adjoint method is validated by comparing the sensitivity derivative with that obtained by forward mode differentiation. Our numerical results show that O(10) optimization iterations of the steepest descent method are needed to reduce the objective functional by 3-6 orders of magnitude for test problems considered.

Yamaleev, N. K.↗

An Exact Dual Adjoint Solution Method for Turbulent Flows on Unstructured Grids

An algorithm for solving the discrete adjoint system based on an unstructured-grid discretization of the Navier-Stokes equations is presented. The method is constructed such that an adjoint solution exactly dual to a direct differentiation approach is recovered at each time step, yielding a convergence rate which is asymptotically equivalent to that of the primal system. The new approach is implemented within a three-dimensional unstructured-grid framework and results are presented for inviscid, laminar, and turbulent flows. Improvements to the baseline solution algorithm, such as line-implicit relaxation and a tight coupling of the turbulence model, are also presented. By storing nearest-neighbor terms in the residual computation, the dual scheme is computationally efficient, while requiring twice the memory of the flow solution. The scheme is expected to have a broad impact on computational problems related to design optimization as well as error estimation and grid adaptation efforts.

Nielsen, Eric J.↗