Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “adjoint method”

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

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

At least 109 records · Page 6

An Analytic Benchmark for Neutron Boltzmann Transport with Downscattering—Part IV: PFNS and $\bar{ν}$ Uncertainty Propagation

An analytic benchmark with continuous-energy cross sections was previously derived to validate criticality calculations. Here, to extend the utility of the analytic benchmark to verify the implementation of $\bar{ν}$ and prompt fission neutron spectrum (PFNS) uncertainty propagation methods, new simplified forms that are dependent on the incident (fission-causing) neutron energy, as well as the outgoing neutron energy for the PFNS, are introduced in this work. The analytical forms for the flux and adjoint flux are derived for the extended benchmark and used to determine the 𝑘-eigenvalue sensitivity to $\bar{ν}$ and PFNS. The 𝑘-eigenvalue uncertainty due to $\bar{ν}$ and PFNS is calculated for the analytic benchmark using simplified$\bar{ν}$ and PFNS representations based on the ENDF-B/VIII.0 239 Pu evaluation. Because of the low sensitivity of the analytic benchmark to the physical PFNS, a nonphysical high-sensitivity PFNS is also presented.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Stochastic Calculus Approach to Boltzmann Transport

Traditional Monte Carlo methods for particle transport utilize source iteration to express the solution, the flux density, of the transport equation as a Neumann series. Our contribution is to show that the particle paths simulated within source iteration are associated with the adjoint flux density and the adjoint particle paths are associated with the flux density. Here, we make our assertion rigorous through the use of stochastic calculus by representing the particle path used in source iteration as a solution to a stochastic differential equation (SDE). The solution to the adjoint Boltzmann equation is then expressed in terms of the same SDE, and the solution to the Boltzmann equation is expressed in terms of the SDE associated with the adjoint particle process. An important consequence is that the particle paths used within source iteration simultaneously provide Monte Carlo samples of the flux density and adjoint flux density in the detector and source regions, respectively. The significant practical implication is that particle trajectories can be reused to obtain both forward and adjoint quantities of interest. To the best our knowledge, the reuse of entire particles paths has not appeared in the literature. Monte Carlo simulations are presented to support the reuse of the particle paths.

Boltzmann transport↗

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↗

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↗

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↗

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↗

Improvements to the Griffin Transport Solvers

Griffin is a Multiphysics Object-Oriented Simulation Environment (MOOSE) based reactor multiphysics analysis application jointly developed by Idaho National Laboratory and Argonne National Laboratory. The code includes a variety of steady-state solvers for fixed-source, k-eigenvalue, adjoint, and subcritical multiplication, as well as transient solvers for point-kinetics, improved quasi-static, and spatial dynamics. This document summarizes the transport solver development efforts pursued during Fiscal Year 2022. We added the multiphysics transient capability for the coarse-mesh finite difference accelerated Richardson iteration for discontinuous finite element method discrete ordinates (DFEM-SN) scheme to support high-order heterogeneous transport simulations. HFEM (hybrid finite element method) - PN (spherical harmonics expansion) was completed and red-black iteration was added for solving the HFEM-PN system with both preconditioned Jacobian-free Newton Krylov and Richardson iteration solvers. The HFEM-PN scheme, as one of the low-order transport schemes, is expected for supporting routine design simulations. Pin power reconstruction capability was also designed and implemented with the Griffin ISOXML module to enhance all the low-order transport solvers for more accurate multiphysics simulations. Numerical results are presented for demonstrating the capabilities and verifying their performance, and future works are discussed.

97 MATHEMATICS AND COMPUTING↗

Earth System Reanalysis in Support of Climate Model Improvements

Recent climate model developments, established through increased model resolution, have led to substantial improvements in model simulations of the time-evolving, coupled Earth system and its subcomponents. However, regardless of resolution, climate models will always produce climate features and variability that differ from the real world and will be prone to biases. This is due to many remaining uncertainties, such as in parametric and structural model uncertainty, in the initial conditions prescribed, and in the prescribed (scenario) forcing which varies on decadal to centennial timescales. Further model improvements are expected to arise specifically from improved representation of physical processes realized through model-data fusion. This will create an unprecedented opportunity to better exploit a large array of Earth observations, from in situ measurements to weather radars and satellite observations, as the resolved scales of the models approach those of the observations. For this, climate DA will be the central tool to bring models and observations into consistency, by improving initial conditions, inferring uncertain model parameters and structure, and quantifying uncertainty. Generally, there will be advantages and complementarities of adjoint-based smoother approaches, ensemble-based filter approaches, or new ML-inspired approaches. Yet, the ever-increasing model resolution will present growing challenges arising from computational cost, calling for new ways of performing data assimilation and model optimization. Using the complementarity in a hybrid approach, blending tools and concepts from variational, ensemble and ML methods might be what is required in the future. In this context ML could be important to handle non-linear responses, and to better approximate non-Gaussian distributions.

54 ENVIRONMENTAL SCIENCES↗

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↗

MrHyDE v.1.0

SAND2024-01324O MrHyDE, which stands for Multi-resolution Hybridized Differential Equations, is a general-purpose C++ package for the solution of coupled multiphysics and multiscale systems on massively parallel computing systems. MrHyDE is designed to enable moving beyond forward simulation for multiscale applications which includes optimization, control, uncertainty quantification, and stochastic inversion. The framework provides interfaces to several packages within the Trilinos framework and leverages automatic differentiation to enable adjoint capabilities for large-scale, gradient-based optimization. MrHyDE provides automated multiscale capabilities through a subgrid model interface and multiscale Dirichlet-to-Neumann maps. For extreme-scale applications, MrHyDE provides in situ data-compression algorithms to reduce memory requirements while maintaining performance. MrHyDE is a general-purpose, computational framework for the solution of multiscale and multiphysics applications. It uses a combination of structure-preserving, physics-compatible discretizations, fully implicit methods, multi-resolution schemes, or fully explicit methods. 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.

SciDAC↗

Scientific Computational Imaging Code (SCICO)

Scientific Computational Imaging Code (SCICO) is a Python package for solving the inverse problems that arise in scientific imaging applications. Its primary focus is providing methods for solving ill-posed inverse problems by using an appropriate prior model of the reconstruction space. SCICO includes a growing suite of operators, cost functionals, regularizers, and optimization routines that may be combined to solve a wide range of problems, and is designed so that it is easy to add new building blocks. SCICO is built on top of JAX rather than NumPy, enabling GPU/TPU acceleration, just-in-time compilation, and automatic gradient functionality, which is used to automatically compute the adjoints of linear operators. An example of how to solve a multi-channel tomography problem with SCICO is shown in Figure 1. The SCICO source code is available from GitHub, and pre-built packages are available from PyPI. It has extensive online documentation, including API documentation and usage examples, which can be run online at Google Colab and binder.

97 MATHEMATICS AND COMPUTING↗

Reduced-order modeling of neutron transport separated in energy by Minimax Proper Generalized Decomposition

In this article, we demonstrate a Petrov-Galerkin Proper Generalized Decomposition (PGD) known as Minimax PGD for modeling neutron transport separated in energy. To compare the Minimax with the classical Galerkin PGD, we assess both on a model problem of UO{sub 2} or Mixed Oxide (MOX) fuel pins in an infinite lattice with 3 industry-standard energy meshes. We find the Minimax PGD achieves a superior decomposition to Galerkin PGD, both with and without update of the energy modes. This suggests Minimax PGD may be more computationally efficient, provided this reduction in modes (to achieve a given accuracy) outweighs the cost of solving the necessary adjoint problems. In either case, we note that PGD offers an a priori Reduced-Order Model (ROM) which may be dramatically cheaper to solve than the full-order model, especially in problems with fine to ultrafine energy meshes. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Development of a New Fixed-source Sensitivity Tally Capability in the MCNP® code [Abstract]

The development of a new fixed-source sensitivity tally capability is currently underway in the MCNP code. In recent research and development efforts that utilize machine learning to both seek problematic nuclear data as well as design experiments optimized to improve the nuclear data, the adjoint-weighted k-eigenvalue sensitivity tally capabilities have been heavily essential. In this paper, the motivation to expand the sensitivity tally capabilities beyond k-eigenvalues toward diverse fixed-source problems along with preliminary results and verification will be discussed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Cross Section Generation Capability in Griffin

The Griffin code is a Multiphysics Object-Oriented Simulation Environment (MOOSE) based reactor multiphysics analysis application jointly developed by Idaho National Laboratory and Argonne National Laboratory. The code includes a variety of steady-state solvers for fixed-source, k-eigenvalue, adjoint, and subcritical multiplication, as well as transient solvers for point-kinetics, improved quasi-static, and spatial dynamics. The code reads multigroup cross sections in the ISOXML format generated from external deterministic or Monte Carlo cross section generation codes. The implementation of the cross section generation capability in Griffin was initiated last year by plugging in the cross section application programming interface (CSAPI) and reviewing the methodologies for treating particulate fuels. The focus this year was on improving the CSAPI integration and implementing advanced self-shielding methods for applications to advanced reactor problems with TRISO fuels. First, the process for cross section library generation was updated to accurately and rigorously produce isotopic cross section data. Second, the on-the-fly slowing down method for the resonance treatment was implemented in CSAPI to improve the accuracy of effective multigroup cross sections in the resonance energy range. Among various on-the-fly slowing down methods, the equivalent Dancoff factor cell method was employed. Third, the iterative local spatial self-shielding method was implemented under the calculation framework of the equivalent Dancoff factor cell method to accurately deal with the double heterogeneity effect of particulate fuel. The updated CSAPI with the advanced self-shielding methods, together with the cross section libraries generated based on the improved process, were tested for the very high temperature reactor (VHTR), high temperature test reactor (HTTR), and Empire benchmark problems with various resonance self-shielding conditions, indicating that the updated CSAPI in Griffin is able to produce multigroup cross sections accurately and efficiently. We also show that the methodology works well for pebble bed fuel from HTR-10, but the capability still needs to be fully integrated into CSAPI. In the future, further benchmark tests will be performed for various thermal reactor core problems, including particulate fuel-based pebble bed reactors.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

Improved accuracy in degenerate variational integrators for guiding centre and magnetic field line flow

First-order-accurate degenerate variational integration (DVI) was introduced in Ellison et al. ( Phys. Plasmas , vol. 25, 2018, 052502) for systems with a degenerate Lagrangian, i.e. one in which the velocity-space Hessian is singular. In this paper we introduce second-order-accurate DVI schemes, both with and without non-uniform time stepping. We show that it is not in general possible to construct a second-order scheme with a preserved two-form by composing a first-order scheme with its adjoint, and discuss the conditions under which such a composition is possible. We build two classes of second-order-accurate DVI schemes. We test these second-order schemes numerically on two systems having non-canonical variables, namely the magnetic field line and guiding centre systems. Variational integration for Hamiltonian systems with non-uniform time steps, in terms of an extended phase space Hamiltonian, is generalized to non-canonical variables. It is shown that preservation of proper degeneracy leads to single-step (one-step) methods without parasitic modes, i.e. to non-uniform time step DVIs. This extension applies to second-order-accurate as well as first-order schemes, and can be applied to adapt the time stepping to an error estimate.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Analytic Sensitivity Coefficients for General Multigroup Infinite Medium k-Eigenvalue Problems

The general multigroup infinite medium k-eigenvalue neutron transport equation is used to derive analytic expressions for the infinite medium k-eigenvalue, the scalar neutron flux and adjoint, and the sensitivity of $k$ ∞ to perturbations in the multigroup nuclear data of a single species isotropic elastic scattering material. In the appendix, we present the multigroup nuclear data for U-235 and U-238 along with the corresponding k-eigenvalue, flux, adjoint, and sensitivity profiles, which include the sensitivity of $k$ ∞ to the total, fission, capture, and scattering macroscopic cross sections as well as to the group-to-group scattering cross section matrix, group neutron production, and the unconstrained and constrained fission neutron energy distribution.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Inverse deep learning methods and benchmarks for artificial electromagnetic material design

In this work we investigate the use of deep inverse models (DIMs) for designing artificial electromagnetic materials (AEMs) – such as metamaterials, photonic crystals, and plasmonics – to achieve some desired scattering properties (e.g., transmission or reflection spectrum). DIMs are deep neural networks (i.e., deep learning models) that are specially-designed to solve ill-posed inverse problems. There has recently been tremendous growth in the use of DIMs for solving AEM design problems however there has been little comparison of these approaches to examine their absolute and relative performance capabilities. In this work we compare eight state-of-the-art DIMs on three unique AEM design problems, including two models that are novel to the AEM community. Our results indicate that DIMs can rapidly produce accurate designs to achieve a custom desired scattering on all three problems. Although no single model always performs best, the Neural-Adjoint approach achieves the best overall performance across all problem settings. As a final contribution we show that not all AEM design problems are ill-posed, and in such cases a conventional deep neural network can perform better than DIMs. We recommend that a deep neural network is always employed as a simple baseline approach when addressing AEM design problems. Furthermore, we publish python code for our AEM simulators and our DIMs to enable easy replication of our results, and benchmarking of new DIMs by the AEM community.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

LATTE: open-source, high-performance traveltime computation, tomography and source location in acoustic and elastic media

Traveltime-based tomography and source location are fundamental approaches for imaging subsurface structures and understanding the spatiotemporal distribution of seismicity from local to global scales. We present an open-source, high-performance framework integrating eikonal equation solvers and adjoint-state theory for traveltime computation, velocity tomography, source location and joint tomography-location in 2-D/3-D acoustic and elastic media. We introduce novel regularization schemes based on total generalized p-variation, structural similarity and multitask machine learning to enhance the fidelity and interpretability of inverted models and source locations. Key features of our implementation also include the ability to leverage both absolute-difference and double-difference traveltime misfits for high-fidelity velocity tomography and source parameter estimation; support for traveltime computation and inversion in diverse 2-D/3-D scenarios with arbitrary source and receiver distributions; and a perturbation-based optimal step-size estimation method to reduce computational costs. In addition, our implementation employs shared-memory and distributed-memory parallelization to provide an efficient solution for traveltime computation, tomography, and source location. In conclusion, we validate the efficacy and accuracy of our approach through multiple synthetic data examples.

58 GEOSCIENCES↗