Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 109 records · Page 6

Adjoint Sensitivity Computations for an Embedded-Boundary Cartesian Mesh Method and CAD Geometry

Cartesian-mesh methods are perhaps the most promising approach for addressing the issues of flow solution automation for aerodynamic design problems. In these methods, the discretization of the wetted surface is decoupled from that of the volume mesh. This not only enables fast and robust mesh generation for geometry of arbitrary complexity, but also facilitates access to geometry modeling and manipulation using parametric Computer-Aided Design (CAD) tools. Our goal is to combine the automation capabilities of Cartesian methods with an eficient computation of design sensitivities. We address this issue using the adjoint method, where the computational cost of the design sensitivities, or objective function gradients, is esseutially indepeudent of the number of design variables. In previous work, we presented an accurate and efficient algorithm for the solution of the adjoint Euler equations discretized on Cartesian meshes with embedded, cut-cell boundaries. Novel aspects of the algorithm included the computation of surface shape sensitivities for triangulations based on parametric-CAD models and the linearization of the coupling between the surface triangulation and the cut-cells. The objective of the present work is to extend our adjoint formulation to problems involving general shape changes. Central to this development is the computation of volume-mesh sensitivities to obtain a reliable approximation of the objective finction gradient. Motivated by the success of mesh-perturbation schemes commonly used in body-fitted unstructured formulations, we propose an approach based on a local linearization of a mesh-perturbation scheme similar to the spring analogy. This approach circumvents most of the difficulties that arise due to non-smooth changes in the cut-cell layer as the boundary shape evolves and provides a consistent approximation tot he exact gradient of the discretized abjective function. A detailed gradient accurace study is presented to verify our approach. Thereafter, we focus on a shape optimization problem for an Apollo-like reentry capsule. The optimization seeks to enhance the lift-to-drag ratio of the capsule by modifyjing the shape of its heat-shield in conjunction with a center-of-gravity (c.g.) offset. This multipoint and multi-objective optimization problem is used to demonstrate the overall effectiveness of the Cartesian adjoint method for addressing the issues of complex aerodynamic design. This abstract presents only a brief outline of the numerical method and results; full details will be given in the final paper.

Nemec, Marian↗

Advancing attenuation estimation through integration of the Hessian in multiparameter viscoacoustic full-waveform inversion

Accurate seismic attenuation models of subsurface structures not only enhance subsequent migration processes by improving fidelity, resolution, and facilitating amplitude-compliant angle gather generation but also provide valuable constraints on subsurface physical properties. Leveraging full-wavefield information, multiparameter viscoacoustic full-waveform inversion ( Q-FWI) simultaneously estimates seismic velocity and attenuation ( Q) models. However, a major challenge in Q-FWI is the contamination of crosstalk artifacts, where inaccuracies in the velocity model are mistakenly mapped to the inverted attenuation model. While incorporating the Hessian is expected to mitigate these artifacts, the explicit implementation is prohibitively expensive due to its formidable computational cost. In this study, we formulate and develop a Q-FWI algorithm via the Newton-conjugate gradient (CG) framework, where the search direction at each iteration is determined through an internal CG loop. In particular, the Hessian is integrated into each CG step in a matrix-free fashion using the second-order adjoint-state method. We find through synthetic experiments that our Newton-CG Q-FWI significantly mitigates crosstalk artifacts compared with the limited-memory Broyden-Fletcher-Goldfarb-Shanno method and the CG method, albeit with a notable computational cost. In the discussion of several key implementation details, we also determine the significance of the approximate Gauss-Newton Hessian, the second-order adjoint-state method, and the two-stage inversion strategy.

Geochemistry & Geophysics↗

Multigrid methods for bifurcation problems: The self adjoint case

This paper deals with multigrid methods for computational problems that arise in the theory of bifurcation and is restricted to the self adjoint case. The basic problem is to solve for arcs of solutions, a task that is done successfully with an arc length continuation method. Other important issues are, for example, detecting and locating singular points as part of the continuation process, switching branches at bifurcation points, etc. Multigrid methods have been applied to continuation problems. These methods work well at regular points and at limit points, while they may encounter difficulties in the vicinity of bifurcation points. A new continuation method that is very efficient also near bifurcation points is presented here. The other issues mentioned above are also treated very efficiently with appropriate multigrid algorithms. For example, it is shown that limit points and bifurcation points can be solved for directly by a multigrid algorithm. Moreover, the algorithms presented here solve the corresponding problems in just a few work units (about 10 or less), where a work unit is the work involved in one local relaxation on the finest grid.

Taasan, Shlomo↗

New optimality criteria methods - Forcing uniqueness of the adjoint strains by corner-rounding at constraint intersections

In new, iterative continuum-based optimality criteria (COC) methods, the strain in the adjoint structure becomes non-unique if the number of active local constraints is greater than the number of design variables for an element. This brief note discusses the use of smooth envelope functions (SEFs) in overcoming economically computational problems caused by the above non-uniqueness.

Rozvany, G. I. N.↗

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, error estimation methods, and anisotropic mesh adaptation mechanics. Anisotropic metric construction methods are evaluated with analytically defined primal and 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. Unstructured mesh adaptation tools are verified by comparison on analytic primal and dual field before verification on benchmark aerodynamics cases. The documentation of these verification exercises helps to prepare these goal-based methods for routine use in production simulation workflows.

Mesh adaptation↗

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↗

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↗

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↗

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.↗

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↗

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↗

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↗

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.↗

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↗

Using an Adjoint Approach to Eliminate Mesh Sensitivities in Computational Design

An algorithm for efficiently incorporating the effects of mesh sensitivities in a computational design framework is introduced. The method is based on an adjoint approach and eliminates the need for explicit linearizations of the mesh movement scheme with respect to the geometric parameterization variables, an expense that has hindered practical large-scale design optimization using discrete adjoint methods. The effects of the mesh sensitivities can be accounted for through the solution of an adjoint problem equivalent in cost to a single mesh movement computation, followed by an explicit matrix-vector product scaling with the number of design variables and the resolution of the parameterized surface grid. The accuracy of the implementation is established and dramatic computational savings obtained using the new approach are demonstrated using several test cases. Sample design optimizations are also shown.

Nielsen, Eric J.↗

Using an Adjoint Approach to Eliminate Mesh Sensitivities in Computational Design

An algorithm for efficiently incorporating the effects of mesh sensitivities in a computational design framework is introduced. The method is based on an adjoint approach and eliminates the need for explicit linearizations of the mesh movement scheme with respect to the geometric parameterization variables, an expense that has hindered practical large-scale design optimization using discrete adjoint methods. The effects of the mesh sensitivities can be accounted for through the solution of an adjoint problem equivalent in cost to a single mesh movement computation, followed by an explicit matrix-vector product scaling with the number of design variables and the resolution of the parameterized surface grid. The accuracy of the implementation is established and dramatic computational savings obtained using the new approach are demonstrated using several test cases. Sample design optimizations are also shown.

Nielsen, Eric J.↗

A direct-adjoint approach for material point model calibration with application to plasticity

Here, this paper proposes a new approach for the calibration of material parameters in local elastoplastic constitutive models. The calibration is posed as a constrained optimization problem, where the constitutive model evolution equations for a single material point serve as constraints. The objective function quantifies the mismatch between the stress predicted by the model and corresponding experimental measurements. To improve calibration efficiency, a novel direct-adjoint approach is presented to compute the Hessian of the objective function, which enables the use of second-order optimization algorithms. Automatic differentiation is used for gradient and Hessian computations. Two numerical examples are employed to validate the Hessian matrices and to demonstrate that the Newton–Raphson algorithm consistently outperforms gradient-based algorithms such as L-BFGS-B.

36 MATERIALS SCIENCE↗