Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “adjoint equation”

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 19 records

Optimization of the Direct Discrete Method Using the Solution of the Adjoint Equation and its Application in the Multi-Group Neutron Diffusion Equation

Obtaining the set of algebraic equations that directly correspond to a physical phenomenon has been viable in the recent direct discrete method (DDM). Although this method may find its roots in physical and geometrical considerations, there are still some degrees of freedom that one may suspect optimize-able. Here we have used the information embedded in the corresponding adjoint equation to form a local functional, which in turn by its minimization, yield suitable dual mesh positioning.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

The Coupled Adjoint-State Equation in forward and inverse linear elasticity: Incompressible plane stress

A persistent challenge present in inverse or parameter estimation problems with interior data is how to deal with uncertainty in the boundary conditions employed in the forward or state model. In this work we focus on a linear plane stress inverse elasticity problem with measured displacement data where one component of the measured displacement field is known with considerably greater precision than the other. This situation is commonly encountered when the displacement field is measured using ultrasound or optical coherence tomography. We present a novel computational formulation in which no displacement or traction boundary conditions are assumed. The formulation results in coupling the state and adjoint equations, that are typically uncoupled when a well-posed state model is available. Two variants of residual-based stabilization are added. Our approach is applied to a simulated data set and experimental data from an ultrasound phantom.

42 ENGINEERING↗

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↗

Unsteady Adjoint of Pressure Loss for a Fundamental Transonic Turbine Vane

High-fidelity simulations, e.g., large eddy simulation (LES), are often needed for accurately predicting pressure losses due to wake mixing and boundary layer development in turbomachinery applications. An unsteady adjoint of high-fidelity simulations is useful for design optimization in such aerodynamic applications. In this paper, we present unsteady adjoint solutions using a large eddy simulation model for an inlet guide vane from von Karman Institute (VKI) using aerothermal objectives. The unsteady adjoint method is effective in capturing the gradient for a short time interval aerothermal objective, whereas the method provides diverging gradients for long time-averaged thermal objectives. As the boundary layer on the suction side near the trailing edge of the vane is turbulent, it poses a challenge for the adjoint solver. The chaotic dynamics cause the adjoint solution to diverge exponentially from the trailing edge region when solved backward in time. This results in the corruption of the sensitivities obtained from the adjoint solutions. An energy analysis of the unsteady compressible Navier–Stokes adjoint equations indicates that adding artificial viscosity to the adjoint equations can dissipate the adjoint energy while potentially maintaining the accuracy of the adjoint sensitivities. Analyzing the growth term of the adjoint energy provides a metric for identifying the regions in the flow where the adjoint term is diverging. Results for the vane obtained from simulations performed on the Titan supercomputer are demonstrated.

Engineering↗

Admitting the Inadmissible: Adjoint Formulation for Incomplete Cost Functionals in Aerodynamic Optimization

We derive the adjoint equations for problems in aerodynamic optimization which are improperly considered as "inadmissible." For example, a cost functional which depends on the density, rather than on the pressure, is considered "inadmissible" for an optimization problem governed by the Euler equations. We show that for such problems additional terms should be included in the Lagrangian functional when deriving the adjoint equations. These terms are obtained from the restriction of the interior PDE to the control surface. Demonstrations of the explicit derivation of the adjoint equations for "inadmissible" cost functionals are given for the potential, Euler, and Navier-Stokes equations.

Arian, Eyal↗

Adjoint Fokker-Planck equation and runaway electron dynamics

The adjoint Fokker-Planck equation method is applied to study the runaway probability function and the expected slowing-down time for highly relativistic runaway electrons, including the loss of energy due to synchrotron radiation. In direct correspondence to Monte Carlo simulation methods, the runaway probability function has a smooth transition across the runaway separatrix, which can be attributed to effect of the pitch angle scattering term in the kinetic equation. However, for the same numerical accuracy, the adjoint method is more efficient than the Monte Carlo method. The expected slowing-down time gives a novel method to estimate the runaway current decay time in experiments. A new result from this work is that the decay rate of high energy electrons is very slow when E is close to the critical electric field. This effect contributes further to a hysteresis previously found in the runaway electron population.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An Efficient Parallel-in-Time Method for Optimization with Parabolic PDEs

To solve optimization problems with parabolic PDE constraints, often methods working on the reduced objective functional are used. They are computationally expensive due to the necessity of solving both the state equation and a backward-in-time adjoint equation to evaluate the reduced gradient in each iteration of the optimization method. In this study, we investigate the use of the parallel-in-time method PFASST in the setting of PDE-constrained optimization. In order to develop an efficient fully time-parallel algorithm, we discuss different options for applying PFASST to adjoint gradient computation, including the possibility of doing PFASST iterations on both the state and the adjoint equations simultaneously. Here, we also explore the additional gains in efficiency from reusing information from previous optimization iterations when solving each equation. Numerical results for both a linear and a nonlinear reaction-diffusion optimal control problem demonstrate the parallel speedup and efficiency of different approaches.

97 MATHEMATICS AND COMPUTING↗

Application of adjoint operators to neural learning

A technique for the efficient analytical computation of such parameters of the neural architecture as synaptic weights and neural gain is presented as a single solution of a set of adjoint equations. The learning model discussed concentrates on the adiabatic approximation only. A problem of interest is represented by a system of N coupled equations, and then adjoint operators are introduced. A neural network is formalized as an adaptive dynamical system whose temporal evolution is governed by a set of coupled nonlinear differential equations. An approach based on the minimization of a constrained neuromorphic energylike function is applied, and the complete learning dynamics are obtained as a result of the calculations.

Barhen, J.↗

Learning a trajectory using adjoint functions and teacher forcing

A new methodology for faster supervised temporal learning in nonlinear neural networks is presented which builds upon the concept of adjoint operators to allow fast computation of the gradients of an error functional with respect to all parameters of the neural architecture, and exploits the concept of teacher forcing to incorporate information on the desired output into the activation dynamics. The importance of the initial or final time conditions for the adjoint equations is discussed. A new algorithm is presented in which the adjoint equations are solved simultaneously (i.e., forward in time) with the activation dynamics of the neural network. We also indicate how teacher forcing can be modulated in time as learning proceeds. The results obtained show that the learning time is reduced by one to two orders of magnitude with respect to previously published results, while trajectory tracking is significantly improved. The proposed methodology makes hardware implementation of temporal learning attractive for real-time applications.

Toomarian, Nikzad B.↗

Optimization of wind plant layouts using an adjoint approach

Abstract. Using adjoint optimization and three-dimensional steady-state Reynolds-averaged Navier–Stokes (RANS) simulations, we present a new gradient-based approach for optimally siting wind turbines within utility-scale wind plants. By solving the adjoint equations of the flow model, the gradients needed for optimization are found at a cost that is independent of the number of control variables, thereby permitting optimization of large wind plants with many turbine locations. Moreover, compared to the common approach of superimposing prescribed wake deficits onto linearized flow models, the computational efficiency of the adjoint approach allows the use of higher-fidelity RANS flow models which can capture nonlinear turbulent flow physics within a wind plant. The steady-state RANS flow model is implemented in the Python finite-element package FEniCS and the derivation and solution of the discrete adjoint equations are automated within the dolfin-adjoint framework. Gradient-based optimization of wind turbine locations is demonstrated for idealized test cases that reveal new optimization heuristics such as rotational symmetry, local speedups, and nonlinear wake curvature effects. Layout optimization is also demonstrated on more complex wind rose shapes, including a full annual energy production (AEP) layout optimization over 36 inflow directions and 5 wind speed bins.

17 WIND ENERGY↗

Low-thrust trajectory analysis for the geosynchronous mission

Methodology employed in development of a computer program designed to analyze optimal low-thrust trajectories is described, and application of the program to a Solar Electric Propulsion Stage (SEPS) geosynchronous mission is discussed. To avoid the zero inclination and eccentricity singularities which plague many small-force perturbation techniques, a special set of state variables (equinoctial) is used. Adjoint equations are derived for the minimum time problem and are also free from the singularities. Solutions to the state and adjoint equations are obtained by both orbit averaging and precision numerical integration; an evaluation of these approaches is made.

Jasper, T. P.↗

A Maximum Principle for SDEs of Mean-Field Type

We study the optimal control of a stochastic differential equation (SDE) of mean-field type, where the coefficients are allowed to depend on some functional of the law as well as the state of the process. Moreover the cost functional is also of mean-field type, which makes the control problem time inconsistent in the sense that the Bellman optimality principle does not hold. Under the assumption of a convex action space a maximum principle of local form is derived, specifying the necessary conditions for optimality. These are also shown to be sufficient under additional assumptions. This maximum principle differs from the classical one, where the adjoint equation is a linear backward SDE, since here the adjoint equation turns out to be a linear mean-field backward SDE. As an illustration, we apply the result to the mean-variance portfolio selection problem.

97 MATHEMATICS AND COMPUTING↗

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↗

A General Stochastic Maximum Principle for SDEs of Mean-field Type

We study the optimal control for stochastic differential equations (SDEs) of mean-field type, in which the coefficients depend on the state of the solution process as well as of its expected value. Moreover, the cost functional is also of mean-field type. This makes the control problem time inconsistent in the sense that the Bellman optimality principle does not hold. For a general action space a Peng's-type stochastic maximum principle (Peng, S.: SIAM J. Control Optim. 2(4), 966-979, 1990) is derived, specifying the necessary conditions for optimality. This maximum principle differs from the classical one in the sense that here the first order adjoint equation turns out to be a linear mean-field backward SDE, while the second order adjoint equation remains the same as in Peng's stochastic maximum principle.

97 MATHEMATICS AND COMPUTING↗

An adjoint method for a high-order discretization of deforming domain conservation laws for optimization of flow problems

We report the fully discrete adjoint equations and the corresponding adjoint method are derived for a globally high-order accurate discretization of conservation laws on parametrized, deforming domains. The conservation law on the deforming domain is transformed into one on a fixed reference domain by the introduction of a time-dependent mapping that encapsulates the domain deformation and parametrization, resulting in an Arbitrary Lagrangian–Eulerian form of the governing equations. A high-order discontinuous Galerkin method is used to discretize the transformed equation in space and a high-order diagonally implicit Runge–Kutta scheme is used for the temporal discretization. Quantities of interest that take the form of space–time integrals are discretized in a solver-consistent manner. The corresponding fully discrete adjoint method is used to compute exact gradients of quantities of interest along the manifold of solutions of the fully discrete conservation law. These quantities of interest and their gradients are used in the context of gradient-based PDE-constrained optimization. The adjoint method is used to solve two optimal shape and control problems governed by the isentropic, compressible Navier–Stokes equations. The first optimization problem seeks the energetically optimal trajectory of a 2D airfoil given a required initial and final spatial position. The optimization solver, driven by gradients computed via the adjoint method, reduced the total energy required to complete the specified mission nearly an order of magnitude. The second optimization problem seeks the energetically optimal flapping motion and time-morphed geometry of a 2D airfoil given an equality constraint on the x-directed impulse generated on the airfoil. The optimization solver satisfied the impulse constraint to greater than 8 digits of accuracy and reduced the required energy between a factor of 2 and 10, depending on the value of the impulse constraint, as compared to the nominal configuration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Calculation of Prompt Fission Neutron Lifetimes by the Monte Carlo Method

An algorithm for calculation of prompt fission neutron lifetimes in a nuclear reactor by the Monte Carlo method is described. Evaluation of the importance function is carried out with solution of the neutron transport equation without solving the adjoint equation. The results of the prompt neutron lifetime calculations performed within some critical experiments are presented and compared with the experimental results.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗