Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “adjoint problem”

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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Nonlinear Diffusion Acceleration of the Least-Squares Transport Equation in Geometries with Voids

In this paper we show the extension of the Nonlinear-Diffusion Acceleration (NDA) to geometries containing small voids using a weighted least-squares (WLS) high order equation. Even though the WLS equation is well defined in voids, the low-order drift diffusion equation was not defined in materials with a zero cross section. This paper derives the necessary modifications to the NDA algorithm. We show that a small change to the NDA closure term and a non-local definition of the diffusion coefficient solve the problems for voids regions. These changes do not affect the algorithm for optical thick material regions, while making the algorithm well defined in optically thin ones. We use a Fourier analysis to perform an iterative analysis to confirm that the modifications result in a stable and efficient algorithm. Numerical results of our method will be presented in the second part of the paper. We test this formulation with a small, one-dimensional test problem. Additionally we present results for a modified version of the C5G7 benchmark containing voids as a more complex, reactor like problem. We compared our results to PDT, Texas A&M’s transport code, utilizing a first order discontinuous formulation as reference and the self-adjoint angular flux equation with void treatment (SAAFτ ), a different second order form. The results indicate, that the NDA WLS performed comparably or slightly worse then the asymmetric SAAFτ , while maintaining a symmetric discretization matrix.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1984

An analytic solution for the orbital perturbations of the Venus Radar Mapper due to gravitational harmonics

Hill's variational equations are solved analytically for the orbital perturbations of a spacecraft nominally in an elliptic orbit around a non-spherical body. The rotation of the central planet about its spin-axis is not considered in the analysis. The perturbations are restricted to the planetary gravitational harmonics only. An extremely simple algorithm is derived to transform the spherical harmonic potentials to the orbital coordinate system, and the resulting accelerations are shown to be simply trigonometric functions of the true anomaly. With the principal matrix solution for the differential equations of the adjoint system given in closed form, the orthogonality of the trigonometric functions makes it possible to obtain an analytic solution for the non-homogeneous problem, at intervals of 2 pi in true anomaly. The solution for orbital perturbations can be extended over several revolutions by applying well-known results from Floquet's theory. The technique is demonstrated with results presented on the spacecraft periapsis altitude for the forthcoming Venus Radar Mapper Mission.

Vijayaraghavan, A.↗
NASA NTRS1992

Multidisciplinary analysis and sensitivity derivatives for isolated helicopter rotors in hover

A new method is presented for using Navier-Stokes results in the system analysis and sensitivity derivative computations for a helicopter rotor in hover. The system coupling includes the interactions between rotor performance, rotor structural properties and aerodynamics (i.e., airfoil shape). Emphasis is placed on the use of high fidelity Navier-Stokes algorithms for the aerodynamic problem. The present formulation is chosen to reduce the number of sensitivity derivative equations and their dimensions as much as possible. In addition, an alternative adjoint formulation is presented which dramatically reduces the computational requirement for disciplines in which there may be a large number of design variables (e.g., aerodynamics). The theoretical method makes use of a combination of derivatives from each discipline; the computation of these derivatives has already been shown to be feasible. Sample computations for the aerodynamic-rotor model coupling and an associated sensitivity derivative are also presented.

Jones, Henry E.↗
NASA NTRS2018

Introduction to Data Assimilation

Atmospheric data assimilation is a class of techniques used for producing descriptions of fields of air temperature, pressure, humidity, wind, etc. on a spatial grid or in terms of a finite functional representation. These are then used to initialize numerical weather forecasts or to analyze the atmosphere for other purposes. The techniques combine past, present, and even future observations in an approximate statistically optimal way. Various types of statistical or physically-based models and their corresponding adjoints are employed to relate diverse fields in both time and space and to relate what is observed to what is being analyzed. Computationally, the problem is very demanding and onstraining on the techniques that can be employed on a routine basis.

Atmospheric data assimilation↗
DOE OSTI2021

Progress on Optimizing Wind Farms and Rotor Designs Using Adjoints

Modern wind plants are increasingly tasked with multiple performance objectives. In addition to designing plants that maximize power output and minimize the levelized cost of energy (LCOE), the design and operation of wind plants is increasingly influenced by challenges regarding grid integration of variable generation renewables. This places a growing emphasis on making wind plants more controllable and predictable. WindSE is a Reynolds-averaged Navier-Stokes (RANS) model designed around analytical gradient and adjoint methods, with the ability to capture terrain-induced effects, as shown in Figure 1. The recent addition of an unsteady solver with an actuator line method (ALM) and ongoing work to enable massively parallel optimizations gives it a unique niche to explore coupled plant-level controls and design problems. This code is an open source python package built on the FEniCS framework that utilizes fast, parallel PETSc solvers to model fluid flow throughout wind-farm scale domains. Two recent studies performed using WindSE demonstrate the capability to optimize under a wide variety of flow conditions and objective functions. In the first, we present an optimization focused on modifying the layout of a wind farm with a fixed number of turbines for maximum total power output [1]. This study highlights the ability to quickly perform simulations using the steady Navier-Stokes solver combined with rotors represented as actuator disks while also stressing the importance of capturing terrain-induced effects. Gradient-based optimization using the RANS equations is viable due to the inclusion of efficiently computed adjoint derivatives. We interpret the physical results of the optimal layout and also discuss the computational cost of scaling to larger problems. In the second study, we present the capabilities of the unsteady Navier-Stokes solver, where rotor-blade profiles represented by actuator lines are optimized to enhance wake steering effects and overall power production [2]. We quantify the wind plant performance gains obtained from this type of simultaneous control co-design optimization as compared to optimizing the blade design and yaw independently. Figure 2 shows the differences between a baseline two-turbine system and an optimized system where we fine-tune the blade chord profile. Results and challenges from each study are quickly summarized and used to motivate the current development efforts within WindSE. Current and future work is focused on enabling higher-resolution studies with more degrees of freedom through parallelization of both the simulation and optimization algorithms. We present benchmarking results to show that WindSE performs well in both weak- and strong-scaling tests and further demonstrate that the optimizer obtains the same convergence rates in both shared- and distributed-memory environments. Using larger wind farms, we can study deep-array effects within an optimization context, allowing the use of objective functions that have been previously unstudied. As an example, we present ongoing work on a blockage metric which characterizes the loss of available kinetic energy due to wake effects from multiple upstream turbines.

adjoint optimization↗
DOE OSTI2021

Neural-adjoint method for the inverse design of all-dielectric metasurfaces

All-dielectric metasurfaces exhibit exotic electromagnetic responses, similar to those obtained with metal-based metamaterials. Research in all-dielectric metasurfaces currently uses relatively simple unit-cell designs, but increased geometrical complexity may yield even greater scattering states. Although machine learning has recently been applied to the design of metasurfaces with impressive results, the much more challenging task of finding a geometry that yields a desired spectra remains largely unsolved. We propose and demonstrate a method capable of finding accurate solutions to ill-posed inverse problems, where the conditions of existence and uniqueness are violated. A specific example of finding the metasurface geometry which yields a radiant exitance matching the external quantum efficiency of gallium antimonide is demonstrated. We also show how the neural-adjoint method can intelligently grow the design search space to include designs that increasingly and accurately approximate the desired scattering response. The neural-adjoint method is not restricted to the case demonstrated and may be applied to plasmonics, photonic crystal, and other artificial electromagnetic materials.

42 ENGINEERING↗
NASA NTRS2019

Using Graph Coloring to Compute Total Derivatives More Efficiently in OpenMDAO

When they are applicable, gradient based optimization algorithms are the most efficient way to solve design optimization problems. Although gradient based methods are generally efficient, they can be made significantly more so through the usage of analytic techniques to compute the necessary total derivatives. The traditional forward (direct) and reverse (adjoint) analytic techniques have computational costs that scale linearly with the number of design variables and the number of constraints, respectively. In this work, we present an application of a graph coloring algorithm to the analytic techniques for computing total derivative Jacobians in order to achieve much better computational scaling than the pure analytic methods can provide alone. A detailed theoretical explanation of how coloring algorithms interact with analytic derivative methods is presented that illustrates specific types of sparsity patterns that must be present in total derivative Jacobians in order for this coloring technique to be effective. The new technique has been implemented as a feature in the OpenMDAO framework and the implementation is demonstrated on two example problems. The performance on the example problems up to 50% reduction in compute cost for optimizations with bi-directional coloring compared to traditional constraint aggregation. Additionally, the results show how coloring technique alleviates some of the numerical difficulties that constraint aggregation can cause, leading to the ability to solve larger problems. It is expected that the new method will have wide applicability to multidisciplinary optimization problems, and that its availability in OpenMDAO will offer significant computational savings for users without the need for them to implement the coloring algorithm themselves.

Trajectory↗
DOE OSTI2017

Turbulent Spot Pressure Fluctuation Wave Packet Model

Wave packet analysis provides a connection between linear small disturbance theory and subsequent nonlinear turbulent spot flow behavior. The traditional association between linear stability analysis and nonlinear wave form is developed via the method of stationary phase whereby asymptotic (simplified) mean flow solutions are used to estimate dispersion behavior and stationary phase approximation are used to invert the associated Fourier transform. The resulting process typically requires nonlinear algebraic equations inversions that can be best performed numerically, which partially mitigates the value of the approximation as compared to a more complete, e.g. DNS or linear/nonlinear adjoint methods. To obtain a simpler, closed-form analytical result, the complete packet solution is modeled via approximate amplitude (linear convected kinematic wave initial value problem) and local sinusoidal (wave equation) expressions. Significantly, the initial value for the kinematic wave transport expression follows from a separable variable coefficient approximation to the linearized pressure fluctuation Poisson expression. The resulting amplitude solution, while approximate in nature, nonetheless, appears to mimic many of the global features, e.g. transitional flow intermittency and pressure fluctuation magnitude behavior. A low wave number wave packet models also recover meaningful auto-correlation and low frequency spectral behaviors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2015

Adaptive Shape Control for Aerodynamic Design

We present an approach to aerodynamic optimization in which the shape control is adaptively parameterized. Starting from a coarse set of design variables, a sequence of higher-dimensional nested search spaces is automatically generated. Refinement can be either uniform or adaptive, in which case only the most important shape control is added. The relative importance of candidate design variables is determined by comparing objective and constraint gradients, computed at low cost via adjoint solutions. A search procedure for finding an effective ensemble of shape parameters is also given. We first demonstrate this system on a multipoint drag miminization problem in 2D with many constraints, showing that an adaptive parameterization approach consistently achieves smoother, more robust, and faster design improvement than fixed parameterizations. We also establish a 3D shape- matching benchmark, where we demonstrate that our approach automatically discovers the necessary parameters to match a target shape. By largely automating shape parameterization, this work also aims to remove a time-consuming aspect of shape optimization.

Aerodynamic Design↗
DOE OSTI2017

A Continuous-Discontinuous Hybrid Finite Element Method for S{sub N} Transport

Particle transport phenomenon for neutral particles, such as neutrons and photons, is governed by the linear Boltzmann equation, which is a first-order partial differential equation (PDE). In order to solve the transport equation, discontinuous finite element method (DFEM) is heavily developed. However, the large memory consumption due to the extra degrees of freedom is problematic in multi-D calculations. Another path is to recast the transport equation to a second-order form, such as the well-known self-adjoint angular flux equation (SAAF) and the even parity equations, and spatially discretize the equation using continuous finite element method (CFEM). Yet, such forms generally have problems in void situation as the streaming operator contains a 1/σ{sub t} term and becomes singular in void, which draws numerous efforts on developing void-treatment methods. An intuition to mitigate the shortcomings of both methods is then to develop a method that utilizes DFEM in part of the problem where CFEM has issues while in the other part, CFEM is employed to avoid DFEM's high cost. In this work, we present a novel continuous-discontinuous finite element method (CDFEM) for solving the discrete-ordinates (S{sub N}) transport equations. We perform the hybridization between 1/σ{sub t}-weighted least-squares finite element methods (1/σ{sub t}-LSFEM), with continuous basis functions, and first-order solver. Different solvers are defined in different regions, or subdomains, of the problem. The resulting scheme is such that CFEM-SAAF is performed in subdomains with continuous basis functions while upwinding based DFEM solver is utilized in subdomains with discontinuous basis functions. The connection between subdomains is through an upwinding operation on the interface, which can be performed via the sweep procedure. A foreseeable benefit is such a scheme is compatible with void as first-order DFEM solver can be used in void. On the other hand, as DFEM is only used in part of the problem, CDFEM can effectively avoid the notorious memory consumption of DFEM in multi-D calculation for the future work.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Automated Hybrid Variance Reduction on Advanced Architectures in the Shift Monte Carlo Code

Monte Carlo transport methods are the most accurate schemes for solving problems with complex energy and spatial features, but they come with a high computational cost. Although hybrid methods have enabled the use of Monte Carlo transport for a large class of problems, they still require significant computing resources. Modern multicore CPUs with large numbers of compute cores and graphical processing units (GPUs) provide opportunities to optimize the memory and run-time costs of hybrid Monte Carlo methods. This paper documents the development and analysis of three Monte Carlo transport algorithms that support hybrid transport using the consistent adjoint-driven importance sampling (CADIS) and forward-weighted CADIS methods in the Shift Monte Carlo code: history-based transport using static and dynamic threading on multicore CPUs and event-based transport enabling weight window tracking on GPUs. The results are shown for two challenging hybrid problems on the Frontier supercomputer at the Oak Ridge Leadership Computing Facility. The results show that all three methods yield good performance and enable solutions of difficult fixed-source transport problems in less than 2 min on 20 nodes of Frontier. Dynamic threading was observed to give up to 20% better scaling behavior than static threading. Moreover, the AMD Instinct 250X GPU was found to give 9 to 11 times greater throughput per graphics compute die than the best CPU performance. In conclusion, additional opportunities for optimization of hybrid transport on GPUs are discussed.

Denovo↗
DOE OSTI2016

Application of non-self-adjoint operators for description of electronic excitations in metallic lithium

Metallic lithium is used to demonstrate the possibilities of applying non-self-adjoint operators for quantitative description of orbital excitations of electrons in crystals. It is shown that, the nonequilibrium distribution function can be calculated when solving the spectral problem; therefore, the kinetic properties of a material can also be described with the unified band theory.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS1985

Sensitivity derivatives for static test loading boundary conditions

Attention is given to the application of the adjoint variable method under the special combination of displacement and stress boundary conditions which occur when static test conditions are simulated. In the two-step problem-solving method employed, calculation of internal stresses, displacements and total reaction force at the boundary is followed by the calculation of the applied load and the total reaction force due to unit displacements.

Gurdal, Z.↗
NASA NTRS1996

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

PDE-constrained high-order mesh optimization

Here, we present a novel framework for PDE-constrained r-adaptivity of high-order meshes. The proposed method formulates mesh movement as an optimization problem, with an objective function defined as a convex combination of a mesh quality metric and a measure of the accuracy of the PDE solution obtained via finite element discretization. The proposed formulation achieves optimized, well-defined high-order meshes by integrating mesh quality control, PDE solution accuracy, and robust gradient regularization. We adopt the Target-Matrix Optimization Paradigm to control geometric properties across the mesh, independent of the PDE of interest. To incorporate the accuracy of the PDE solution, we introduce error measures that control the finite element discretization error. The implicit dependence of these error measures on the mesh nodal positions is accurately captured by adjoint sensitivity analysis. Additionally, a convolution-based gradient regularization strategy is used to ensure stable and effective adaptation of high-order meshes. We demonstrate that the proposed framework can improve mesh quality and reduce the error by up to 10 times for the solution of Poisson and linear elasto-static problems. The approach is general with respect to the dimensionality, the order of the mesh, the types of mesh elements, and can be applied to any PDE that admits well-defined adjoint operators.

Computer science↗
DOE OSTI2021

Plastic work constrained elastoplastic topology optimization

An elastoplastic topology optimization framework for limiting plastic work generation while maximizing stiffness is presented. The kinematics and constitutive model are based on finite strain linear isotropic hardening plasticity, and the balance laws are solved using a total Lagrangian finite element formulation. Aggregation of the specific plastic work combined with an adaptive normalization scheme efficiently constrains the maximum specific plastic work. The optimization problem is regularized using an augmented partial differential equation filter, and is solved by the method of moving asymptotes where path-dependent sensitivities are derived using the adjoint method. The numerical examples show a clear dependence on the optimized maximum stiffness structures for different levels of constrained specific plastic work. It is also shown that due to the history dependency of the plasticity, the load path significantly influences the structural performance and optimized topology.

42 ENGINEERING↗
DOE OSTI2018

On the Theory of Anisotropic Flat Elasticity

For the Lamé system from the flat anisotropic theory of elasticity, we introduce generalized double-layer potentials in connection with the function-theory approach. These potentials are built both for the translation vector (the solution of the Lamé system) and for the adjoint vector functions describing the stress tensor. The integral representation of these solutions is obtained using the potentials. As a corollary, the first and the second boundary-value problems in various spaces (Hölder, Hardy, and the class of functions just continuous in a closed domain) are reduced to the equivalent system of the Fredholm boundary equations in corresponding spaces. Note that such an approach was developed in [19, 20] for common second-order elliptic systems with constant (higher-order only) coefficients. However, due to important applications, it makes sense to consider this approach in detail directly for the Lamé system. To illustrate these results, in the last two sections we consider the Dirichlet problem with piecewise-constant Lamé coefficients when contact conditions are given on the boundary between two media. This problem is reduced to the equivalent system of the Fredholm boundary equations. The smoothness of kernels of the obtained integral operators is investigated in detail depending on the smoothness of the boundary contours.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1987

Survey of methods for calculating sensitivity of general eigenproblems

A survey of methods for sensitivity analysis of the algebraic eigenvalue problem for non-Hermitian matrices is presented. In addition, a modification of one method based on a better normalizing condition is proposed. Methods are classified as Direct or Adjoint and are evaluated for efficiency. Operation counts are presented in terms of matrix size, number of design variables and number of eigenvalues and eigenvectors of interest. The effect of the sparsity of the matrix and its derivatives is also considered, and typical solution times are given. General guidelines are established for the selection of the most efficient method.

Murthy, Durbha V.↗