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 181 records · Page 10

Dynamic Learning of Correlation Potentials for a Time-Dependent Kohn-Sham System

We develop methods to learn the correlation potential for a time-dependent Kohn-Sham (TDKS) system in one spatial dimension. We start from a low-dimensional two-electron system for which we can numerically solve the time-dependent Schr¨odinger equation; this yields electron densities suitable for training models of the correlation potential. We frame the learning problem as one of optimizing a least-squares objective subject to the constraint that the dynamics obey the TDKS equation. Applying adjoints, we develop efficient methods to compute gradients and thereby learn models of the correlation potential. Our results show that it is possible to learn values of the correlation potential such that the resulting electron densities match ground truth densities. We also show how to learn correlation potential functionals with memory, demonstrating one such model that yields reasonable results for trajectories outside the training set.

97 MATHEMATICS AND COMPUTING↗

Derivation of the Future Time Equation for Analog, Non-Multiplying Monte Carlo Simulation

The expected computational time required to simulate a particle from a point in phase space through a Monte Carlo history, termed the expected future time, is found by solving the Future Time Equation (FTE). The expected future time may be useful when generating variance reduction parameters for a Monte Carlo simulation with a method such as Consistent Adjoint Driven Importance Sampling (CADIS). This report presents a detailed derivation of the Future Time Probability Density Function (FTPDF) and FTE for neutral particle Monte Carlo transport to aid future researchers. For simplicity, this derivation only considers analog transport in non-multiplying media.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Eigenvector derivatives of repeated eigenvalues using singular value decomposition

An explicit formula is obtained for the first-order eigenvector derivative that corresponds to the eigenvector of a repeated eigenvalue, in the case of the nonself-adjoint eigenvalue problem. This method applies to the class of nondefective problems whose first eigenvalue derivatives of the repeated eigenvalues are distinct. A singular-value decomposition approach is used to compute four requisite bases for eigenspaces, as well as to keep track of the dimensions of state variables and the conditioning of the state equations.

Lim, Kyong B.↗

Recent Progress in Parallel Schur Complement Preconditioning for Computational Fluid

We consider preconditioning methods for nonself-adjoint advective-diffusive systems based on a nonoverlapping Schur complement procedure for arbitrary triangulated domains. The triangulation is first partitioned using the METIS multi-level $k$-way partitioning code. This partitioning of the triangulation induces a natural 2x2 partitioning of the demoralization matrix. By considering various inverse approximations of the 2x2 system we have developed a family of robust preconditioning techniques. The performance of these approximations will be discussed and numerous examples shown to illustrate the efficiency of the technique.

Barth, Tim↗

Progress in Parallel Schur Complement Preconditioning for Computational Fluid Dynamics

We consider preconditioning methods for nonself-adjoint advective-diffusive systems based on a non-overlapping Schur complement procedure for arbitrary triangulated domains. The ultimate goal of this research is to develop scalable preconditioning algorithms for fluid flow discretizations on parallel computing architectures. In our implementation of the Schur complement preconditioning technique, the triangulation is first partitioned into a number of subdomains using the METIS multi-level k-way partitioning code. This partitioning induces a natural 2X2 partitioning of the p.d.e. discretization matrix. By considering various inverse approximations of the 2X2 system, we have developed a family of robust preconditioning techniques. A computer code based on these ideas has been developed and tested on the IBM SP2 and the SGI Power Challenge array using MPI message passing protocol. A number of example CFD calculations will be presented to illustrate and assess various Schur complement approximations.

Barth, Timothy J.↗

Application of Exactly Linearized Error Transport Equations to AIAA CFD Prediction Workshops

The computational fluid dynamics (CFD) prediction workshops sponsored by the AIAA have created invaluable opportunities in which to discuss the predictive capabilities of CFD in areas in which it has struggled, e.g., cruise drag, high-lift, and sonic boom pre diction. While there are many factors that contribute to disagreement between simulated and experimental results, such as modeling or discretization error, quantifying the errors contained in a simulation is important for those who make decisions based on the computational results. The linearized error transport equations (ETE) combined with a truncation error estimate is a method to quantify one source of errors. The ETE are implemented with a complex-step method to provide an exact linearization with minimal source code modifications to CFD and multidisciplinary analysis methods. The equivalency of adjoint and linearized ETE functional error correction is demonstrated. Uniformly refined grids from a series of AIAA prediction workshops demonstrate the utility of ETE for multidisciplinary analysis with a connection between estimated discretization error and (resolved or under-resolved) flow features.

Derlaga, Joseph M.↗

Discrete approximations to optimal trajectories using direct transcription and nonlinear programming

A recently developed method for solving optimal trajectory problems uses a piecewise-polynomial representation of the state and control variables, enforces the equations of motion via a collocation procedure, and thus approximates the original calculus-of-variations problem with a nonlinear-programming problem, which is solved numerically. This paper identifies this method as a direct transcription method and proceeds to investigate the relationship between the original optimal-control problem and the nonlinear-programming problem. The discretized adjoint equation of the collocation method is found to have deficient accuracy, and an alternate scheme which discretizes the equations of motion using an explicit Runge-Kutta parallel-shooting approach is developed. Both methods are applied to finite-thrust spacecraft trajectory problems, including a low-thrust escape spiral, a three-burn rendezvous, and a low-thrust transfer to the moon.

Enright, Paul J.↗

Viscous aerodynamic design using the adjoint variable approach

The use of classical optimal control methods, in particular variational methods, to solve the airfoil optimization problem, by deriving a set of adjoint (costate) equations and boundary conditions has already been done for inviscid (potential and Euler flows) and two dimensional, steady state, incompressible flow governed by the Navier-Stokes equations. The interior and boundary terms of the volume integral have been derived (in this work) for the steady Navier-Stokes equations in three dimensions for a viscous, compressible heat conducting fluid. This can be used to derive the adjoint equations and numerical boundary conditions for general classes of problems and hence paves the way for a solution to the aerodynamic optimization problem for compressible viscous flows. The next steps to the realization of that goal are projected as below. The usual square integral pressure functional as an objective function is being replaced by a more realistic drag functional subject to a lift constraint. The feasibility of attempting the more difficult time dependent problem is being investigated. It remains to get the full system of adjoint equations and boundary conditions with the new functional. The state and adjoint equations must be discretized and coded. An appropriate optimization program must be used (steepest descents seems inadequate) and various known airfoil shapes should be recovered in test cases of the computer program.

DeRise, George↗

Spectral multigrid methods for elliptic equations

An alternative approach which employs multigrid concepts in the iterative solution of spectral equations was examined. Spectral multigrid methods are described for self adjoint elliptic equations with either periodic or Dirichlet boundary conditions. For realistic fluid calculations the relevant boundary conditions are periodic in at least one (angular) coordinate and Dirichlet (or Neumann) in the remaining coordinates. Spectral methods are always effective for flows in strictly rectangular geometries since corners generally introduce singularities into the solution. If the boundary is smooth, then mapping techniques are used to transform the problem into one with a combination of periodic and Dirichlet boundary conditions. It is suggested that spectral multigrid methods in these geometries can be devised by combining the techniques.

Zang, T. A.↗

Extension of the Time-Spectral Approach to Overset Solvers for Arbitrary Motion

Forced periodic flows arise in a broad range of aerodynamic applications such as rotorcraft, turbomachinery, and flapping wing configurations. Standard practice involves solving the unsteady flow equations forward in time until the initial transient exits the domain and a statistically stationary flow is achieved. It is often required to simulate through several periods to remove the initial transient making unsteady design optimization prohibitively expensive for most realistic problems. An effort to reduce the computational cost of these calculations led to the development of the Harmonic Balance method [1, 2] which capitalizes on the periodic nature of the solution. The approach exploits the fact that forced temporally periodic flow, while varying in the time domain, is invariant in the frequency domain. Expanding the temporal variation at each spatial node into a Fourier series transforms the unsteady governing equations into a steady set of equations in integer harmonics that can be tackled with the acceleration techniques afforded to steady-state flow solvers. Other similar approaches, such as the Nonlinear Frequency Domain [3,4,5], Reduced Frequency [6] and Time-Spectral [7, 8, 9] methods, were developed shortly thereafter. Additionally, adjoint-based optimization techniques can be applied [10, 11] as well as frequency-adaptive methods [12, 13, 14] to provide even more flexibility to the method. The Fourier temporal basis functions imply spectral convergence as the number of harmonic modes, and correspondingly number of time samples, N, is increased. Some elect to solve the equations in the frequency domain directly, while others choose to transform the equations back into the time domain to simplify the process of adding this capability to existing solvers, but each harnesses the underlying steady solution in the frequency domain. These temporal projection methods will herein be collectively referred to as Time-Spectral methods. Time-Spectral methods have demonstrated marked success in reducing the computational costs associated with simulating periodic forced flows, but have yet to be fully applied to overset or Cartesian solvers for arbitrary motion with dynamic hole-cutting. Overset and Cartesian grid methodologies are versatile techniques capable of handling complex geometry configurations in practical engineering applications, and the combination of the Time-Spectral approach with this general capability potentially provides an enabling new design and analysis tool. In an arbitrary moving-body scenario for these approaches, a Lagrangian body moves through a fixed Eulerian mesh and mesh points in the Eulerian mesh interior to the solid body are removed (cut or blanked), leaving a hole in the Eulerian mesh. During the dynamic motion some gridpoints in the domain are blanked and do not have a complete set of time-samples preventing a direct implementation of the Time-Spectral method. Murman[6] demonstrated the Time-Spectral approach for a Cartesian solver with a rigid domain motion, wherein the hole cutting remains constant. Similarly, Custer et al. [15, 16] used the NASA overset OVERFLOW solver and limited the amount of relative motion to ensure static hole-cutting and interpolation. Recently, Mavriplis and Mundis[17] demonstrated a qualitative method for applying the Time-Spectral approach to an unstructured overset solver for arbitrary motion. The goal of the current work is to develop a robust and general method for handling arbitrary motion with the Time-Spectral approach within an overset or Cartesian mesh method, while still approaching the spectral convergence rate of the original Time-Spectral approach. The viscous OVERFLOW solver will be augmented with the new Time-Spectral algorithm and the capability of the method for benchmark problems in rotorcraft and turbomachinery will be demonstrated. This abstract begins with a brief synopsis of the Time-Spectral approach for overset grids and provides details of e current approach to allow for arbitrary motion. Model problem results in one and two dimensions are included to demonstrate the viability of the method and the convergence properties. Section IV briefly outlines the implementation into the OVERFLOW solver, and the abstract closes with a description of the benchmark test cases which will be included in the final paper.

Leffell, Joshua Isaac↗

The strip method for shape derivatives

Abstract A major challenge in shape optimization is the coupling of finite element method (FEM) codes in a way that facilitates efficient computation of shape derivatives. This is particularly difficult with multiphysics problems involving legacy codes, where the costs of implementing and maintaining shape derivative capabilities are prohibitive. The volume and boundary methods are two approaches to computing shape derivatives. Each has a major drawback: the boundary method is less accurate, while the volume method is more invasive to the FEM code. We introduce the strip method , which computes shape derivatives on a strip adjacent to the boundary. The strip method makes code coupling simple. Like the boundary method, it queries the state and adjoint solutions at quadrature nodes, but requires no knowledge of the FEM code implementations. At the same time, it exhibits the higher accuracy of the volume method. As an added benefit, its computational complexity is comparable to that of the boundary method, that is, it is faster than the volume method. We illustrate the benefits of the strip method with numerical examples.

Hardesty, Sean↗

Modal identification of gyroscopic distributed-parameter systems

A new modal identification method for gyroscopic distributed-parameter systems is presented. The method represents an extension of previous work for the class of self-adjoint distributed-parameter systems. The modal identification method is formulated as a variational problem in which stationary values of a functional quotient are sought. The computation of the functional quotient is carried out using a set of admissible functions defined over the spatial domain of the system. As an illustration, the modal identification of a whirling shaft undergoing bending vibration is carried out and the effectiveness of the method is verified.

Norris, Mark A.↗

Domain decomposition methods for nonconforming finite element spaces of Lagrange-type

In this article, we consider the application of three popular domain decomposition methods to Lagrange-type nonconforming finite element discretizations of scalar, self-adjoint, second order elliptic equations. The additive Schwarz method of Dryja and Widlund, the vertex space method of Smith, and the balancing method of Mandel applied to nonconforming elements are shown to converge at a rate no worse than their applications to the standard conforming piecewise linear Galerkin discretization. Essentially, the theory for the nonconforming elements is inherited from the existing theory for the conforming elements with only modest modification by constructing an isomorphism between the nonconforming finite element space and a space of continuous piecewise linear functions.

Cowsar, Lawrence C.↗

Improved Earthquake Source Parameters with 3D Wavespeed Models in California and Nevada

Seismic tomography harnesses earthquake data to explore the inaccessible structure of the Earth. Adjoint waveform tomography (AWT), a method of seismic tomography, updates the tomographic model by optimizing the fit between observed earthquake data and synthetic waveforms. The synthetic data are calculated by solving the wave equation through a given 3D model. An important requirement to calculating synthetics is the source information (location, centroid time, depth, and moment tensor). Errors in source information affect the quality of the synthetics produced, which in turn can limit how structure can be inferred in the AWT workflow. Here, to test the effect of updating source information, we used MTTime (Chiang, 2020), a time-domain full-waveform moment tensor inversion code, to calculate the moment tensors and depths of 118 earthquakes that occurred in California and Nevada over a 20-yr period. We calculated 3D Green’s functions using a 3D seismic wavespeed model of California and Nevada (Doody et al., 2023b). We show that the inverted solutions provide better waveform fits than the Global Centroid Moment Tensor catalog and increase usable, well-correlated data by up to 7%. Therefore, we argue that recalculating source parameters should be considered in AWT workflows, particularly for smaller magnitude events (⁠M w > 5.0).

58 GEOSCIENCES↗

Eigenvalues of singular differential operators by finite difference methods. II.

Note is made of an earlier paper which defined finite difference operators for the Hilbert space L2(m), and gave the eigenvalues for these operators. The present work examines eigenvalues for higher order singular differential operators by using finite difference methods. The two self-adjoint operators investigated are defined by a particular value in the same Hilbert space, L2(m), and are strictly positive with compact inverses. A class of finite difference operators is considered, with the idea of application to the theory of Toeplitz matrices. The approximating operators consist of a good approximation plus a perturbing operator.

Baxley, J. V.↗

Influence of the Perception Constraint, Installation Effects, and Broadband SelfNoise on Low-Fidelity, Multi-point, UAM Vehicle Perception-Influenced-Design(PID) Optimization

UAM vehicles represent a unique challenge in acoustics because there are a limited number of full-scale datasets that can be used to calibrate and validate prediction models. In addition, acoustics is considered more often in the early design loop as a higher priority concern in UAM vehicle design, whereas with traditional vehicles, acoustics is typically addressed with post-design constraints. This paper will present an approach in design optimization of a proprotor in two flight conditions, hover, and forward flight, with several acoustic objective functions that simulate community response. An adjoint-capable vortex-lattice method (VLM), implemented in VSPAERO, will be used to compute the blade forces and inflow properties required to compute tonal and broadband noise using the second-generation Aircraft NOise Prediction Program (ANOPP2). In addition, a wing is placed near the proprotor to simulate installation effects on a vehicle’s wing. The influence of rotation rate, chord distribution, twist angle, and sweep on installation, broadband noise, and choice of perception constraint from the design optimization will be shown.

acoustics↗