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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

A Full Multigrid Method for the Self-Adjoint Angular Flux Equation Based on Cellwise Block Jacobi Iteration

Previous work by Densmore et al. has demonstrated that multigrid methods for the self-adjoint angular flux (SAAF) equation with cellwise block Jacobi smoothing can be extremely effective at solving for the angular flux in one dimension. The extension of that work to two dimensions demonstrated that while the smoother works well, the use of a direct coarse-grid approximation can severely limit the rate of convergence for optically thin cells. In that paper, this convergence limit was evaded through the use of a partially Galerkin coarse-grid approximation. However, relying on a Galerkin coarse-grid approximation is not ideal as constructing the coarse-grid discretization in this approach is complicated. The motivation for this summary is to find a method that can work without the need for a Galerkin coarse-grid approximation. The Full Multigrid (FMG) method is well known as a method that can theoretically solve a problem to its discretization accuracy with optimal linear computational complexity, that is in just O(N) operations for N unknowns. Indeed, we develop an FMG method for the 2-D SAAF equation that yields discretization accuracy and does not require the use of a Galerkin coarse-grid approximation. Until recently, aside from proofs about the order of the error for FMG, little work had been done in quantifying when and how FMG can obtain discretization accuracy. However, recent work by Rodrigo et al. has introduced a Fourier analysis technique called worst-case right-hand side analysis used to calculate the FMG accuracy measure. The FMG accuracy measure is the upper bound on the constant of proportionality between the error of the FMG solution and the discretization error. In this summary, we develop and implement an FMG method for the 2-D Cartesian SAAF equations. We then perform worst-case right-hand side analysis and give numerical examples that demonstrate under what circumstances the method can solve the 2-D SAAF equations to discretization accuracy, for optically thin cells, without the need for a Galerkin coarse-grid approximation. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
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, anisotropic metric construction methods, and anisotropic mesh adaptation mechanics. A key ingredient for the broader acceptance of unstructured mesh adaptation is the verification of these implementations. Anisotropic metric construction methods are evaluated with analytically defined primal fields and the corresponding entropy variables as 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. The convergence of the output associated with the entropy variable adjoint is studied for mesh adaptation to these fields and a manufactured solution. Mesh adapted drag output is studied for two simple wings in compressible laminar flow to show fine-mesh convergence of multiple metric construction methods to less than a single drag count. The documentation of these verification exercises helps to prepare these goal-based methods for routine use in more complex simulations for production workflows.

mesh adaptation↗
DOE OSTI2020

Particle Sensitivity Analysis

We propose to develop a computational sensitivity analysis capability for Monte Carlo sampling-based particle simulation relevant to Aleph, Cheetah-MC, Empire, Emphasis, ITS, SPARTA, and LAMMPS codes. These software tools model plasmas, radiation transport, low-density fluids, and molecular motion. Our report demonstrates how adjoint optimization methods can be combined with Monte Carlo sampling-based adjoint particle simulation. Our goal is to develop a sensitivity analysis to drive robust design-based optimization for Monte Carlo sampling-based particle simulation - a currently unavailable capability.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1995

Improved Adjoint-Operator Learning For A Neural Network

Improved method of adjoint-operator learning reduces amount of computation and associated computational memory needed to make electronic neural network learn temporally varying pattern (e.g., to recognize moving object in image) in real time. Method extension of method described in "Adjoint-Operator Learning for a Neural Network" (NPO-18352).

Toomarian, Nikzad↗
NASA NTRS1991

Active control of panel vibrations induced by boundary-layer flow

Some problems in active control of panel vibration excited by a boundary layer flow over a flat plate are studied. In the first phase of the study, the optimal control problem of vibrating elastic panel induced by a fluid dynamical loading was studied. For a simply supported rectangular plate, the vibration control problem can be analyzed by a modal analysis. The control objective is to minimize the total cost functional, which is the sum of a vibrational energy and the control cost. By means of the modal expansion, the dynamical equation for the plate and the cost functional are reduced to a system of ordinary differential equations and the cost functions for the modes. For the linear elastic plate, the modes become uncoupled. The control of each modal amplitude reduces to the so-called linear regulator problem in control theory. Such problems can then be solved by the method of adjoint state. The optimality system of equations was solved numerically by a shooting method. The results are summarized.

Chow, Pao-Liu↗
NASA NTRS1993

Boundary layer receptivity and control

Receptivity processes initiate natural instabilities in a boundary layer. The instabilities grow and eventually break down to turbulence. Consequently, receptivity questions are a critical element of the analysis of the transition process. Success in modeling the physics of receptivity processes thus has a direct bearing on technological issues of drag reduction. The means by which transitional flows can be controlled is also a major concern: questions of control are tied inevitably to those of receptivity. Adjoint systems provide a highly effective mathematical method for approaching many of the questions associated with both receptivity and control. The long term objective is to develop adjoint methods to handle increasingly complex receptivity questions, and to find systematic procedures for deducing effective control strategies. The most elementary receptivity problem is that in which a parallel boundary layer is forced by time-harmonic sources of various types. The characteristics of the response to such forcing form the building blocks for more complex receptivity mechanisms. The first objective of this year's research effort was to investigate how a parallel Blasius boundary layer responds to general direct forcing. Acoustic disturbances in the freestream can be scattered by flow non-uniformities to produce Tollmien-Schlichting waves. For example, scattering by surface roughness is known to provide an efficient receptivity path. The present effort is directed towards finding a solution by a simple adjoint analysis, because adjoint methods can be extended to more complex problems. In practice, flows are non-parallel and often three-dimensional. Compressibility may also be significant in some cases. Recent developments in the use of Parabolized Stability Equations (PSE) offer a promising possibility. By formulating and solving a set of adjoint parabolized equations, a method for mapping the efficiency with which external forcing excites the three-dimensional motions of a non-parallel boundary layer was developed. The method makes use of the same computationally efficient formulation that makes the PSE currently so appealing. In the area of flow control, adjoint systems offer a powerful insight into the effect of control forces. One of the simplest control strategies for boundary layers involves the application of localized mean wall suction.

Hill, D. C.↗
DOE OSTI2016

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

Enhanced Data Efficiency Using Deep Neural Networks and Gaussian Processes for Aerodynamic Design Optimization

Adjoint-based optimization methods are attractive for aerodynamic shape design primarily due to their computational costs being independent of the dimensionality of the input space and their ability to generate high-fidelity gradients that can then be used in a gradient-based optimizer. This makes them very well suited for high-fidelity simulation based aerodynamic shape optimization of highly parametrized geometries such as aircraft wings. However, the development of adjoint-based solvers involve careful mathematical treatment and their implementation require detailed software development. Furthermore, they can become prohibitively expensive when multiple optimization problems are being solved, each requiring multiple restarts to circumvent local optima. In this work, we propose a machine learning enabled, surrogate-based framework that replaces the expensive adjoint solver, without compromising on predicting predictive accuracy. Specifically, we first train a deep neural network (DNN) from training data generated from evaluating the high-fidelity simulation model on a model-agnostic design of experiments on the geometry shape parameters. The optimum shape may then be computed by using a gradient-based optimizer coupled with the trained DNN. Subsequently, we also perform a gradient-free Bayesian optimization, where the trained DNN is used as the prior mean. We observe that the latter framework (DNN-BO) improves upon the DNN-only based optimization strategy for the same computational cost. Overall, this framework predicts the true optimum with very high accuracy, while requiring far fewer high-fidelity function calls compared to the adjoint-based method. Furthermore, we show that multiple optimization problems can be solved with the same machine learning model with high accuracy, to amortize the offline costs associated with constructing our models. Our methodology finds applications in the early stages of aerospace design. (C) 2021 Published by Elsevier Masson SAS.

Renganathan, S. Ashwin↗
DOE OSTI2016

Generalized Sensitivity Calculation in the Monte Carlo Wielandt Method

Recently the Monte Carlo (MC) adjoint-weighted perturbation (AWP) methods with k-adjoint have been developed for the k sensitivity calculations. In order to extend the MC AWP methods to estimate sensitivities of a ratio of two reaction rates, Perfetti and Rearden devised a MC sensitivity calculation method with the generalized adjoint expressed by the intra-generational and intergenerational effects. Aufiero et al. suggested the collision history-based approach to calculate sensitivities of responses in the form of ratios of linear or bilinear functions by applying the correlated sampling for multi-generational collisions. However these methods may require a huge size of computer memory to save inter-generational contributions proportional to the number of the sensitivity tallies. In order to reduce memories required for the k-adjoint estimation, the present authors proposed the AWP algorithm in the MC Wielandt method where multiple generations from a fission source neutron are simulated in single history calculations. In this paper, we present perturbation formulations to estimate sensitivities for general tallies such as volume flux, reaction rates, etc. in the MC Wielandt calculations. The proposed method has been implemented into the Seoul National University MC code, McCARD and tested in two-group infinite homogeneous problems. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRSDate not supplied

Enabling Supersonic Over-Land Flight Using Computational Modeling

NASA's QueSST mission is interested in exploring the potential of commercial, over-land supersonic flight, which has been banned since 1973 due to the noise intensity of the sonic booms that supersonic vehicles create. NASA has partnered with Lockheed Martin to design and construct an experimental aircraft, the X-59, that will shape the sonic boom to achieve a perceived loudness on the ground that is lower than 75dB. In this talk, we present new developments in the Launch Ascent and Vehicle Aerodynamics (LAVA) CFD solver framework which are tailored to the analysis of supersonic vehicles, like the X-59, and sonic boom propagation. Utilizing a high-order space marching method, adjoint-based grid adaptation, and robust database capabilities have enabled significant cost savings over traditional CFD methods for the same level of accuracy in perceived boom loudness. Example cases demonstrating the toolset are presented, along with comparisons to experimental wind tunnel data. These developments will enable LAVA to quickly and accurately provide simulation data to the project during X-59's first and subsequent flights in 2024 and beyond.

CST↗
DOE OSTI2021

Decoupled Fréchet kernels based on a fractional viscoacoustic wave equation

We formulate the Fréchet kernel computation using the adjoint-state method based on a fractional viscoacoustic wave equation. We first numerically prove that both the 1/2- and the 3/2-order fractional Laplacian operators are self-adjoint. Using this property, we show that the adjoint wave propagator preserves the dispersion and compensates the amplitude, while the time-reversed adjoint wave propagator behaves identically as the forward propagator with the same dispersion and dissipation characters. Without introducing rheological mechanisms, this formulation adopts an explicit Q parameterization, which avoids the implicit Q in the conventional viscoacoustic/viscoelastic full waveform inversion (Q-FWI). In addition, because of the decoupling of operators in the wave equation, the viscoacoustic Fréchet kernel is separated into three distinct contributions with clear physical meanings: lossless propagation, dispersion, and dissipation. Here, we find that the lossless propagation kernel dominates the velocity kernel, while the dissipation kernel dominates the attenuation kernel over the dispersion kernel.

58 GEOSCIENCES↗
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 OSTI2016

An Efficient Sampling-Based Method for Sensitivity and Uncertainty Analysis Through RAVEN

Sensitivity analysis (SA) and uncertainty quantification (UQ) are now widely recognized as essential parts of analyses for complex nuclear systems. Plenty of well-established methodologies are already available for performing SA and UQ, such as Monte Carlo analysis, adjoint-based method, and variance decomposition. The focus of this summary is on developing an efficient sampling-based approach to perform SA and UQ through RAVEN. RAVEN (Risk Analysis and Virtual control Environment) is a software framework able to perform SA and UQ, currently under development at the Idaho National Laboratory. In literature, a number of approaches have been developed to accelerate the process of SA and UQ for large complex systems, such as principal component analysis (PCA) of input space, input-output correlation analysis, and intersection subspace methods. The fundamental idea is to identify the dominant active directions in the parameter space prior to conducting SA and UQ. The premise is that the number of active directions is much less than the dimensionality of input space. In this work, the PCA or Karhunen-Loeve expansion or SVD method is implemented in RAVEN to identify the active directions. This approach is also combined with the forward sampling approaches, such as Monte Carlo, Grid, Latin Hypercube, and Response Surface Design sampling approaches that are currently available in RAVEN, to perform SA and UQ more efficiently. The summary is organized as follows. In the following section, we present the PCA-based forward sampling approach. The effectiveness and efficiency are discussed in the numerical results section. The paper then ends with a concluding summary. In this summary, we have presented PCA-based forward sampling approach to perform SA and UQ. The goal is to reduce the computational overhead for repetitive executions of complex nuclear systems that are generally required when performing SA and UQ. The control of correlations between input parameters is implemented in RAVEN to better represent the input relationships. In addition, we are currently examining our implementations with more realistic models, and we are also focusing on implementation of some new high-dimensional input reduction techniques in RAVEN. (authors)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Method for computationally efficient design of dielectric laser accelerator structures

Here, dielectric microstructures have generated much interest in recent years as a means of accelerating charged particles when powered by solid state lasers. The acceleration gradient (or particle energy gain per unit length) is an important figure of merit. To design structures with high acceleration gradients, we explore the adjoint variable method, a highly efficient technique used to compute the sensitivity of an objective with respect to a large number of parameters. With this formalism, the sensitivity of the acceleration gradient of a dielectric structure with respect to its entire spatial permittivity distribution is calculated by the use of only two full-field electromagnetic simulations, the original and ‘adjoint’. The adjoint simulation corresponds physically to the reciprocal situation of a point charge moving through the accelerator gap and radiating. Using this formalism, we perform numerical optimizations aimed at maximizing acceleration gradients, which generate fabricable structures of greatly improved performance in comparison to previously examined geometries.

43 PARTICLE ACCELERATORS↗
NASA NTRS1986

Design sensitivity analysis using EAL. Part 2: Shape design parameters

A numerical implementation of shape design sensitivity analysis of built-up structures is presented, using the versatility and convenience of an existing finite element structural analysis code and its data base management system. This report is a continuation of a previous report on conventional design parameters. The finite element code used in the implementation presented is the Engineering Analysis Language (EAL), which is based on a hybrid analysis method. It has been shown that shape design sensitivity computations can be carried out using the database management system of EAL, without writing a separate program and a separate data base. The material derivative concept of continuum mechanics and an adjoint variable method of design sensitivity analysis are used to derive shape design sensitivity information of structural performances. A domain method of shape design sensitivity analysis and a design component method are used. Displacement and stress functionals are considered as performance criteria.

Dopker, B.↗
DOE OSTI2020

Verification of the sensitivity and uncertainty-based criticality safety validation techniques: ORNL’s SCALE case study

The use of sensitivity and uncertainty-based techniques has been well-developed in the neutronic community for criticality safety applications. Sensitivity techniques calculate the first-order relative variations in keff due to relative cross-section variations by isotope, reaction type, and incident neutron energy. The result is a vector of sensitivity coefficients which is folded with prior cross-section uncertainties to calculate the so-called similarity indices. Similarity indices are integral quantities which serve as useful mathematical measures for assessing the relevance of existing or new experiments to given application conditions, representing design systems for which the models are to be validated. Despite their importance for a wide range of validation activities, the peer-reviewed literature is non-existent on the development of rigorous verification analysis for their calculated values. Thus, this manuscript proposes a simple non-intrusive method to calculate similarity indices, serving as an independent verification tool for their evaluation. The manuscript derives the theoretical basis for the proposed verification analysis. Next, the verification analysis is applied to the ORNL’s SCALE code suite which employs adjoint-based methods to calculate similarity indices. Numerical experiments using a number of well-known benchmark experiments are employed to verify the calculation of the similarity indices.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
NASA NTRS1985

Shape design sensitivity analysis using domain information

A numerical method for obtaining accurate shape design sensitivity information for built-up structures is developed and demonstrated through analysis of examples. The basic character of the finite element method, which gives more accurate domain information than boundary information, is utilized for shape design sensitivity improvement. A domain approach for shape design sensitivity analysis of built-up structures is derived using the material derivative idea of structural mechanics and the adjoint variable method of design sensitivity analysis. Velocity elements and B-spline curves are introduced to alleviate difficulties in generating domain velocity fields. The regularity requirements of the design velocity field are studied.

Seong, Hwal-Gyeong↗