SEARCH · Engineering Papers

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 541 records · Page 30

All sources NASA NTRS DOE OSTI

NASA NTRSDate not supplied

Effect of Flight on the Noise from Turbulent Jets in the Generalized Acoustic Analogy

This paper presents an extension of a noise prediction method for static jets based on the Generalized Acoustic Analogy to include a non-zero ambient stream to simulate the effects of flight. Extended formulae for the propagator functions, source terms and the far-field acoustic spectrum are derived. The formulations of the equation and the boundary conditions for numerical solution of the scalar adjoint Green’s function in the presence of a non-zero ambient stream are also given. Wherever possible, the corresponding equations in the original papers for the static case and their extensions to include a flight stream are identified. The extended formulation is implemented into an existing code and used to make predictions of the effect of the flight stream on the observed far-field noise for a series of subsonic, unheated, axisymmetric jets over a range of jet-exit and free-stream velocities using Reynolds-averaged Navier-Stokes flow solutions as input. The predictions are compared with data from experiments conducted at NASA Glenn Research Center which extend a fundamental jet noise database to include a flight stream of various speeds. Descriptions of the experimental setup, data acquisition, post-processing and corrections applied to account for the external shear-layer are given. It is shown that the acoustic analogy-based method can provide reasonably good predictions of the impact of an external flight stream on the spectral characteristics of noise from unheated round jets.

Jet noise↗

NASA NTRSDate not supplied

Effect of Flight on the Noise from Turbulent Jets in the Generalized Acoustic Analogy

Jet noise↗

NASA NTRSDate not supplied

Effect of Flight on the Noise from Turbulent Jets in the Generalized Acoustic Analogy

This presents an extension of a noise prediction method for static jets based on the Generalized Acoustic Analogy to include a non-zero ambient stream to simulate the effects of flight. Extended formulae for the propagator functions, source terms and the far-field acoustic spectrum are derived. The formulations of the equation and the boundary conditions for numerical solution of the scalar adjoint Green’s function in the presence of a non-zero ambient stream are also given. Wherever possible, the corresponding equations in the original papers for the static case and their extensions to include a flight stream are identified. The extended formulation is implemented into an existing code and used to make predictions of the effect of the flight stream on the observed far-field noise for a series of subsonic, unheated, axisymmetric jets over a range of jet-exit and free-stream velocities using Reynolds-averaged Navier-Stokes flow solutions as input. The predictions are compared with data from experiments conducted at NASA Glenn Research Center which extend a fundamental jet noise database to include a flight stream of various speeds. Descriptions of the experimental setup, data acquisition, post-processing and corrections applied to account for the external shear-layer are given. It is shown that the acoustic analogy-based method can provide reasonably good predictions of the impact of an external flight stream on the spectral characteristics of noise from unheated round jets.

Jet noise↗

DOE OSTI2014

Adaptive h -refinement for reduced-order models: ADAPTIVE h -refinement for reduced-order models

Our work presents a method to adaptively refine reduced-order models a posteriori without requiring additional full-order-model solves. The technique is analogous to mesh-adaptive h-refinement: it enriches the reduced-basis space online by ‘splitting’ a given basis vector into several vectors with disjoint support. The splitting scheme is defined by a tree structure constructed offline via recursive k-means clustering of the state variables using snapshot data. This method identifies the vectors to split online using a dual-weighted-residual approach that aims to reduce error in an output quantity of interest. The resulting method generates a hierarchy of subspaces online without requiring large-scale operations or full-order-model solves. Furthermore, it enables the reduced-order model to satisfy any prescribed error tolerance regardless of its original fidelity, as a completely refined reduced-order model is mathematically equivalent to the original full-order model. Experiments on a parameterized inviscid Burgers equation highlight the ability of the method to capture phenomena (e.g., moving shocks) not contained in the span of the original reduced basis.

42 ENGINEERING↗

DOE OSTI2016

A Posteriori Error Analysis of Two-Stage Computation Methods with Application to Efficient Discretization and the Parareal Algorithm

We consider numerical methods for initial value problems that employ a two stage approach consisting of solution on a relatively coarse discretization followed by solution on a relatively fine discretization. Examples include adaptive error control, parallel-in-time solution schemes, and efficient solution of adjoint problems for computing a posteriori error estimates. We describe a general formulation of two stage computations then perform a general a posteriori error analysis based on computable residuals and solution of an adjoint problem. The analysis accommodates various variations in the two stage computation and in formulation of the adjoint problems. We apply the analysis to compute “dual-weighted” a posteriori error estimates, to develop novel algorithms for efficient solution that take into account cancellation of error, and to the Parareal Algorithm. We test the various results using several numerical examples.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1984

A substructure coupling procedure applicable to general linear time-invariant dynamic systems

A substructure synthesis procedure applicable to structural systems containing general nonconservative terms is presented. In their final form, the non-self-adjoint substructure equations of motion are cast in state vector form through the use of a variational principle. A reduced-order model for each substructure is implemented by representing the substructure as a combination of a small number of Ritz vectors. For the method presented, the substructure Ritz vectors are identified as a truncated set of substructure eigenmodes, which are typically complex, along with a set of generalized real attachment modes. The formation of the generalized attachment modes does not require any knowledge of the substructure flexible modes; hence, only the eigenmodes used explicitly as Ritz vectors need to be extracted from the substructure eigenproblem. An example problem is presented to illustrate the method.

Howsman, T. G.↗

NASA NTRS1984

A substructure coupling procedure applicable to general linear time-invariant dynamic systems

A substructure synthesis procedure applicable to structural systems containing general nonconservative terms is presented. In their final form, the nonself-adjoint substructure equations of motion are cast in state vector form through the use of a variational principle. A reduced-order mode for each substructure is implemented by representing the substructure as a combination of a small number of Ritz vectors. For the method presented, the substructure Ritz vectors are identified as a truncated set of substructure eigenmodes, which are typically complex, along with a set of generalized real attachment modes. The formation of the generalized attachment modes does not require any knowledge of the substructure flexible modes; hence, only the eigenmodes used explicitly as Ritz vectors need to be extracted from the substructure eigenproblem. An example problem is presented to illustrate the method.

Howsman, T. G.↗

NASA NTRS2018

Comparison of MERRA-2 and ECCO-V4 Ocean Surface Heat Fluxes: Consequences of Different Forcing Feedbacks on Ocean Circulation and Implications for Climate Data Assimilation

Forcing ocean models with reanalysis data is a common practice in ocean modeling. As part of this practice, prescribed atmospheric state variables and interactive ocean SST (Sea Surface Temperature) are used to calculate fluxes between the ocean and the atmosphere. When forcing an ocean model with reanalysis fields, errors in the reanalysis data, errors in the ocean model and errors in the forcing formulation will generate a different solution compared to other ocean reanalysis solutions (which also have their own errors). As a first step towards a consistent coupled ocean-atmosphere reanalysis, we compare surface heat fluxes from a state-of-the-art atmospheric reanalysis, the Modern-Era Retrospective analysis for Research and Applications, Version 2 (MERRA-2), to heat fluxes from a state-of-the-art oceanic reanalysis, the Estimating the Circulation and Climate of the Ocean Version 4, Release 2 (ECCO-v4). Then, we investigate the errors associated with the MITgcm (Massachusetts Institute of Technology general circulation model) ocean model in its ECCO-v4 ocean reanalysis configuration (1992-2011) when it is forced with MERRA- 2 atmospheric reanalysis fields instead of with the ECCO-v4 adjoint optimized ERA-interim state variables. This is done by forcing ECCO-v4 ocean with and without feedbacks from MERRA-2 related to turbulent fluxes of heat and moisture and the outgoing long wave radiation. In addition, we introduce an intermediate forcing method that includes only the feedback from the interactive outgoing long wave radiation. The resulting ocean circulation is compared with ECCO-v4 reanalysis and in-situ observations. We show that, without feedbacks, imbalances in the energy and the hydrological cycles of MERRA-2 (which are directly related to the fact it was created without interactive ocean) result in considerable SST drifts and a large reduction in sea level. The bulk formulae and interactive outgoing long wave radiation, although providing air-sea feedbacks and reducing model-data misfit, strongly relax the ocean to observed SST and may result in unwanted features such as large change in the water budget. These features have implications in a desired forcing recipe to be used. The results strongly and unambiguously argue for next generation data assimilation climate studies to involve fully coupled systems.

MERRA-2↗

DOE OSTI2018

A line search algorithm for wind field adjustment with incomplete data and RBF approximation

The problem of concern in this work is the construction of free divergence fields given scattered horizontal components. As customary, the problem is formulated as a PDE constrained least squares problem. The novelty of our approach is to construct the so-called adjusted field, as the unique solution along an appropriately chosen descent direction. The latter is obtained by the adjoint equation technique. It is shown that the classical adjusted field of Sasaki’s is a particular case. On choosing descent directions, the underlying mass consistent model leads to the solution of an elliptic problem which is solved by means of a radial basis functions method. Finally, some numerical results for wind field adjustment are presented.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

POD/DEIM reduced-order strategies for efficient four dimensional variational data assimilation

This work studies reduced order modeling (ROM) approaches to speed up the solution of variational data assimilation problems with large scale nonlinear dynamical models. It is shown that a key requirement for a successful reduced order solution is that reduced order Karush–Kuhn–Tucker conditions accurately represent their full order counterparts. In particular, accurate reduced order approximations are needed for the forward and adjoint dynamical models, as well as for the reduced gradient. New strategies to construct reduced order based are developed for proper orthogonal decomposition (POD) ROM data assimilation using both Galerkin and Petrov–Galerkin projections. For the first time POD, tensorial POD, and discrete empirical interpolation method (DEIM) are employed to develop reduced data assimilation systems for a geophysical flow model, namely, the two dimensional shallow water equations. Numerical experiments confirm the theoretical framework for Galerkin projection. In the case of Petrov–Galerkin projection, stabilization strategies must be considered for the reduced order models. The new reduced order shallow water data assimilation system provides analyses similar to those produced by the full resolution data assimilation system in one tenth of the computational time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2023

hIPPYlib-MUQ: A Bayesian Inference Software Framework for Integration of Data with Complex Predictive Models under Uncertainty

Bayesian inference provides a systematic framework for integration of data with mathematical models to quantify the uncertainty in the solution of the inverse problem. However, the solution of Bayesian inverse problems governed by complex forward models described by partial differential equations (PDEs) remains prohibitive with black-box Markov chain Monte Carlo (MCMC) methods. We present hIPPYlib-MUQ, an extensible and scalable software framework that contains implementations of state-of-the art algorithms aimed to overcome the challenges of high-dimensional, PDE-constrained Bayesian inverse problems. These algorithms accelerate MCMC sampling by exploiting the geometry and intrinsic low-dimensionality of parameter space via derivative information and low rank approximation. The software integrates two complementary open-source software packages, hIPPYlib and MUQ. hIPPYlib solves PDE-constrained inverse problems using automatically-generated adjoint-based derivatives, but it lacks full Bayesian capabilities. MUQ provides a spectrum of powerful Bayesian inversion models and algorithms, but expects forward models to come equipped with gradients and Hessians to permit large-scale solution. By combining these two complementary libraries, we created a robust, scalable, and efficient software framework that realizes the benefits of each and allows us to tackle complex large-scale Bayesian inverse problems across a broad spectrum of scientific and engineering disciplines. To illustrate the capabilities of hIPPYlib-MUQ, we present a comparison of a number of MCMC methods available in the integrated software on several high-dimensional Bayesian inverse problems. These include problems characterized by both linear and nonlinear PDEs, various noise models, and different parameter dimensions. The results demonstrate that large (~ 50×) speedups over conventional black box and gradient-based MCMC algorithms can be obtained by exploiting Hessian information (from the log-posterior), underscoring the power of the integrated hIPPYlib-MUQ framework.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Anomalies of 4d SpinG theories

Abstract We consider ’t Hooft anomalies of four-dimensional gauge theories whose fermion matter content admits Spin G (4) generalized spin structure, withGeither gauged or a global symmetry. We discuss methods to directly computew 2 ∪w 3 ’t Hooft anomalies involving Stiefel-Whitney classes of gauge and flavor symmetry bundles that such theories can have on non-spin manifolds, e.g.M 4 = ℂℙ 2 . Such anomalies have been discussed for SU(2) gauge theory with adjoint fermions, where they were shown to give an effect that was originally found in the Donaldson-Witten topological twist of$$ \mathcal{N} $$ N = 2 SYM theory. We directly compute these anomalies for a variety of theories, including generalGgauge theories with adjoint fermions, SU(2) gauge theory with fermions in general representations, and Spin(N) gauge theories with fundamental matter. We discuss aspects of matching these and other ’t Hooft anomalies in the IR phase where global symmetries are spontaneously broken, in particular for generalG gauge theory withN f adjoint Weyl fermions. For example, in the case ofN f = 2 we discuss anomaly matching in the IR phase consisting of$$ {h}_{G_{\textrm{gauge}}}^{\vee } $$ h G gauge ∨ copies of a ℂℙ 1 non-linear sigma model, including for thew 2 w 3 anomalies when formulated with$$ {\textrm{Spin}}_{\textrm{SU}{(2)}_{\textrm{global}}}(4) $$ Spin SU 2 global 4 structure.

Physics↗

DOE OSTI2017

Operator splitting method for simulation of dynamic flows in natural gas pipeline networks

Here, we develop an operator splitting method to simulate flows of isothermal compressible natural gas over transmission pipelines. The method solves a system of nonlinear hyperbolic partial differential equations (PDEs) of hydrodynamic type for mass flow and pressure on a metric graph, where turbulent losses of momentum are modeled by phenomenological Darcy-Weisbach friction. Mass flow balance is maintained through the boundary conditions at the network nodes, where natural gas is injected or withdrawn from the system. Gas flow through the network is controlled by compressors boosting pressure at the inlet of the adjoint pipe. Our operator splitting numerical scheme is unconditionally stable and it is second order accurate in space and time. The scheme is explicit, and it is formulated to work with general networks with loops. We test the scheme over range of regimes and network configurations, also comparing its performance with performance of two other state of the art implicit schemes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2017

Numerical convergence and validation of the DIMP inverse particle transport model

The data integration with modeled predictions (DIMP) model is a promising inverse radiation transport method for solving the special nuclear material (SNM) holdup problem. Unlike previous methods, DIMP is a completely passive nondestructive assay technique that requires no initial assumptions regarding the source distribution or active measurement time. DIMP predicts the most probable source location and distribution through Bayesian inference and quasi-Newtonian optimization of predicted detector re-sponses (using the adjoint transport solution) with measured responses. DIMP performs well with for-ward hemispherical collimation and unshielded measurements, but several considerations are required when using narrow-view collimated detectors. DIMP converged well to the correct source distribution as the number of synthetic responses increased. DIMP also performed well for the first experimental validation exercise after applying a collimation factor, and sufficiently reducing the source search vol-ume's extent to prevent the optimizer from getting stuck in local minima. DIMP's simple point detector response function (DRF) is being improved to address coplanar false positive/negative responses, and an angular DRF is being considered for integration with the next version of DIMP to account for highly collimated responses. Overall, DIMP shows promise for solving the SNM holdup inverse problem, especially once an improved optimization algorithm is implemented.

42 ENGINEERING↗

DOE OSTI2022

Single-stage gradient-based stellarator coil design: Optimization for near-axis quasi-symmetry

Here we present a new coil design paradigm for magnetic confinement in stellarators. Our approach directly optimizes coil shapes and coil currents to produce a vacuum quasi-symmetric magnetic field with a target rotational transform on the magnetic axis. This approach differs from the traditional two-stage approach in which first a magnetic configuration with desirable physics properties is found, and then coils to approximately realize this magnetic configuration are designed. The proposed single-stage approach allows us to find a compromise between confinement and engineering requirements, i.e., find easy-to-build coils with good confinement properties. Using forward and adjoint sensitivities, we derive derivatives of the physical quantities in the objective, which is constrained by a nonlinear periodic differential equation. In two numerical examples, we compare different gradient-based descent algorithms and find that incorporating approximate second-order derivative information through a quasi-Newton method is crucial for convergence. We also explore the optimization landscape in the neighborhood of a minimizer and find many directions in which the objective is mostly flat, indicating ample freedom to find simple and thus easy-to-build coils.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

A deterministic method for PWR loading pattern optimization

A new deterministic approach to core loading optimization is presented. Selection of fuel enrichment and burnable poison (BP) arrangement in a pressurized water reactor (PWR) core are optimally determined subject to power peaking factor (PF) constraints. The deterministic approach is based on the method of Lagrange multipliers and the direct adjoining approach for the inequality power PF constraint. The optimality conditions are derived using calculus of variations resulting in the presence of jump conditions and a linear control Hamiltonian. The optimal control problems are addressed by simultaneously minimizing the Hamiltonian using the gradient method and performing Newton's method in different regions of the core to produce viable solutions for the controls. Without active control of the power profile in PWRs during depletion, our methodology is able to satisfy the power PF constraint at all times by proper loading selection at the beginning of cycle (BOC). This is achieved by promoting the proper burnup path forward in time during the calculation of the forward optimality conditions. Here this information is utilized in the adjoint burnup calculation, which acts to propagate the optimal control path back to the BOC during the calculation of the adjoint optimality conditions. The methodology has been developed into a new code DMCO (Deterministic Multi-Control Optimization) which can produce two-dimensional two-group depletion results in approximately seven minutes per optimization iteration on a personal computer. No application of heuristics is required and the code is capable of finding solutions from initial control distributions. A preliminary case study is presented for the Westinghouse AP600 first cycle fuel loading design which achieved an extended fuel cycle while satisfying power PF constraints.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

DOE OSTI2021

Performance Improvements for the Griffin Transport Solvers

Griffin is a Multiphysics Object-Oriented Simulation Environment based reactor multiphysics analysis application jointly developed by Idaho National Laboratory and Argonne National Laboratory. Griffin includes a variety of deterministic radiation transport solvers for fixed source, k-eigenvalue, adjoint, and subcritical multiplication, as well as transient solvers for point-kinetics, improved quasi-static, and spatial dynamics. A code assessment performed in FY-20 identified two significant issues with the transport solvers in Griffin: first, the primary heterogeneous SN (discrete ordinates) transport solver based on continuous finite element methods required significant mesh refinement and higher memory usage compared to solvers based on the method of characteristic for equivalent accuracy. Second, the homogeneous PN (spherical harmonics expansion) transport solver did not adequately support polynomial refinement, which is a feature usually required for problems with spatial homogenization and pronounced streaming, typical in fast or gas-cooled reactor systems. To address the first issue, the development effort focused on the more promising discontinuous finite element method (DFEM)-based SN transport solver in Griffin. The addition of an asynchronous parallel transport sweeper and coarse mesh finite difference (CMFD) acceleration have rendered a superior heterogeneous SN transport capability for multiphysics problems that requires far less computing resources in terms of both CPU time and memory usage. This is demonstrated with typical thermal- and fast-spectrum reactor benchmark problems, including 2D Transient Reactor Test, 3D Advanced Burner Test Reactor (ABTR), and 2D and 3D Empire microreactor. For the second issue, the development effort focused on a new transport solver based on the hybrid finite element PN method (HFEM-PN), equivalent to the variational nodal method, as well as a new diffusion solver based on HFEM-Diffusion. This solver is intended for homogenized domains with multiphysics coupling (i.e., supports mesh displacement, seamless temperature feedback, etc.). Initial calculations with the HFEM-Diffusion implementation show very good parallel efficiency for the residual evaluations with the 2D ABTR benchmark. A future development effort will be centered on further improvements to the CMFD, HFEM-PN, and DFEM diffusion solvers to ensure Griffin meets performance and software quality assurance requirements for advanced reactor design and analysis.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2017

Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory

We present two efficient iterative algorithms for solving the linear response eigen- value problem arising from the time dependent density functional theory. Although the matrix to be diagonalized is nonsymmetric, it has a special structure that can be exploited to save both memory and floating point operations. In particular, the nonsymmetric eigenvalue problem can be transformed into a product eigenvalue problem that is self-adjoint with respect to a K-inner product. This product eigenvalue problem can be solved efficiently by a modified Davidson algorithm and a modified locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm that make use of the K-inner product. The solution of the product eigenvalue problem yields one component of the eigenvector associated with the original eigenvalue problem. However, the other component of the eigenvector can be easily recovered in a postprocessing procedure. Therefore, the algorithms we present here are more efficient than existing algorithms that try to approximate both components of the eigenvectors simultaneously. The efficiency of the new algorithms is demonstrated by numerical examples.

97 MATHEMATICS AND COMPUTING↗