Search NASA⌕ Search

SEARCH · Search NASA

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 343 records · Page 19

Monte Carlo Direct Simulation Method for Initiation Probability Problems

During the early period of a supercritical system, the growth of fission chains shows a significant stochastic feature. In multiplying medium, it is a probability issue of fail-pass type for a single neutron to sponsor a divergent fission chain, and the probability of success is named as single neutron initiation probability. Meanwhile, in the presence of a weak neutron source, the time at which fission burst occurs also exhibits a stochastic nature, which can be observed on experiments of pulsed reactors such as GODIVA I and GODIVA II. The initiation probability and burst waiting time reflect the dynamic feature of a supercritical system, which are very important for nuclear criticality safety concerns. It is desirable that a supercritical system has an initiation probability very close to zero and releases limited energy in case of criticality accidents. The stochastic process of neutron population evolution in early age in a multiplying system is governed by Bell's equation in the form of an adjoint neutron transport equation with a non-linear fission term. In order to solve this stochastic neutron transport equation, the deterministic method discretizing the phase space was proposed long ago and has been implemented in several SN codes such as Partisn, Ardra and PANDA. However, the deterministic method is of limited usage, due to its poor ability to precisely describe real-world 3D complex geometries and continuous energy neutron spectrum. Recently, Monte Carlo methods have gradually gained attention for solving Bell's equation. Greenman from LLNL proposed an analog Monte Carlo forward-transport method for calculating initiation probability in 2007. He implemented this method by introducing the maximum age parameter, the time sub-interval and the neutron progenitor tag into Mercury in time-dependent fixed-source simulation mode. This method is only suitable for initiation probability calculations, however not for analyzing the randomness of burst waiting time. Later, GANG in 2011 developed the GSMP (Generalized Semi-Markov Process method) Monte Carlo method according to Bell's equation. While the GSMP method, which can deal with both initiation probability and burst waiting time, is flexible and powerful for zero-dimensional problems, it is not favorable when extended to 3D and continuous energy problems due to severe lack of computational efficiency. In 2015, a direct Monte Carlo simulation method for stochastic systems problems was implemented in MCATK, yet this method has not been applied specifically to the burst waiting time. In this work, a new and efficient 3D Monte Carlo direct simulation method for calculating both the initiation probability and the burst waiting time is developed. By taking random factors during evolvement of fission chains into account in dynamic Monte Carlo simulation, this new method has the potential of simulating the whole process from source neutron injection to exponential growth of the neutron population, and finally to extinction of the neutron pulse. This capability is useful in criticality accidents evaluation and pulsed reactor experiments explanation. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Variable-fidelity multipoint aerodynamic shape optimization with output-based adapted meshes

This work presents a method to control the discretization error in multipoint aerodynamic shape optimization using output-based adapted meshes. The meshes are adapted via adjoint-based error estimates, taking into account both the objective and constraint output errors. A multi-fidelity optimization framework is then developed by taking advantage of the variable fidelity offered by adaptive meshes. The objective functional and its sensitivity at each design point (operating condition) are first evaluated on the same initial coarse mesh, which is then subsequently adapted for each design point individually as the shape optimization proceeds. The effort to set up the optimization is minimal since the initial mesh can be fairly coarse and easy to generate. As the shape approaches the optimal design, the mesh at each design point becomes finer, in regions necessary for that particular operating condition. The multi-fidelity framework is tightly coupled with the objective error estimation to ensure the optimization accuracy at each fidelity. Computational savings arise from a reduction of the mesh size when the design is far from optimal and avoiding an exhaustive search on low-fidelity meshes. The proposed method is demonstrated on multipoint drag minimization problems of a transonic airfoil with lift and area constraints. Improved accuracy and efficiency are shown compared to traditional fixed-fidelity optimization with a fixed computational mesh.

42 ENGINEERING↗

Inversion of geothermal heat flux in a thermomechanically coupled nonlinear Stokes ice sheet model

We address the inverse problem of inferring the basal geothermal heat flux from surface velocity observations using a steady-state thermomechanically coupled nonlinear Stokes ice flow model. This is a challenging inverse problem since the map from basal heat flux to surface velocity observables is indirect: the heat flux is a boundary condition for the thermal advection–diffusion equation, which couples to the nonlinear Stokes ice flow equations; together they determine the surface ice flow velocity. This multiphysics inverse problem is formulated as a nonlinear least-squares optimization problem with a cost functional that includes the data misfit between surface velocity observations and model predictions. A Tikhonov regularization term is added to render the problem well posed. We derive adjoint-based gradient and Hessian expressions for the resulting partial differential equation (PDE)-constrained optimization problem and propose an inexact Newton method for its solution. As a consequence of the Petrov–Galerkin discretization of the energy equation, we show that discretization and differentiation do not commute; that is, the order in which we discretize the cost functional and differentiate it affects the correctness of the gradient. Using two- and three-dimensional model problems, we study the prospects for and limitations of the inference of the geothermal heat flux field from surface velocity observations. The results show that the reconstruction improves as the noise level in the observations decreases and that short-wavelength variations in the geothermal heat flux are difficult to recover. We analyze the ill-posedness of the inverse problem as a function of the number of observations by examining the spectrum of the Hessian of the cost functional. Motivated by the popularity of operator-split or staggered solvers for forward multiphysics problems – i.e., those that drop two-way coupling terms to yield a one-way coupled forward Jacobian – we study the effect on the inversion of a one-way coupling of the adjoint energy and Stokes equations. Here, we show that taking such a one-way coupled approach for the adjoint equations can lead to an incorrect gradient and premature termination of optimization iterations. This is due to loss of a descent direction stemming from inconsistency of the gradient with the contours of the cost functional. Nevertheless, one may still obtain a reasonable approximate inverse solution particularly if important features of the reconstructed solution emerge early in optimization iterations, before the premature termination.

15 GEOTHERMAL ENERGY↗

Higher charges and regularized quantum trace identities in su(1,1) Landau-Lifshitz model

We solve the operator ordering problem for the quantum continuous integrable su(1,1) Landau-Lifshitz model, and give a prescription to obtain the quantum trace identities, and the spectrum for the higher-order local charges. We also show that this method, based on operator regularization and renormalization, which guarantees quantum integrability, as well as the construction of self-adjoint extensions, can be used as an alternative to the discretization procedure, and unlike the latter, is based only on integrable representations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Near the sill of the conformal window: Gauge theories with fermions in two-index representations

We apply Schroedinger functional methods to two gauge theories with fermions in two-index representations: the SU(3) theory with Nf=2 adjoint fermions, and the SU(4) theory with Nf=6 fermions in the two-index antisymmetric representation. Each theory is believed to lie near the bottom of the conformal window for its respective representation. In the SU(3) theory we find a small beta function in strong coupling but we cannot confirm or rule out an infrared fixed point. In the SU(4) theory we find a hint of walking - a beta function that approaches the axis and then turns away from it. In both theories the mass anomalous dimension remains small even at the strongest couplings, much like the theories with fermions in the two-index symmetric representation investigated earlier.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Hybrid nested sampling algorithm for Bayesian model selection applied to inverse subsurface flow problems

A Hybrid Nested Sampling (HNS) algorithm is proposed for efficient Bayesian model calibration and prior model selection. The proposed algorithm combines, Nested Sampling (NS) algorithm, Hybrid Monte Carlo (HMC) sampling and gradient estimation using Stochastic Ensemble Method (SEM). NS is an efficient sampling algorithm that can be used for Bayesian calibration and estimating the Bayesian evidence for prior model selection. Nested sampling has the advantage of computational feasibility. Within the nested sampling algorithm, a constrained sampling step is performed. For this step, we utilize HMC to reduce the correlation between successive sampled states. HMC relies on the gradient of the logarithm of the posterior distribution, which we estimate using a stochastic ensemble method based on an ensemble of directional derivatives. SEM only requires forward model runs and the simulator is then used as a black box and no adjoint code is needed. The developed HNS algorithm is successfully applied for Bayesian calibration and prior model selection of several nonlinear subsurface flow problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Large-Scale Optimization for Bayesian Inference in Complex Systems

The SAGUARO (Scalable Algorithms for Groundwater Uncertainty Analysis and Robust Optimization) Project focused on the development of scalable numerical algorithms for large-scale Bayesian inversion in complex systems that capitalize on advances in large-scale simulation-based optimization and inversion methods. The project was a collaborative effort among MIT, the University of Texas at Austin, Georgia Institute of Technology, and Sandia National Laboratories. The research was directed in three complementary areas: efficient approximations of the Hessian operator, reductions in complexity of forward simulations via stochastic spectral approximations and model reduction, and employing large-scale optimization concepts to accelerate sampling. The MIT₋Sandia component of the SAGUARO Project addressed the intractability of conventional sampling methods for large-scale statistical inverse problems by devising reduced-order models that are faithful to the full-order model over a wide range of parameter values; sampling then employs the reduced model rather than the full model, resulting in very large computational savings. Results indicate little effect on the computed posterior distribution. On the other hand, in the Texas₋Georgia Tech component of the project, we retain the full-order model, but exploit inverse problem structure (adjoint-based gradients and partial Hessian information of the parameter-to-observation map) to implicitly extract lower dimensional information on the posterior distribution; this greatly speeds up sampling methods, so that fewer sampling points are needed. We can think of these two approaches as "reduce then sample" and "sample then reduce." In fact, these two approaches are complementary, and can be used in conjunction with each other. Moreover, they both exploit deterministic inverse problem structure, in the form of adjoint-based gradient and Hessian information of the underlying parameter-to-observation map, to achieve their speedups.

97 MATHEMATICS AND COMPUTING↗

Large-Scale Optimization for Bayesian Inference in Complex Systems (Final Report)

The SAGUARO (Scalable Algorithms for Groundwater Uncertainty Analysis and Robust Optimization) Project focuses on the development of scalable numerical algorithms for large-scale Bayesian inversion in complex systems that capitalize on advances in large-scale simulation-based optimization and inversion methods. Our research is directed in three complementary areas: efficient approximations of the Hessian operator, reductions in complexity of forward simulations via stochastic spectral approximations and model reduction, and employing large-scale optimization concepts to accelerate sampling. Our efforts are integrated in the context of a challenging testbed problem that considers subsurface reacting flow and transport. The MIT component of the SAGUARO Project addresses the intractability of conventional sampling methods for large-scale statistical inverse problems by devising reduced-order models that are faithful to the full-order model over a wide range of parameter values; sampling then employs the reduced model rather than the full model, resulting in very large computational savings. Results indicate little effect on the computed posterior distribution. On the other hand, in the Texas-Georgia Tech component of the project, we retain the full-order model, but exploit inverse problem structure (adjoint-based gradients and partial Hessian information of the parameter-to- observation map) to implicitly extract lower dimensional information on the posterior distribution; this greatly speeds up sampling methods, so that fewer sampling points are needed. We can think of these two approaches as "reduce then sample" and "sample then reduce." In fact, these two approaches are complementary, and can be used in conjunction with each other. Moreover, they both exploit deterministic inverse problem structure, in the form of adjoint-based gradient and Hessian information of the underlying parameter-to-observation map, to achieve their speedups.

97 MATHEMATICS AND COMPUTING↗

A Parametric Study of the Adjoint Flux Calculation for TDKENO

TDKENO is a time-dependent transport code designed to simulate reactor transients. One application is to study experiments performed at the Transient Reactor Test Facility (TREAT) at the Idaho National Laboratory (INL). TDKENO solves the time-dependent, three-dimensional Boltzmann transport equation with explicit representation of delayed neutrons. Instead of directly integrating this equation, the Improved Quasi Static (IQS) method is employed. This involves factoring the neutron flux into two components - a rapidly varying (in time) amplitude equation and a slowly varying shape equation. These are solved separately on different time scales. The shape equation is solved using the Monte Carlo transport code KENO, from Oak Ridge National Laboratory's SCALE code package. Using the Monte Carlo method to solve the shape equation is computationally intensive, but the operation is only performed when needed - namely when the reactor system is undergoing a significant change. The amplitude equation is solved deterministically. This operation contains the time dependence and can be calculated relatively quickly, resulting in computational savings. TDKENO begins by solving the adjoint form of the transport equation for use as a weighting function. It uses this adjoint flux for multiple aspects of the simulation, including the calculation of all of the point kinetics parameters . The flux shape is found by solving a modified form of the transport equation in 'forward' mode. This paper examines the effect the adjoint weighting function has on the solution. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Response tailoring of elasto-plastic trusses

Abstract In this work we tailor the response of trusses loaded beyond their yield limit. The truss structures are modeled using finite strain theory and rate-independent elasto-plasticity. We design trusses with a tailored mechanical response that is between “elastic” and “elastic-ideal-plastic” subject to the volume constraint. The design updates are generated by the gradient-based Method of Moving Asymptotes (MMA) solver and the sensitivities of the response functions are computed using a path-dependent adjoint sensitivity analysis. The computations are performed in Matlab.

42 ENGINEERING↗

SENSMG: First-Order Sensitivities of Neutron Reaction Rates, Reaction-Rate Ratios, Leakage, k eff , and α Using PARTISN

SENSMG is a tool for computing first-order sensitivities of neutron reaction rates, reaction-rate ratios, leakage, k eff , and α using the PARTISN multigroup discrete-ordinates code. SENSMG computes sensitivities to all of the transport cross sections and data (total, fission, nu, chi, and all scattering moments), two edit cross sections (absorption and capture), and the density for every isotope and energy group. It also computes sensitivities to the mass density for every material and derivatives with respect to all interface locations. The tool can be used for one-dimensional spherical (r) and two-dimensional cylindrical (r-z) geometries. The tool can be used for fixed-source and eigenvalue problems. The tool implements Generalized Perturbation Theory (GPT) as discussed by Williams and Stacey. Section II of this report describes the theory behind adjoint-based sensitivities, gives the equations that SENSMG solves, and defines the sensitivities that are output. Section III describes the user interface, including the input file and command line options. Section IV describes the output. Section V gives some notes about the coding that may be of interest. Section VI discusses verification, which is ongoing. Section VII lists needs and ideas for future work. Appendix A lists all of the input files whose results are presented in Sec. VI.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A new least-squares transport equation compatible with voids

We define a new least-squares transport equation that is applicable in voids, can be solved using source iteration with diffusion-synthetic acceleration, and requires only the solution of an independent set of second-order self-adjoint equations for each direction during each source iteration. We derive the equation, discretize it using the S{sub n} method in conjunction with a linear-continuous finite-element method in space, and computationally demonstrate various of its properties. (authors)

97 MATHEMATICS AND COMPUTING↗

Negative fluxes and cell-miss errors in the random ray method

The random ray method is a recently developed stochastic method for solving neutral particle transport problems based on the method of characteristics. Perhaps surprisingly for a characteristics-based method using flat sources, we note that the random ray method can produce negative fluxes which may be numerically troublesome in several situations. These occur most severely in fixed source problems where the source is in a region with a small cross section. Additionally, we briefly discuss another source of bias which can occur in similar situations, namely a ray missing a mesh with a strong source and small cross section, resulting in the entirety of the source being unphysically deposited locally. This paper describes the mechanism by which negative fluxes may occur and several different methods to mitigate their effects. These fixes are tested on an eigenvalue problem, a ‘fusion-like’ shielding problem, and a shielding problem featuring an adjoint calculation. Even when extremely coarse random ray quadratures are used such that 20%–30% of cells are missed during a given iteration, use of the preferred fix technique ensures local flux tally errors remain trivial (below 1%). The preferred fix is now the default option in SCONE and OpenMC.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Flattening of fuel importance for heterogeneous system to estimate maximal multiplication factor - 14595

In order to quantify risks of re-criticality incidents associated with loss of coolant accidents (LOCA), the maximum reactivity insertion by relocation of damaged fuel should be quantified. As the first step for the quantification, an automated search scheme is studied for an optimal geometry of damaged fuel in the coolant channel where the neutron multiplication factor k{sub eff} takes a maximal value. The scheme is based on the flattening of the fuel importance. The importance can be recognized as the substitution reactivity from fuel to water in heterogeneous systems. The flattening is achieved by substitution of water and the fuel so as to raise the k{sub eff} referring the local substitution reactivities. To calculate the reactivities efficiently, the first order perturbation scheme is adopted. In the scheme, the adjoint flux is calculated with the PARTISN code. The multi group constants used for the calculation and the perturbed reaction rates are estimated with the continuous energy Monte Carlo code MCNP-5. The proposed methods are tested for a quarter pin cell model that is constructed using Cartesian mesh. From a random distribution of a given amount of fragmented fuel, an optimal geometry is found where the fragmented fuels are aggregated. The multiplication factor in the geometry is greater than that in the original random distribution by 1.4%Δk/k. That indicates the significance of this study. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Technical Report on Waveform Fit Metrics for Global Models

The new WAVEFORMS Initiative in the Ground-based Nuclear Detonation Detection (GNDD) program includes an increased emphasis on the development of Earth models and methods to predict entire seismic and acoustic waveforms more accurately. In general, this increased emphasis is predicated on the need to better characterize seismic events and provide improved model-based discrimination between event types including earthquakes and explosions. More specifically, while current moment tensor inversion methods tend to work well for larger events (M>~4) using tuned 1-D Earth models, the development of state-of-the-art 3-D models and methods is required for the prediction of shorter period waves over large areas for discrimination of smaller events. There is no standard metric for model-based waveform prediction accuracy used in the waveform modeling/inversion community. However, there are several popular waveform misfit definitions; and minimizing the corresponding objective functions is the goal of waveform inversion. Some example misfit definitions employed for adjoint waveform tomography include measures of simple travel time differences (e.g. Tape et al., 2010), cross-correlation travel time differences (e.g. Luo and Schuster, 1991), multi-taper frequency dependent methods (e.g. Lei et al., 2020), time-frequency phase misfit functions (e.g. Fichtner 2010; Rodgers et al., 2022), normalized cross-correlation methods (e.g. Tao et al., 2018), and others. In some cases, these misfit definitions also involve complicated weighting schemes and summations over multiple frequency bands making it difficult to duplicate the misfit measurement with alternative models and datasets. Although each of the misfit definitions mentioned above are useful for developing waveform models, the actual misfit values are not usually meaningful outside of a given project, model, and/or dataset. Therefore, it is difficult to understand and communicate model performance for predicting waveforms and comparing to other models and/or new model iterations with a different dataset. Therefore, there is a need for a generalized method for evaluating overall model performance that is independent from the specific misfit chosen to develop the waveform models that is also intuitive and meaningful. In this report, we describe a new metric we refer to as ‘Percent of Correlated Signal’. The following sections describe and demonstrate the metric with a case study event and a more rigorous test using a random selection of globally distributed events. While the focus here is on global tomography models, the metric is meant to applicable to regional ‘wiggle-for-wiggle’ waveform models/studies as well.

58 GEOSCIENCES↗

Time-periodic solutions of the Benjamin-Ono equation

We present a spectrally accurate numerical method for finding non-trivial time-periodic solutions of non-linear partial differential equations. The method is based on minimizing a functional (of the initial condition and the period) that is positive unless the solution is periodic, in which case it is zero. We solve an adjoint PDE to compute the gradient of this functional with respect to the initial condition. We include additional terms in the functional to specify the free parameters, which, in the case of the Benjamin-Ono equation, are the mean, a spatial phase, a temporal phase and the real part of one of the Fourier modes at t = 0. We use our method to study global paths of non-trivial time-periodic solutions connecting stationary and traveling waves of the Benjamin-Ono equation. As a starting guess for each path, we compute periodic solutions of the linearized problem by solving an infinite dimensional eigenvalue problem in closed form. We then use our numerical method to continue these solutions beyond the realm of linear theory until another traveling wave is reached (or until the solution blows up). By experimentation with data fitting, we identify the analytical form of the solutions on the path connecting the one-hump stationary solution to the two-hump traveling wave. We then derive exact formulas for these solutions by explicitly solving the system of ODE's governing the evolution of solitons using the ansatz suggested by the numerical simulations.

97 MATHEMATICS AND COMPUTING↗

Multigrid solution of a distributed optimal control problem constrained by the Stokes equations

We construct multigrid preconditioners to accelerate the solution process of a linear-quadratic optimal control problem constrained by the Stokes system. The first order optimality conditions of the control problem form a linear system (the KKT system) connecting the state, adjoint, and control variables. Our approach is to eliminate the state and adjoint variables by essentially solving two Stokes systems, and to construct efficient multigrid preconditioners for the Schur-complement of the block associated with the state and adjoint variables. These multigrid preconditioners are shown to be of optimal order with respect to the convergence properties of the discrete methods used to solve the Stokes system. In particular, the number of conjugate gradient iterations is shown to decrease as the resolution increases, a feature shared by similar multigrid preconditioners for elliptic constrained optimal control problems.

97 MATHEMATICS AND COMPUTING↗

Demonstration of MAMMOTH Strongly-Coupled Multiphysics Simulation with the Godiva Benchmark Problem

This paper provides a detailed description of the Godiva benchmark problem suitable for multiphysics code verification. Multigroup transport weak forms for general curvilinear coordinates are derived using SAAF (self-adjoint angular flux) formulation. A new scheme based on spherical harmonics expansion for evaluating the angular derivative terms using the SN method are presented and tested. A one-dimensional spherical coordinate system is used by MAMMOTH for modeling the Godiva benchmark. Strongly-coupled multiphysics simulation mode of MAMMOTH is exercised and numerical results are given.

97 MATHEMATICS AND COMPUTING↗