Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Adjoint”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 109 records · Page 6

A Feynman-Kac based numerical method for the exit time probability of a class of transport problems

The exit time probability, which gives the likelihood that an initial condition leaves a prescribed region of the phase space of a dynamical system at, or before, a given time, is arguably one of the most natural and important transport problems. In this work, we present an accurate and efficient numerical method for computing this probability for systems described by non-autonomous (time-dependent) stochastic differential equations (SDEs) or their equivalent Fokker-Planck partial differential equations. The method is based on the direct approximation of the Feynman-Kac formula that establishes a link between the adjoint Fokker-Planck equation and the forward SDE. The Feynman-Kac formula is approximated using the Gauss-Hermite quadrature rules and piecewise cubic Hermite interpolating polynomials, and a GPU accelerated matrix representation is used to compute the entire time evolution of the exit time probability using a single pass of the algorithm. The method is unconditionally stable, exhibits second order convergence in space, first order convergence in time, and it is straightforward to parallelize. Applications are presented to the advection diffusion of a passive tracer in a fluid flow exhibiting chaotic advection, and to the runaway acceleration of electrons in a plasma in the presence of an electric field, collisions, and radiation damping. Benchmarks against analytical solutions as well as comparisons with explicit and implicit finite difference standard methods for the adjoint Fokker-Planck equation are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A scalable matrix-free spectral element approach for unsteady PDE constrained optimization using PETSc/TAO

In this work, we provide a new approach for the efficient matrix-free application of the transpose of the Jacobian for the spectral element method for the adjoint-based solution of partial differential equation (PDE) constrained optimization. This results in optimizations of nonlinear PDEs using explicit integrators where the integration of the adjoint problem is not more expensive than the forward simulation. Solving PDE constrained optimization problems entails combining expertise from multiple areas, including simulation, computation of derivatives, and optimization. The Portable, Extensible Toolkit for Scientific computation (PETSc) together with its companion package, the Toolkit for Advanced Optimization (TAO), is an integrated numerical software library that contains an algorithmic/software stack for solving linear systems, nonlinear systems, ordinary differential equations, differential algebraic equations, and large-scale optimization problems and, as such, is an ideal tool for performing PDE-constrained optimization. This paper describes an efficient approach in which the software stack provided by PETSc/TAO can be used for large-scale nonlinear time-dependent problems. Time integration can involve a range of high-order methods, both implicit and explicit. The PDE-constrained optimization algorithm used is gradient-based and seamlessly integrated with the simulation of the physical problem.

97 MATHEMATICS AND COMPUTING↗

A Sparse-Grid Probabilistic Scheme for Approximation of the Runaway Probability of Electrons in Fusion Tokamak Simulation

Runaway electrons (RE) generated during magnetic disruptions present a major threat to the safe operation of plasma nuclear fusion reactors. A critical aspect of understanding RE dynamics is to calculate the runaway probability, i.e., the probability that an electron in the phase space will runaway on, or before, a prescribed time. Such probability can be obtained by solving the adjoint equation of the underlying Fokker-Planck equation that controls the electron dynamics. In this effort, we present a sparse-grid probabilistic scheme for computing the runaway probability. The key ingredient of our approach is to represent the solution of the adjoint equation as a conditional expectation, such that discretizing the differential operator reduces to the approximation of a set of integrals. Adaptive sparse grid interpolation is utilized to approximate the map from the phase space to the runaway probability. The main novelties of this effort are the integration of the sparse-grid method into the probabilistic numerical scheme for computing escape probability, and the application of the proposed method in computing RE probabilities. Two numerical examples are given to illustrate that the proposed method can achieve O(Δt) convergence, and that the local anisotropic adaptive refinement strategy (M. Stoyanov, Adaptive sparse grid construction in a context of local anisotropy and multiple hierarchical parents. In: Sparse Grids and Applications-Miami 2016, Springer, Berlin, 2018, pp. 175–199) can effectively handle the sharp transition layer between the runaway and non-runaway regions.

Yang, Minglei↗

Double-copy towards supergravity inflation with α-attractor models

A bstract Key to the simplicity of supergravity α -attractor models of inflation are Volkov-Akulov fermions, often in the form of nilpotent superfields. Here we explore the possibility of using the double-copy to construct theories of Dirac-Born-Infeld-Volkov-Akulov (DBIVA) coupled to supergravity. A color-dual bootstrap admits scattering amplitudes involving pions and vectors through five-point tree-level order by order in mass-dimension, but requires the introduction of a Tr( F 3 ) operator. Gauge theories with this operator were recently found to require a tower of higher-derivative operators to be compatible with the duality between color and kinematics. Adjoint-type double-copy construction at its most conservative seems to require the UV completion of DBIVA + pure Poincaré supergravity scattering amplitudes to a family of theories involving DBIVA-like particles coupled to Weyl-Einstein supergravity. We also point out an alternative solution to color-dual gauged pions that allows adjoint double-copy without a tower of higher derivative corrections but at the cost of exchange symmetry between scalars.

Physics↗

On duality of color and kinematics in (A)dS momentum space

We explore color-kinematic duality for tree-level AdS/CFT correlators in momentum space. We start by studying the bi-adjoint scalar in AdS at tree-level as an illustrative example. We follow this by investigating two forms of color-kinematic duality in Yang-Mills theory, the first for the integrated correlator in AdS 4 and the second for the integrand in general AdS d +1 . For the integrated correlator, we find color-kinematics does not yield additional relations among n -point, color-ordered correlators. To study color-kinematics for the AdS d +1 Yang-Mills integrand, we use a spectral representation of the bulk-to-bulk propagator so that AdS diagrams are similar in structure to their flat space counterparts. Finally, we study color KLT relations for the integrated correlator and double-copy relations for the AdS integrand. We find that double-copy in AdS naturally relates the bi-adjoint theory in AdS d +3 to Yang-Mills in AdS d +1 . We also find a double-copy relation at three-points between Yang-Mills in AdS d +1 and gravity in AdS d– 1 and comment on the higher-point generalization. By analytic continuation, these results on AdS/CFT correlators can be translated into statements about the wave function of the universe in de Sitter.

gauge-gravity correspondence↗

Higher-derivative relations between scalars and gluons

We extend the covariant color-kinematics duality introduced by Cheung and Mangan to effective field theories. We focus in particular on relations between the effective field theories of gluons only and of gluons coupled to bi-adjoint scalars. Maps are established between their respective equations of motion and between their tree-level scattering amplitudes. An additional rule for the replacement of flavor structures by kinematic factors realizes the map between higher-derivative amplitudes. As an example of new relations, the pure-gluon amplitudes of mass dimension up to eight, featuring insertions of the F 3 and F 4 operators which satisfy the traditional color-kinematics duality, can be generated at all multiplicities from just renormalizable amplitudes of gluons and bi-adjoint scalars. We also obtain closed-form expressions for the kinematic numerators of the dimension-six gluon effective field theory, which are valid in D space-time dimensions. Finally, we find strong evidence that this extended covariant color-kinematics duality relates the (DF) 2 +YM(+Φ 3 ) theories which, at low energies, generate infinite towers of operators satisfying the traditional color-kinematics duality, beyond aforementioned F 3 and F 4 ones.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Bootstrapping conformal QED 3 and deconfined quantum critical point

We bootstrap the deconfined quantum critical point (DQCP) and 3D Quantum Electrodynamics (QED 3 ) coupled to N f flavors of two-component Dirac fermions. We show the lattice and perturbative results on the SO(5) symmetric DQCP are excluded by the bootstrap bounds with an assumption that the lowest singlet scalar is irrelevant. Remarkably, we discover a new family of kinks in the 3D SO(N) vector bootstrap bounds with N ⩾ 6. We demonstrate coincidences between SU(N f ) adjoint and $SO (N^2_f-1$) vector bootstrap bounds due to a novel algebraic relation between the crossing equations. By introducing gap assumptions breaking the $SO (N^2_f-1$) symmetry, the SU(N f ) adjoint bootstrap bounds with large N f converge to the 1/N f perturbative results of QED 3 . Our results provide strong evidence that the SO(5) DQCP is not continuous and the critical flavor number of QED 3 is slightly above 2: $N^*_f\in$ (2,4). Bootstrap results near $N^*_f$ are well consistent with the merger and annihilation mechanism for the loss of conformality in QED 3 .

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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↗

A note on the reliability of goal-oriented error estimates for Galerkin finite element methods with nonlinear functionals

Here, we consider estimating the discretization error in a nonlinear functional J (u) in the setting of an abstract variational problem: find u ϵ $\mathscr{V}$ such that B (u, φ) = L (φ) ∀φ ϵ $\mathscr{V}$, as approximated by a Galerkin finite element method. Here, $\mathscr{V}$ is a Hilbert space, B (. , .) is a bilinear form, and L (∙) is a linear functional. We consider well-known error estimates η of the form J (u) - J (u h ) ≈ η = L (z) - B (u h , z), where u h denotes a finite element approximation to u, and z denotes the solution to an auxiliary adjoint variational problem. We show that there exist nonlinear functionals for which error estimates of this form are not reliable, even in the presence of an exact adjoint solution z. An estimate η is said to be reliable if there exists a constant C ϵ $\mathbb{R}$ >0 independent of u h such that |J (u) - J (u h )| ≤ C|η|. We present several example pairs of bilinear forms and nonlinear functionals where reliability of η is not achieved.

A posteriori↗

A general approach to seismic inversion with automatic differentiation

Imaging Earth structure or seismic sources from seismic data involves minimizing a target misfit function, and is commonly solved through gradient-based optimization. The adjoint-state method has been developed to compute the gradient efficiently; however, its implementation can be time-consuming and difficult. We develop a general seismic inversion framework to calculate gradients using reverse-mode automatic differentiation. The central idea is that adjoint-state methods and reverse-mode automatic differentiation are mathematically equivalent. Here, the mapping between numerical PDE simulation and deep learning allows us to build a seismic inverse modeling library, ADSeismic, based on deep learning frameworks, which supports high performance reverse-mode automatic differentiation on CPUs and GPUs. We demonstrate the performance of ADSeismic on inverse problems related to velocity model estimation, rupture imaging, earthquake location, and source time function retrieval. ADSeismic has the potential to solve a wide variety of inverse modeling applications within a unified framework.

58 GEOSCIENCES↗

DPM: A deep learning PDE augmentation method with application to large-eddy simulation

A framework is introduced that leverages known physics to reduce overfitting in machine learning for scientific applications. The partial differential equation (PDE) that expresses the physics is augmented with a neural network that uses available data to learn a description of the corresponding unknown or unrepresented physics. Training within this combined system corrects for missing, unknown, or erroneously represented physics, including discretization errors associated with the PDE's numerical solution. For optimization of the network within the PDE, an adjoint PDE is solved to provide high-dimensional gradients, and a stochastic adjoint method (SAM) further accelerates training. Additionally, the approach is demonstrated for large-eddy simulation (LES) of turbulence. High-fidelity direct numerical simulations (DNS) of decaying isotropic turbulence provide the training data used to learn sub-filter-scale closures for the filtered Navier–Stokes equations. Out-of-sample comparisons show that the deep learning PDE method outperforms widely-used models, even for filter sizes so large that they become qualitatively incorrect. It also significantly outperforms the same neural network when a priori trained based on simple data mismatch, not accounting for the full PDE. Measures of discretization errors, which are well-known to be consequential in LES, point to the importance of the unified training formulation's design, which without modification corrects for them. For comparable accuracy, simulation runtime is significantly reduced. A relaxation of the typical discrete enforcement of the divergence-free constraint in the solver is also successful, instead allowing the DPM to approximately enforce incompressibility physics. Since the training loss function is not restricted to correspond directly to the closure to be learned, training can incorporate diverse data, including experimental data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An optimization method for chaotic turbulent flow

Evidence indicates that quantities-of-interest in some turbulent flows can be controlled despite the overall chaotic dynamics. It is typically thought that this is via relatively deterministic, larger-scale components of the turbulence. However, finding such controls, if they exist, is challenging because chaos causes sensitivity gradients to explode and the search space to become intractably non-convex. This challenge is analyzed, and a penalty method is introduced to cope with it. In the new approach, the time domain is broken into segments approximately matching the chaos time scales, so that the solution within each segment is both physical and relatively deterministic. The initial condition of each segment is included in an adjoint-based gradient optimization, which temporarily introduces artificial Δq discontinuities in the overall solution. The optimization then proceeds in stages with increasing penalization of Δq. The method is developed and illustrated for a logistic map, the Lorenz Equation, and an advection augmented Kuramoto–Sivashinsky Equation. These examples show how the Δq temporarily increases the search scale prior to the strong Δq → 0 penalization that recovers a physical solution. It is then applied to turbulent Kolmogorov flow, for which it also far outperforms a standard adjoint-based gradient search. Finally, the utility of such an optimized chaotic solution is discussed.

97 MATHEMATICS AND COMPUTING↗

Novel strategies for modal-based structural material identification

Here, we present modal-based methods for model calibration in structural dynamics, and address several key challenges in the solution of gradient-based optimization problems with eigenvalues and eigenvectors, including the solution of singular Helmholtz problems encountered in sensitivity calculations, non-differentiable objective functions caused by mode swapping during optimization, and cases with repeated eigenvalues. Unlike previous literature that relied on direct solution of the eigenvector adjoint equations, we present a parallel iterative domain decomposition strategy (Adjoint Computation via Modal Superposition with Truncation Augmentation) for the solution of the singular Helmholtz problems. For problems with repeated eigenvalues we present a novel Mode Separation via Projection algorithm, and in order to address mode swapping between inverse iterations we present a novel Injective mode ordering metric. We present the implementation of these methods in a massively parallel finite element framework with the ability to use measured modal data to extract unknown structural model parameters from large complex problems. A series of increasingly complex numerical examples are presented that demonstrate the implementation and performance of the methods in a massively parallel finite element framework [7], [5], using gradient-based optimization techniques in the Rapid Optimization Library (ROL) [21].

36 MATERIALS SCIENCE↗

Gradient-based optimization of 3D MHD equilibria

Using recently developed adjoint methods for computing the shape derivatives of functions that depend on magnetohydrodynamic (MHD) equilibria (Antonsen et al. , J. Plasma Phys. , vol. 85, issue 2, 2019; Paul et al. , J. Plasma Phys. , vol. 86, issue 1, 2020), we present the first example of analytic gradient-based optimization of fixed-boundary stellarator equilibria. We take advantage of gradient information to optimize figures of merit of relevance for stellarator design, including the rotational transform, magnetic well and quasi-symmetry near the axis. With the application of the adjoint method, we reduce the number of equilibrium evaluations by the dimension of the optimization space ( ${\sim }50\text {--}500$ ) in comparison with a finite-difference gradient-based method. We discuss regularization objectives of relevance for fixed-boundary optimization, including a novel method that prevents self-intersection of the plasma boundary. We present several optimized equilibria, including a vacuum field with very low magnetic shear throughout the volume.

Physics↗

A physics-constrained deep learning surrogate model of the runaway electron avalanche growth rate

A surrogate model of the runaway electron avalanche growth rate in a magnetic fusion plasma is developed. This is accomplished by employing a physics-informed neural network (PINN) to learn the parametric solution of the adjoint to the relativistic Fokker–Planck equation. The resulting PINN is able to evaluate the runaway probability function across a broad range of parameters in the absence of any synthetic or experimental data. This surrogate of the adjoint relativistic Fokker–Planck equation is then used to infer the avalanche growth rate as a function of the electric field, synchrotron radiation and effective charge. Predictions of the avalanche PINN are compared against first principle calculations of the avalanche growth rate with excellent agreement observed across a broad range of parameters.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An efficient surrogate model of secondary electron formation and evolution

This work extends the adjoint-deep learning framework for runaway electron (RE) evolution, developed by McDevitt et al. [Phys. Plasmas 32, 042503 (2025)], to account for large-angle collisions. By incorporating large-angle collisions, the framework allows the avalanche of REs to be captured, an essential component of RE dynamics. This extension is accomplished by using a Rosenbluth–Putvinski approximation to estimate the distribution of secondary electrons generated by large-angle collisions. By evolving both the primary and multiple generations of secondary electrons, the present formulation can capture both the detailed temporal evolution of a RE population beginning from an arbitrary initial momentum space distribution, along with providing approximations to the saturated growth and decay rates of the RE population. Predictions of the adjoint-deep learning framework are verified against a traditional RE solver, with good agreement present across a broad range of parameters.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Gradient-Informed Design Optimization of Select Nuclear Systems

In this work, we present a gradient-informed design optimization of nuclear reactor core components based on neutronics objectives with both continuous and discrete materials. The main argument in favor of using gradient-informed design optimization is that it scales well with increasing dimensionality of the design space. First, a challenge problem with 121 free parameters is solved with a gradient-informed method and then with a genetic algorithm. Then, a challenge problem to optimize the flux profile of a simplified assembly with eight axial zones is solved. Both challenge problems are solved using directly calculated derivatives from Tools for Sensitivity and Uncertainty Analysis Methodology Implementation (TSUNAMI) in the SCALE package. Furthermore, we demonstrate how a discrete optimization problem—selection of materials for 121 voxels—can be lifted into a continuous problem with mixed materials. In the continuous space, adjoint-based gradients are well-defined, and gradient descent is applicable. Then, a forcing function is introduced that with the selection of an appropriately sized hyperparameter can be used to guide the optimized continuous solution back into a discrete solution. This paper presents an account of the challenges that were faced when applying a gradient-informed optimization algorithm using a Monte Carlo calculation to estimate the gradient information and compares a gradient descent optimization method to a genetic algorithm optimization of the same geometry. Overall, this work demonstrates the potential use of adjoint-based gradient calculations in design optimization of nuclear systems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Evaluation of PBR Spent Fuel Criticality and Dose Rate Compliance for Storage and Transportation

Spent tri-structural isotropic (TRISO)–based fuels have a strong track record in storage and transportation without documented incidents. This work seeks to reduce uncertainty to aid in more informed spent fuel management of TRISO-based fuels by modeling both fresh and spent pebble bed reactor (PBR) fuel and comparing the results to the regulatory standards from 10 CFR 71. SCALE was used for all modeling due to it having fast and accurate methods for handling PBR fuel modeling, as well as having an efficient method for shielding calculations in monaco with automated variance reduction using importance calculations (MAVRIC), which utilizes the consistent adjoint-driven importance sampling (CADIS) and the forward-weighted consistent adjoint-driven importance sampling (FW-CADIS) methods. KENO-VI was used for all criticality calculations, TSUNAMI was used for uncertainty quantification on k-effective, TRITON and the Oak Ridge isotope generation code (ORIGEN) were both used for depletion of the fuel, and MAVRIC was used for shielding calculations. For criticality assessments, this study focused on the requirement that the value of the neutron multiplication factor, k-effective (k-eff), would not exceed a peak value of 0.95, including uncertainty, with 95% confidence. Criticality was initially examined by modeling fresh fuel from three different designs—HTR-10 fuel, PBMR-400 fuel, and demonstration fuel representative of a TRISO-fueled modern high-temperature gas reactor (HTGR) design, henceforth referred to as Demo HTGR—and placing them into various sized containers with conditions described in 10 CFR 71 to quantify the peak k-eff state. When the peak value of 0.95 k-eff was exceeded, mitigation methods were examined in those scenarios. Burnup credit, pebble displacement in areas of strong neutron multiplication, and random pebble replacement using pebbles of various compositions and replacement fractions were examined. In summary, the criticality of PBR fuels can be well accounted for by restricting container size, taking credit for burnup, or by displacing/replacing pebbles. Uncertainty of the k-eff due to nuclear data uncertainties was recorded at ~0.6644%Δk/k, or roughly 664% mil (pcm). The nuclear data–induced uncertainty was relatively small and should not require significant modification in the design to be accounted for. Revisions to the evaluated nuclear data file values have been shown to have a larger impact than nuclear data–induced uncertainty. For dose rate aspects, U.S. Nuclear Regulatory Commission regulations require a maximum dose rate of 10 millirem per hour (mrem/h) at 2 meters. In examining the dose rate behavior of spent PBR fuel, the representative Demo HTGR fuel was modeled exclusively due to it possessing the highest target burnup of the examined fuels. Equilibrium cycle modeling methods were used to produce a higher-fidelity discharge isotopic composition than simple assumptions, such as reflected pebbles. The discharge composition was used as a source term in the fixed-source transport shielding calculations, and dose rates were calculated at 2 m for the shortest possible cooling time. The low concentration of fuel material led to dose rates that were in line with regulatory limits, despite the high burnup when compared to traditional light water reactor fuels. In conclusion, the methods employed in this study would require more work to further verify and validate and are limited to the criticality and dose rate analyses performed.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗