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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
DOE OSTI2012

Intertwining relations and Darboux transformations for the wave equations

Using the intertwining operator technique we construct Darboux transformations for the wave equation with position-dependent effective mass and with linearly energy-dependent potentials. The formally adjoint generators of supersymmetry and two formally self-adjoint superpartner Hamiltonians are constructed and they close a quadratic pseudo-superalgebra. The Darboux transformations are constructed in differential and integral forms and an interrelation is established between them. The approach is applied to generation of isospectral potentials with additional or removal bound states or construction of new partner potentials without changing the spectrum, i.e. fully isospectral potentials. The method is illustrated by some concrete examples. The influence of distance between levels on the form of potentials is investigated. In particular, asymmetric double well potentials are generated.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS2003

Aerodynamic Shape Optimization Using Evolutionary Algorithms

A method for aerodynamic shape optimization based on an evolutionary algorithm approach is presented and demonstrated. Results are presented for a number of model problems to access the effect of algorithm parameters on convergence efficiency and reliability. A transonic viscous airfoil optimization problem, both single and two-objective variations, is used as the basis for a preliminary comparison with an adjoint-gradient optimizer. The evolutionary algorithm is coupled with a transonic full potential flow solver and is used to optimize the inviscid flow about transonic wings including multi-objective and multi-discipline solutions that lead to the generation of pareto fronts. The results indicate that the evolutionary algorithm approach is easy to implement, flexible in application and extremely reliable.

Holst, Terry L.↗
DOE OSTI2016

Analysis of dpa rates in the HFIR reactor vessel using a hybrid Monte Carlo/deterministic method

The Oak Ridge High Flux Isotope Reactor (HFIR), which began full-power operation in 1966, provides one of the highest steady-state neutron flux levels of any research reactor in the world. An ongoing vessel integrity analysis program to assess radiation-induced embrittlement of the HFIR reactor vessel requires the calculation of neutron and gamma displacements per atom (dpa), particularly at locations near the beam tube nozzles, where radiation streaming effects are most pronounced. In this study we apply the Forward-Weighted Consistent Adjoint Driven Importance Sampling (FW-CADIS) technique in the ADVANTG code to develop variance reduction parameters for use in the MCNP radiation transport code. We initially evaluated dpa rates for dosimetry capsule locations, regions in the vicinity of the HB-2 beamline, and the vessel beltline region. We then extended the study to provide dpa rate maps using three-dimensional cylindrical mesh tallies that extend from approximately 12 below to approximately 12 above the axial extent of the core. The mesh tally structures contain over 15,000 mesh cells, providing a detailed spatial map of neutron and photon dpa rates at all locations of interest. Relative errors in the mesh tally cells are typically less than 1%.

Blakeman, Edward↗
DOE OSTI2017

Final Report - Subcontract B6183769

During my visit to LLNL during July 5{15, 2016, we worked on linear system solvers. The two level hierarchical solver that initiated our study was developed to solve linear system arising from hp adaptive finite element calculations, and is implemented in the PLTMG software package, version 12 [1]. This preconditioner typically requires 3-20% of the space used by the stiffness matrix for higher order elements. It has multigrid like convergence rates for a wide variety of PDEs (self-adjoint positive definite elliptic equations, convection dominated convection-diffusion equations, and highly inde nite Helmholtz equations, among others). The convergence rate is not independent of the polynomial degree p as p ! 1, but but remains strong for p 9, which is the highest polynomial degree allowed in PLTMG, due to limitations of numerical quadrature formulae. A more complete description of the method and some numerical experiments illustrating its effectiveness appear in [2]. Like traditional geometric multilevel methods, this scheme relies on extensive knowledge of the underlying finite element space in order to construct both the smoother and the coarse grid correction components.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2003

Aerodynamic Shape Optimization using an Evolutionary Algorithm

A method for aerodynamic shape optimization based on an evolutionary algorithm approach is presented and demonstrated. Results are presented for a number of model problems to access the effect of algorithm parameters on convergence efficiency and reliability. A transonic viscous airfoil optimization problem-both single and two-objective variations is used as the basis for a preliminary comparison with an adjoint-gradient optimizer. The evolutionary algorithm is coupled with a transonic full potential flow solver and is used to optimize the inviscid flow about transonic wings including multi-objective and multi-discipline solutions that lead to the generation of pareto fronts. The results indicate that the evolutionary algorithm approach is easy to implement, flexible in application and extremely reliable.

Hoist, Terry L.↗
DOE OSTI2011

Casimir scaling and string breaking in G{sub 2} gluodynamics

We study the potential energy between static charges in G{sub 2} gluodynamics in three and four dimensions. Our work is based on an efficient local hybrid Monte Carlo algorithm and a multilevel Luescher-Weisz algorithm with exponential error reduction to accurately measure expectation values of Wilson and Polyakov loops. Both in three and four dimensions we show that at intermediate scales the string tensions for charges in various G{sub 2} representations scale with the second order Casimir. In three dimensions Casimir scaling is confirmed within 4% for charges in representations of dimensions 7, 14, 27, 64, 77, 77{sup '}, 182, and 189 and in four dimensions within 5% for charges in representations of dimensions 7, 14, 27, and 64. In three dimensions we detect string breaking for charges in the two fundamental representations. The scale for string breaking agrees very well with the mass of the created pair of glue lumps. Close to the string breaking distance Casimir scaling between adjoint and defining representation is violated by 2.5%. The analytical prediction for the continuum string tension is confirmed for the defining representation in three dimensions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2011

Phases of a two-dimensional large-N gauge theory on a torus

We consider two-dimensional large N gauge theory with D adjoint scalars on a torus, which is obtained from a D+2-dimensional pure Yang-Mills theory on T{sup D+2} with D small radii. The two-dimensional model has various phases characterized by the holonomy of the gauge field around noncontractible cycles of the 2-torus. We determine the phase boundaries and derive the order of the phase transitions using a method developed in an earlier work (hep-th/0910.4526), which is nonperturbative in the 't Hooft coupling and uses a 1/D expansion. We embed our phase diagram in the more extensive phase structure of the D+2-dimensional Yang-Mills theory and match with the picture of a cascade of phase transitions found earlier in lattice calculations. We also propose a dual gravity system based on a Scherk-Schwarz compactification of a D2 brane wrapped on a 3-torus and find a phase structure which is similar to the phase diagram found in the gauge theory calculation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS2012

Numerical Predictions of Sonic Boom Signatures for a Straight Line Segmented Leading Edge Model

A sonic boom wind tunnel test was conducted on a straight-line segmented leading edge (SLSLE) model in the NASA Langley 4- by 4- Foot Unitary Plan Wind Tunnel (UPWT). The purpose of the test was to determine whether accurate sonic boom measurements could be obtained while continuously moving the SLSLE model past a conical pressure probe. Sonic boom signatures were also obtained using the conventional move-pause data acquisition method for comparison. The continuous data acquisition approach allows for accurate signatures approximately 15 times faster than a move-pause technique. These successful results provide an incentive for future testing with greatly increased efficiency using the continuous model translation technique with the single probe to measure sonic boom signatures. Two widely used NASA codes, USM3D (Navier-Stokes) and CART3D-AERO (Euler, adjoint-based adaptive mesh), were used to compute off-body sonic boom pressure signatures of the SLSLE model at several different altitudes below the model at Mach 2.0. The computed pressure signatures compared well with wind tunnel data. The effect of the different altitude for signature extraction was evaluated by extrapolating the near field signatures to the ground and comparing pressure signatures and sonic boom loudness levels.

Elmiligui, Alaa A.↗
DOE OSTI2018

Final Report - Subcontract B629114

During my visits to LLNL August 20-24, 2018, and September 10-14, 2018, I worked on linear system solvers. The two level hierarchical solver that initiated our study was developed to solve linear systems arising from $hp$ adaptive finite element calculations, and is implemented in the PLTMG software package, version 13. This preconditioner typically requires 3 – 20% of the space used by the stiffness matrix for higher order elements. It has multigrid like convergence rates for a wide variety of PDEs (self-adjoint positive definite elliptic equations, convection dominated convection-diffusion equations, and highly indefinite Helmholtz equations, among others). The convergence rate is not independent of the polynomial degree $p$ as $p → ∞$, but but remains strong for $p ≤$ 9, which is the highest polynomial degree allowed in PLTMG , due to limitations of the numerical quadrature rules implemented in the software package. A more complete description of the method and some numerical experiments illustrating its effectiveness appear. Like traditional geometric multilevel methods, this scheme relies on knowledge of the underlying finite element space in order to construct the smoother and the coarse grid correction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Symmetry-enriched quantum spin liquids in (3 + 1)d

We use the intrinsic one-form and two-form global symmetries of (3+1)d bosonic field theories to classify quantum phases enriched by ordinary (0-form) global symmetry. Different symmetry-enriched phases correspond to different ways of coupling the theory to the background gauge field of the ordinary symmetry. The input of the classification is the higher-form symmetries and a permutation action of the 0-form symmetry on the lines and surfaces of the theory. From these data we classify the couplings to the background gauge field by the 0-form symmetry defects constructed from the higher-form symmetry defects. For trivial two-form symmetry the classification coincides with the classification for symmetry fractionalizations in (2 + 1)d. We also provide a systematic method to obtain the symmetry protected topological phases that can be absorbed by the coupling, and we give the relative ’t Hooft anomaly for different couplings. We discuss several examples including the gapless pure U(1) gauge theory and the gapped Abelian finite group gauge theory. As an application, we discover a tension with a conjectured duality in (3 + 1)d for SU(2) gauge theory with two adjoint Weyl fermions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
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↗
DOE OSTI2017

Final Report - Subcontract B623760

During my visit to LLNL during July 17{27, 2017, I worked on linear system solvers. The two level hierarchical solver that initiated our study was developed to solve linear systems arising from hp adaptive finite element calculations, and is implemented in the PLTMG software package, version 12. This preconditioner typically requires 3-20% of the space used by the stiffness matrix for higher order elements. It has multigrid like convergence rates for a wide variety of PDEs (self-adjoint positive de nite elliptic equations, convection dominated convection-diffusion equations, and highly indefinite Helmholtz equations, among others). The convergence rate is not independent of the polynomial degree p as p ! 1, but but remains strong for p 9, which is the highest polynomial degree allowed in PLTMG, due to limitations of the numerical quadrature rules implemented in the software package. A more complete description of the method and some numerical experiments illustrating its effectiveness appear in. Like traditional geometric multilevel methods, this scheme relies on knowledge of the underlying finite element space in order to construct the smoother and the coarse grid correction.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1987

Variational four-dimensional analysis using quasi-geostrophic constraints

A variational four-dimensional analysis technique using quasi-geostrophic models as constraints is examined using gridded fields as data. The analysis method uses a standard iterative nonlinear minimization technique to find the solution to the constraining forecast model which best fits the data as measured by a predefined functional. The minimization algorithm uses the derivative of the functional with respect to each of the initial condition values. This derivative vector is found by inserting the weighted differences between the model solution and the inserted data into a backwards integrating adjoint model. The four-dimensional analysis system was examined by applying it to fields created from a primitive equations model forecast and to fields created from satellite retrievals. The results show that the technique has several interesting characteristics not found in more traditional four-dimensional assimilation techniques. These features include a close fit of the model solution to the observations throughout the analysis interval and an insensitivity to the frequency of data insertion or the amount of data. The four-dimensional analysis technique is very versatile and can be extended to more complex problems with little theoretical difficulty.

Derber, John C.↗
DOE OSTI2018

Efficient Stochastic Inversion Using Adjoint Models and Kernel-PCA

Performing stochastic inversion on a computationally expensive forward simulation model with a high-dimensional uncertain parameter space (e.g. a spatial random field) is computationally prohibitive even with gradient information provided. Moreover, the ‘nonlinear’ mapping from parameters to observables generally gives rise to non-Gaussian posteriors even with Gaussian priors, thus hampering the use of efficient inversion algorithms designed for models with Gaussian assumptions. In this work, we propose a novel Bayesian stochastic inversion methodology, characterized by a tight coupling between a gradient-based Langevin Markov Chain Monte Carlo (LMCMC) method and a kernel principal component analysis (KPCA). This approach addresses the ‘curse-of-dimensionality’ via KPCA to identify a low-dimensional feature space within the high-dimensional and nonlinearly correlated spatial random field. Moreover, non-Gaussian full posterior probability distribution functions are estimated via an efficient LMCMC method on both the projected low-dimensional feature space and the recovered high-dimensional parameter space. We demonstrate this computational framework by integrating and adapting recent developments such as data-driven statistics-on-manifolds constructions and reduction-through-projection techniques to solve inverse problems in linear elasticity.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1975

Fixed-range optimum trajectories for short-haul aircraft

An algorithm, based on the energy-state method, is derived for calculating optimum trajectories with a range constraint. The basis of the algorithm is the assumption that optimum trajectories consist of, at most, three segments: an increasing energy segment (climb); a constant energy segment (cruise); and a decreasing energy segment (descent). This assumption allows energy to be used as the independent variable in the increasing and decreasing energy segments, thereby eliminating the integration of a separate adjoint differential equation and simplifying the calculus of variations problem to one requiring only pointwise extremization of algebraic functions. The algorithm is used to compute minimum fuel, minimum time, and minimum direct-operating-cost trajectories, with range as a parameter, for an in-service CTOL aircraft and for an advanced STOL aircraft. For the CTOL aircraft and the minimum-fuel performance function, the optimum controls, consisting of air-speed and engine power setting, are continuous functions of the energy in both climb and descent as well as near the maximum or cruise energy. This is also true for the STOL aircraft except in the descent where at one energy level a nearly constant energy dive segment occurs, yielding a discontinuity in the airspeed at that energy. The reason for this segment appears to be the relatively high fuel flow at idle power of the engines used by this STOL aircraft. Use of a simplified trajectory which eliminates the dive increases the fuel consumption of the total descent trajectory by about 10 percent and the time to fly the descent by about 19 percent compared to the optimum.

Erzberger, H.↗
DOE OSTI2019

Subcontract B635525 (Final Report)

During my visits to LLNL July 8–12 and July 22–26, 2019, I worked on linear system solvers. The two level hierarchical solver that initiated our study was developed to solve linear systems arising from $\textit{hp}$ adaptive finite element calculations, and is implemented in the $\textit{PLTMG}$ software package, version 13. This preconditioner typically requires 3–20% of the space used by the stiffness matrix for higher order elements. It has multigrid like convergence rates for a wide variety of PDEs (self-adjoint positive definite elliptic equations, convection dominated convection-diffusion equations, and highly indefinite Helmholtz equations, among others). The convergence rate is not independent of the polynomial degree $\textit{p}$ as $\textit{p} → ∞$, but remains strong for $\textit{p}$ ≤ 9, which is the highest polynomial degree allowed in $\textit{PLTMG}$, due to limitations of the numerical quadrature rules implemented in the soft- ware package. A more complete description of the method and some numerical experiments illustrating its effectiveness appear in. Like traditional geometric multilevel methods, this scheme relies on knowledge of the underlying finite element space in order to construct the smoother and the coarse grid correction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Fast multiscale contrast independent preconditioners for linear elastic topology optimization problems

The goal of this work is to present a fast and viable approach for the numerical solution of the high-contrast state problems arising in topology optimization. The optimization process is iterative, and the gradients are obtained by an adjoint analysis, which requires the numerical solution of large high-contrast linear elastic problems with features spanning several length scales. The size of the discretized problems forces the utilization of iterative linear solvers with solution time dependent on the quality of the preconditioner. The lack of clear separation between the scales, as well as the high-contrast, imposes severe challenges on the standard preconditioning techniques. Thus, here we propose new methods for the high-contrast elasticity equation with performance independent of the high-contrast and the multi-scale structure of the elasticity problem. The solvers are based on two-levels domain decomposition techniques with a carefully constructed coarse level to deal with the high-contrast and multi-scale nature of the problem. The construction utilizes spectral equivalence between scalar diffusion and each displacement block of the elasticity problems and, in contrast to previous solutions proposed in the literature, is able to select the appropriate dimension of the coarse space automatically. The new methods inherit the advantages of domain decomposition techniques, such as easy parallelization and scalability. Finally, the presented numerical experiments demonstrate the excellent performance of the proposed methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Efficient Stochastic Inversion Using Adjoint Models and Kernel-PCA

Performing stochastic inversion on a computationally expensive forward simulation model with a high-dimensional uncertain parameter space (e.g. a spatial random field) is computationally prohibitive even when gradient information can be computed efficiently. Moreover, the ‘nonlinear’ mapping from parameters to observables generally gives rise to non-Gaussian posteriors even with Gaussian priors, thus hampering the use of efficient inversion algorithms designed for models with Gaussian assumptions. In this paper, we propose a novel Bayesian stochastic inversion methodology, which is characterized by a tight coupling between the gradient-based Langevin Markov Chain Monte Carlo (LMCMC) method and a kernel principal component analysis (KPCA). This approach addresses the ‘curse-of-dimensionality’ via KPCA to identify a low-dimensional feature space within the high-dimensional and nonlinearly correlated parameter space. In addition, non-Gaussian posterior distributions are estimated via an efficient LMCMC method on the projected low-dimensional feature space. We will demonstrate this computational framework by integrating and adapting our recent data-driven statistics-on-manifolds constructions and reduction-through-projection techniques to a linear elasticity model.

42 ENGINEERING↗