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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

PDE-constrained high-order mesh optimization

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

Computer science↗
DOE OSTI2025

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

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

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

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

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

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

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

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

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

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

An autoencoder compression approach for accelerating large-scale inverse problems

Abstract Partial differential equation (PDE)-constrained inverse problems are some of the most challenging and computationally demanding problems in computational science today. Fine meshes required to accurately compute the PDE solution introduce an enormous number of parameters and require large-scale computing resources such as more processors and more memory to solve such systems in a reasonable time. For inverse problems constrained by time-dependent PDEs, the adjoint method often employed to compute gradients and higher order derivatives efficiently requires solving a time-reversed, so-called adjoint PDE that depends on the forward PDE solution at each timestep. This necessitates the storage of a high-dimensional forward solution vector at every timestep. Such a procedure quickly exhausts the available memory resources. Several approaches that trade additional computation for reduced memory footprint have been proposed to mitigate the memory bottleneck, including checkpointing and compression strategies. In this work, we propose a close-to-ideal scalable compression approach using autoencoders to eliminate the need for checkpointing and substantial memory storage, thereby reducing the time-to-solution and memory requirements. We compare our approach with checkpointing and an off-the-shelf compression approach on an earth-scale ill-posed seismic inverse problem. The results verify the expected close-to-ideal speedup for the gradient and Hessian-vector product using the proposed autoencoder compression approach. To highlight the usefulness of the proposed approach, we combine the autoencoder compression with the data-informed active subspace (DIAS) prior showing how the DIAS method can be affordably extended to large-scale problems without the need for checkpointing and large memory.

Mathematics↗
DOE OSTI2020

Wind Farm Simulation and Layout Optimization in Complex Terrain: Preprint

This work reports on incorporating complex terrain into wind farm simulations for the purpose of layout optimization. Adding complex terrain boundary conditions to NREL's medium fidelity computational fluid dynamics model, WindSE, produces significant separation, flow curvature, and speedup effects that would otherwise be difficult to capture with lower-fidelity models or a flat-terrain assumption. These flow features, in turn, can significantly impact the optimal turbine array layout. We demonstrate the impact of complex terrain on flow in both an idealized and real-world setting, and discuss modifications to the code that enable gradient-based optimization using terrain-aware adjoint gradients. Through several optimization case studies, we show that the layout optimization process takes advantage of speedup effects on terrain high points, and leverages flow curvature effects that modify wake trajectories. This yields substantial power improvements over gridded layouts, and hints at future research directions in simulation and optimization for wake trajectories in complex terrain.

17 WIND ENERGY↗
DOE OSTI2022

A mixed, unified forward/inverse framework for earthquake problems: fault implementation and coseismic slip estimate

SUMMARY We introduce a new finite-element (FE) based computational framework to solve forward and inverse elastic deformation problems for earthquake faulting via the adjoint method. Based on two advanced computational libraries, FEniCS and hIPPYlib for the forward and inverse problems, respectively, this framework is flexible, transparent and easily extensible. We represent a fault discontinuity through a mixed FE elasticity formulation, which approximates the stress with higher order accuracy and exposes the prescribed slip explicitly in the variational form without using conventional split node and decomposition discrete approaches. This also allows the first order optimality condition, that is the vanishing of the gradient, to be expressed in continuous form, which leads to consistent discretizations of all field variables, including the slip. We show comparisons with the standard, pure displacement formulation and a model containing an in-plane mode II crack, whose slip is prescribed via the split node technique. We demonstrate the potential of this new computational framework by performing a linear coseismic slip inversion through adjoint-based optimization methods, without requiring computation of elastic Green’s functions. Specifically, we consider a penalized least squares formulation, which in a Bayesian setting—under the assumption of Gaussian noise and prior—reflects the negative log of the posterior distribution. The comparison of the inversion results with a standard, linear inverse theory approach based on Okada’s solutions shows analogous results. Preliminary uncertainties are estimated via eigenvalue analysis of the Hessian of the penalized least squares objective function. Our implementation is fully open-source and Jupyter notebooks to reproduce our results are provided. The extension to a fully Bayesian framework for detailed uncertainty quantification and non-linear inversions, including for heterogeneous media earthquake problems, will be analysed in a forthcoming paper.

58 GEOSCIENCES↗
DOE OSTI2023

Source-encoded waveform inversion in the Northern Hemisphere

SUMMARY We use source-encoded waveform inversion to image Earth’s Northern Hemisphere. The encoding method is based on measurements of Laplace coefficients of stationary wavefields. By assigning to each event a unique frequency, we compute Fréchet derivatives for all events simultaneously based on one ‘super’ forward and one ‘super’ adjoint simulation for a small fraction of the computational cost of classical waveform inversion with the same data set. No cross-talk noise is introduced in the process, and the method does not require all events to be recorded by all stations. Starting from global model GLAD_M25, we performed 100 conjugate gradient iterations using a data set consisting of 786 earthquakes recorded by 9846 stations. Synthetic inversion tests show that we achieve good convergence based on this data set, and we see a consistent misfit reduction during the inversion. The new model, named SE100, has much higher spatial resolution than GLAD_M25, revealing details of the Yellowstone and Iceland hotspots, subduction beneath the Western United States and the upper mantle structure beneath the Arctic Ocean.

Cui, Congyue↗
DOE OSTI2025

Fast and Scalable FFT-Based GPU-Accelerated Algorithms for Block-Triangular Toeplitz Matrices with Application to Linear Inverse Problems Governed by Autonomous Dynamical Systems

In this work, we present an efficient and scalable algorithm for performing matrix-vector multiplications (matvecs) for block Toeplitz matrices. Such matrices, which are shift-invariant with respect to their blocks, arise in the context of solving inverse problems governed by autonomous systems, and time-invariant systems in particular. In this article, we consider inverse problems that infer unknown parameters from observational data of a linear time-invariant dynamical system given in the form of partial differential equations (PDEs). Matrix-free Newton-conjugate-gradient methods are often the gold standard for solving these inverse problems, but they require numerous actions of the Hessian on a vector. Matrix-free adjoint-based Hessian matvecs require solution of a pair of linearized forward/adjoint PDE solves per Hessian action, which may be prohibitive for large-scale inverse problems. Time invariance of the forward PDE problem leads to a block Toeplitz structure of the discretized parameter-to-observable (p2o) map defining the mapping from inputs (parameters) to outputs (observables) of the PDEs. This block Toeplitz structure enables us to exploit two key properties: (1) compact storage of the p2o map and its adjoint, and (2) efficient fast Fourier transform–based Hessian matvecs. The proposed algorithm is mapped onto large multi-GPU clusters and achieves more than 80% of peak bandwidth on NVIDIA A100 GPUs. Excellent weak scaling is shown for up to 48 A100 GPUs. For the targeted problems, the implementation executes Hessian matvecs within fractions of a second, which is orders of magnitude faster than can be achieved by conventional matrix-free Hessian matvecs via forward/adjoint PDE solves.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Tapsolver: A Python Package For The Simulation And Analysis Of Tap Reactor Experiments

TAPsolver is a python package, which automates TAP simulation and analysis routines. TAPsolver is built around the python packages FEniCS and Dolfin-Adjoint, which help take advantage of model adjoints to provide automatic derivatives. TAPsolver is flexible, with reaction mechanisms and rate constants that can be set through input files that allow users to take advantage of the different functionalities, which include sensitivity analyses, parameter optimization and uncertainty quantification.

Yonge, Adam↗
DOE OSTI2021

Calibr8 v.1.0

Calibr8 provides an application to rapidly prototype and perform material model calibration for complex plasticity models using advanced adjoint or forward sensitivity analyses for execution on massively parallel machines. These techniques can be orders of magnitude faster than traditional finite difference approaches for material model calibration. The underlying technology used in Calibr8 is automatic differentiation, which allows for the rapid implementation and testing of new plasticity models within its framework. Additionally, Calibr8 can perform adjoint-based error estimation to approximate discretization errors for user-implemented plasticity models. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525. SAND2021-10630 O

Granzow, BrianN.↗