Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Adjoint Computation”

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

Performance Improvements of the Griffin Solvers in FY24

The Griffin code is a MOOSE-based reactor physics application jointly developed by Idaho National Laboratory and Argonne National Laboratory under the Department of Energy Office of Nuclear Energy Nuclear Energy Advanced Modeling and Simulation Program. This fiscal year, we have made significant efforts to improve the performance of transport solver options and cross-section generation for the efficient use of Griffin in advanced reactor applications. For the HFEM-PN solver, the residual evaluations of HFEM kernels were optimized by utilizing the pre- computed averaged cross sections for individual elements. Numerical integration involving the evaluation of basis functions at quadrature points was bypassed by facilitating precomputed element mass matrices for response matrices. Red-black iterations were improved by introducing a new generalized minimum residual based solver. The memory usage of response matrix storage was significantly reduced by applying basis function rotations on interfaces and calculating volumetric odd-parity moments on the fly. Additionally, the adjoint flux and transient calculation capabilities of the HFEM-PN solver were successfully implemented and verified using the TWIGL benchmark problem. For the DFEM-SN solver, memory footprint and computation time were significantly reduced by not treating angular flux vectors as the MOOSE nonlinear system vectors. Specifically for IQS, scalar adjoint weighting was introduced to further eliminate angular adjoint flux storage in the MOOSE auxiliary system. It was demonstrated through the three-dimensional Advanced Burner Test Reactor core problem that the memory usage for transient calculations with the IQS method was reduced by over 7.5× compared to before the optimizations. For the self-shielding application programming interface, a new double-heterogeneity treatment method, named the Bell Function-Based Analytic Two-Region Slowing Down Method, was developed to efficiently flux-volume homogenize TRISO particles with the matrix. Additionally, optimizations were made to hyper- fine group (HFG) slowing down calculations by pretabulating collision probability coefficients and grouping isotopes, significantly reducing the computational time for calculating scattering sources per HFG. Lastly, the pin power reconstruction module was extended to account for temporal behavior in a microreactor analysis problem, specifically for a control drum transient. Verification tests for each of these improvements demonstrated significant performance enhancements and memory reduction.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

The Casualidad method for uncertainty evaluation of best-estimate system thermal-hydraulics calculations

The present paper deals with the description of the salient features of three independent approaches for estimating uncertainties associated with predictions of complex system codes. The first approach is the 'standard' one and the most used at the industrial level: it is based upon the selection of input uncertain parameters, on assigning related ranges of variations and, possibly, PDF (Probability Density Functions) and on performing a suitable number of code runs to get the combined effect of variation on the results. In the second approach the uncertainty derives from the comparison between relevant measured data and results of corresponding code calculations. The third approach is based on the Bayesian inference technique and on the availability of experimental data by which computer model predictions can be improved and the ranges of variation of (in theory) 'all' input parameters can be characterized. More details are provided in respect with the third approach that has been named CASUALIDAD (Code with the capability of Adjoint Sensitivity and Uncertainty Analysis by Internal Data Adjustment and assimilation). (authors)

42 ENGINEERING↗

Generalized Sensitivity Calculation in the Monte Carlo Wielandt Method

Recently the Monte Carlo (MC) adjoint-weighted perturbation (AWP) methods with k-adjoint have been developed for the k sensitivity calculations. In order to extend the MC AWP methods to estimate sensitivities of a ratio of two reaction rates, Perfetti and Rearden devised a MC sensitivity calculation method with the generalized adjoint expressed by the intra-generational and intergenerational effects. Aufiero et al. suggested the collision history-based approach to calculate sensitivities of responses in the form of ratios of linear or bilinear functions by applying the correlated sampling for multi-generational collisions. However these methods may require a huge size of computer memory to save inter-generational contributions proportional to the number of the sensitivity tallies. In order to reduce memories required for the k-adjoint estimation, the present authors proposed the AWP algorithm in the MC Wielandt method where multiple generations from a fission source neutron are simulated in single history calculations. In this paper, we present perturbation formulations to estimate sensitivities for general tallies such as volume flux, reaction rates, etc. in the MC Wielandt calculations. The proposed method has been implemented into the Seoul National University MC code, McCARD and tested in two-group infinite homogeneous problems. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DAGSENS: Directed Acyclic Graph Based Direct and Adjoint Transient Sensitivity Analysis for Event-Driven Objective Functions

We present DAGSENS, a new theory for parametric transient sensitivity analysis of Differential Algebraic Equation systems (DAEs), such as SPICE-level circuits. The key ideas behind DAGSENS are, (1) to represent the entire sequence of computations, starting from DAE parameters, all the way up to the objective function whose sensitivity is needed, as a Directed Acyclic Graph (DAG) called the "sensitivity DAG", and (2) to compute the required sensitivities efficiently (with time complexity linear in the size of the sensitivity DAG) by leveraging dynamic programming techniques to traverse the DAG. DAGSENS is simple, elegant, and easy-to-understand compared to existing sensitivity analysis approaches; for example, in DAGSENS, one can switch between direct and adjoint transient sensitivities just by changing the direction of DAG traversal (i.e., topological order vs. reverse topological order). Also, DAGSENS is significantly more powerful than existing sensitivity analysis approaches because it allows one to compute the sensitivities of a much more general class of objective functions, including those defined based on "events" that occur during a transient simulation (e.g., a node voltage crossing a particular threshold, a phase-locked loop (PLL) achieving lock, a signal reaching its maximum/minimum value during a transient run, etc.). In this paper, we apply DAGSENS to compute the sensitivities of important event-driven performance metrics in several real-world electronic and biological applications, including high-speed communication (featuring sub-systems such as I/0 links and PLLs), statistical cell library characterization, and gene expression in Drosophila embryos.

42 ENGINEERING↗

A posteriori error analysis for a cut cell finite volume method

We study the solution of a diffusive process in a domain where the diffusion coefficient changes discontinuously across a curved interface. We consider discretizations that use regularly-shaped meshes, so that the interface “cuts” through the cells (elements or volumes) without respecting the regular geometry of the mesh. Consequently, the discontinuity in the diffusion coefficients has a strong impact on the accuracy and convergence of the numerical method. This motivates the derivation of computational error estimates that yield accurate estimates for specified quantities of interest. For this purpose, we adapt the well-known adjoint based a posteriori error analysis technique used for finite element methods. In order to employ this method, we describe a systematic approach to discretizing a cut-cell problem that handles complex geometry in the interface in a natural fashion yet reduces to the well-known Ghost Fluid Method in simple cases. We test the accuracy of the estimates in a series of examples.

97 MATHEMATICS AND COMPUTING↗

High-fidelity Multidisciplinary Sensitivity Analysis and Design Optimization for Rotorcraft Applications

A multidisciplinary sensitivity analysis of rotorcraft simulations involving tightly coupled high-fidelity computational fluid dynamics and comprehensive analysis solvers is presented and evaluated. A sensitivity-enabled fluid dynamics solver and a nonlinear flexible multibody dynamics solver are coupled to predict aerodynamic loads and structural responses of helicopter rotor blades. A discretely consistent adjoint-based sensitivity analysis available in the fluid dynamics solver provides sensitivities arising from unsteady turbulent flows and unstructured dynamic overset meshes, while a complex-variable approach is used to compute structural sensitivities with respect to aerodynamic loads. The multidisciplinary sensitivity analysis is conducted through integrating the sensitivity components from each discipline of the coupled system. Accuracy of the coupled system is validated by conducting simulations for a benchmark rotorcraft model and comparing solutions with established analyses and experimental data. Sensitivities of lift computed by the multidisciplinary sensitivity analysis are verified by comparison with the sensitivities obtained by complex-variable simulations. Finally the multidisciplinary sensitivity analysis is applied to a constrained gradient-based design optimization for a HART-II rotorcraft configuration.

Wang, Li↗

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↗

Dynamic Parameter Estimation with Physics-based Neural Ordinary Differential Equations

Accurate estimation of dynamic parameters of gen-erators is crucial to building a reliable model for dynamical studies and reliable operation of the power system. This paper develops a physics-based neural ordinary differential equations (ODE) approach to learn the parameters of generator dynamic model using phasor measurement units (PMU) data. We design a physics-based neural network to represent the swing equations of the power system dynamics. A loss function is defined as the difference between dynamic simulation results from the physics-based neural networks and pseudo PMU measurements. The parameters of generator dynamic model are iteratively updated using the neural ODEs and the adjoint method. By exploiting the mini-batch scheme in neural ODE training, the parameter estimation performance is significantly improved. Numerical study results on a 3-machine 9-bus system show that the proposed algorithm outperforms state-of-the-art baseline method in both computation time and dynamic parameter estimation accuracy.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Randomized Sketching Algorithms for Low-Memory Dynamic Optimization

This paper develops a novel limited-memory method to solve dynamic optimization problems. The memory requirements for such problems often present a major obstacle, particularly for problems with PDE constraints such as optimal flow control, full waveform inversion, and optical tomography. In these problems, PDE constraints uniquely determine the state of a physical system for a given control; the goal is to find the value of the control that minimizes an objective. While the control is often low dimensional, the state is typically more expensive to store. This paper suggests using randomized matrix approximation to compress the state as it is generated and shows how to use the compressed state to reliably solve the original dynamic optimization problem. Concretely, the compressed state is used to compute approximate gradients and to apply the Hessian to vectors. The approximation error in these quantities is controlled by the target rank of the sketch. This approximate first- and second-order information can readily be used in any optimization algorithm. As an example, we develop a sketched trust-region method that adaptively chooses the target rank using a posteriori error information and provably converges to a stationary point of the original problem. Numerical experiments with the sketched trust-region method show promising performance on challenging problems such as the optimal control of an advection-reaction-diffusion equation and the optimal control of fluid flow past a cylinder.

97 MATHEMATICS AND COMPUTING↗

Example Programs for idasv1.0.0

This report is intended to serve as a companion document to the User Documentation of idas. It provides details, with listings, on the example programs supplied with the idas distribution package. The idas distribution contains examples of the following types: serial and parallel examples of Initial Value Problem (IVP) integration, serial and parallel examples of forward sensitivity analysis (FSA), and serial and parallel examples of adjoint sensitivity analysis (ASA).

97 MATHEMATICS AND COMPUTING↗

Adjoint-based Calibration of Plasticity Model Parameters from Digital Image Correlation Data

Parameter estimation for mechanical models of plastic deformation utilized in nuclear weapons systems is a laborious process for both experimentalists and constitutive modelers and is critical to producing meaningful numerical predictions. In this work we derive an adjoint-based optimization approach for a stabilized, large-deformation J 2 plasticity model that is considerably more computationally efficient but no less accurate than current state of the art methods. Unlike most approaches to model calibration, we drive the inversion procedure with full-field deformation data that can be experimentally measured through established digital image or volume correlation techniques. We present numerical results for two and three dimensional model problems and comment on various directions of future research.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Output-Adaptive Tetrahedral Cut-Cell Validation for Sonic Boom Prediction

A cut-cell approach to Computational Fluid Dynamics (CFD) that utilizes the median dual of a tetrahedral background grid is described. The discrete adjoint is also calculated, which permits adaptation based on improving the calculation of a specified output (off-body pressure signature) in supersonic inviscid flow. These predicted signatures are compared to wind tunnel measurements on and off the configuration centerline 10 body lengths below the model to validate the method for sonic boom prediction. Accurate mid-field sonic boom pressure signatures are calculated with the Euler equations without the use of hybrid grid or signature propagation methods. Highly-refined, shock-aligned anisotropic grids were produced by this method from coarse isotropic grids created without prior knowledge of shock locations. A heuristic reconstruction limiter provided stable flow and adjoint solution schemes while producing similar signatures to Barth-Jespersen and Venkatakrishnan limiters. The use of cut-cells with an output-based adaptive scheme completely automated this accurate prediction capability after a triangular mesh is generated for the cut surface. This automation drastically reduces the manual intervention required by existing methods.

Park, Michael A.↗

All-multiplicity one-loop amplitudes in Born-Infeld electrodynamics from generalized unitarity

We initiate a study of non-supersymmetric Born-Infeld electrodynamics in 4d at the quantum level. Explicit all-multiplicity expressions are calculated for the purely rational one-loop amplitudes in the self-dual (+ + … +) and next-to-self-dual (- + … +) helicity sectors. Using a supersymmetric decomposition, d-dimensional unitarity cuts of the integrand factorize into tree-amplitudes in a 4d model of Born-Infeld photons coupled to a massive complex scalar. The two-scalar tree-amplitudes needed to construct the Born-Infeld integrand are computed using two complimentary approaches: (1) as a double-copy of Yang-Mills coupled to a massive adjoint scalar with a dimensionally reduced form of Chiral Perturbation Theory, and (2) by imposing consistency with low-energy theorems under a reduction from 4d to 3d and T-duality. The Born-Infeld integrand is integrated in d = 4 - 2ϵ dimensions at order Ο(ϵ 0 ) using the dimension-shifting formalism. We comment on the implications for electromagnetic duality in quantum Born-Infeld theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Computing the principal eigenelements of some linear operators using a branching Monte Carlo method

In earlier work, we developed a Monte Carlo method to compute the principal eigenvalue of linear operators, which was based on the simulation of exit times. In this paper, we generalize this approach by showing how to use a branching method to improve the efficacy of simulating large exit times for the purpose of computing eigenvalues. Furthermore, we show that this new method provides a natural estimation of the first eigenfunction of the adjoint operator. Numerical examples of this method are given for the Laplace operator and an homogeneous neutron transport operator.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An inverse model for a free-boundary problem with a contact line: Steady case

This paper reformulates the two-phase solidification problem (i.e., the Stefan problem) as an inverse problem in which a cost functional is minimized with respect to the position of the interface and subject to PDE constraints. An advantage of this formulation is that it allows for a thermodynamically consistent treatment of the interface conditions in the presence of a contact point involving a third phase. It is argued that such an approach in fact represents a closure model for the original system and some of its key properties are investigated. We describe an efficient iterative solution method for the Stefan problem formulated in this way which uses shape differentiation and adjoint equations to determine the gradient of the cost functional. Performance of the proposed approach is illustrated with sample computations concerning 2D steady solidification phenomena.

97 MATHEMATICS AND COMPUTING↗

Sensitivity Analysis of Neutron Multiplicity Counting Statistics Using First-Order Perturbation Theory and Application to a Subcritical Plutonium Metal Benchmark

It is frequently important to estimate the uncertainty and sensitivity of measured and computed detector responses in subcritical experiments and simulations. These uncertainties arise from the physical construction of the experiment, uncertainties in the transport parameters, and counting uncertainties. Perturbation theory enables sensitivity analysis (SA) and uncertainty quantification on integral quantities like detector responses. Here the aim of our work is to apply SA to the statistics of subcritical neutron multiplicity counting distributions. Current SA methods have only been applied to mean detector responses and the keff eigenvalue. For multiplicity counting experiments, knowledge of the higher-order counting moments and their uncertainties are essential for a complete SA. We apply perturbation theory to compute the sensitivity of neutron multiplicity counting moments to arbitrarily high order. Each moment is determined by solving an adjoint transport equation with a source term that is a function of the adjoint solutions for lower-order moments. This enables moments of arbitrarily high order to be sequentially determined, and it shows that each moment is sensitive to the uncertainties of all lower-order moments. To close our SA of the moments, we derive forward transport equations that are functions of the forward flux and lower-order moment adjoint fluxes. We verify our calculations for the first three moments by comparison with multiplicity counting measurements of a subcritical plutonium metal sphere. For the first three moments, the most influential parameters are ranked, and the validity of first-order perturbation theory is demonstrated by examining the series truncation error. This enables a detailed SA of subcritical multiplicity counting measurements of fissionable material based on transport theory.

42 ENGINEERING↗

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↗