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 271 records · Page 15

Nodal weighting factor method for ex-core fast neutron fluence evaluation

The nodal weighting factor method is developed for evaluating ex-core fast neutron flux in a nuclear reactor by utilizing adjoint neutron flux, a fictitious unit detector cross section for neutron energy above 1 or 0.1 MeV, the unit fission source, and relative assembly nodal powers. The method determines each nodal weighting factor for ex-core neutron fast flux evaluation by solving the steady-state adjoint neutron transport equation with a fictitious unit detector cross section for neutron energy above 1 or 0.1 MeV as the adjoint source, by integrating the unit fission source with a typical fission spectrum to the solved adjoint flux over all energies, all angles and given nodal volume, and by dividing it with the sum of all nodal weighting factors, which is a normalization factor. Then, the fast neutron flux can be obtained by summing the various relative nodal powers times the corresponding nodal weighting factors of the adjacent significantly contributed peripheral assembly nodes and times a proper fast neutron attenuation coefficient over an operating period. A generic set of nodal weighting factors can be used to evaluate neutron fluence at the same location for similar core design and fuel cycles, but the set of nodal weighting factors needs to be re-calibrated for a transition-fuel-cycle. This newly developed nodal weighting factor method should be a useful and simplified tool for evaluating fast neutron fluence at selected locations of interest in ex-core components of contemporary nuclear power reactors. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Shape Determination for Deformed Electromagnetic Cavities

The measured physical parameters of a superconducting cavity differ from those of the designed ideal cavity. This is due to shape deviations caused by both loose machine tolerances during fabrication and by the tuning process for the accelerating mode. We present a shape determination algorithm to solve for the unknown deviations from the ideal cavity using experimentally measured cavity data. The objective is to match the results of the deformed cavity model to experimental data through least-squares minimization. The inversion variables are unknown shape deformation parameters that describe perturbations of the ideal cavity. The constraint is the Maxwell eigenvalue problem. We solve the nonlinear optimization problem using a line-search based reduced space Gauss-Newton method where we compute shape sensitivities with a discrete adjoint approach. We present two shape determination examples, one from synthetic and the other from experimental data. The results demonstrate that the proposed algorithm is very effective in determining the deformed cavity shape.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Development of a Library for Conducting Monte Carlo Tallies on Heterogeneous Systems

A library is introduced that enables users to conduct Monte Carlo tallies on heterogeneous computing systems. The library can be built with or linked to a Monte Carlo transport code to provide tally capabilities for the project. The library provides a set of tools and an interface for constructing tallies that can be computed on CPUs or GPUs regardless of where the sample data was generated. The library can be incorporated into existing Monte Carlo transport codes at both the research and production level with minimal intrusion into the transport code. The tally library is capable of computing a variety of tallies including track-length histogram (mesh) tallies, collisionbased kernel density estimators, functional expansion tallies, eigenvalue sensitivity coefficients via iterated fission probability, and sensitivities of reaction rates or adjoint-weighted quantities via differential operator sampling. The parallelization methods are discussed and speedups are shown for 2-D and 3-D problems with comparisons to both the tally library CPU implementations as well as the tally capabilities in the host transport code. Performance results and examples are shown for MCNP, MCATK, and OpenMC.

97 MATHEMATICS AND COMPUTING↗

Burst wait time simulation of CALIBAN reactor at delayed super-critical state

In the past, the super prompt critical wait time probability distribution was measured on CALIBAN fast burst reactor [4]. Afterwards, these experiments were simulated with a very good agreement by solving the non-extinction probability equation [5]. Recently, the burst wait time probability distribution has been measured at CEA-Valduc on CALIBAN at different delayed super-critical states [6]. However, in the delayed super-critical case the non-extinction probability does not give access to the wait time distribution. In this case it is necessary to compute the time dependent evolution of the full neutron count number probability distribution. In this paper we present the point model deterministic method used to calculate the probability distribution of the wait time before a prescribed count level taking into account prompt neutrons and delayed neutron precursors. This method is based on the solution of the time dependent adjoint Kolmogorov master equations for the number of detections using the generating function methodology [8,9,10] and inverse discrete Fourier transforms. The obtained results are then compared to the measurements and Monte-Carlo calculations based on the algorithm presented in [7]. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Ultrasonic imaging in liquid sodium

The fourth generation of nuclear reactor can use liquid sodium as the core coolant. When the reactor is operating, sodium temperatures can reach up to 600 deg. C. During maintenance periods, when the reactor is shut down, the coolant temperature is reduced to 200 deg. C. Because molten sodium is optically opaque, ultrasonic imaging techniques are developed for maintenance activities. Under-sodium imaging aims at i) checking the health of immersed structures. It should also allow ii) to assess component degradation or damage as cracks and shape defects as well as iii) the detection of lost objects. The under-sodium imaging system has to sustain high temperature (up to 300 deg. C) and hostility of the sodium environment. Furthermore, specific constraints such as transducers characteristics or the limited sensor mobility in the reactor vessel have to be considered. This work focuses on developing a methodology for detecting damages such as crack defects with ultrasound devices. Surface-breaking cracks or deep cracks are sought in the weld area, as welds are more subject to defects. Traditional methods enabled us to detect emerging cracks of submillimeter size with sodium-compatible high-temperature transducer. The presented approach relies on making use of prior knowledge about the environment through the implementation of differential imaging and time-reversal techniques. Indeed, this approach allows to detect a change by comparison with a reference measurement and by focusing back to any change in the environment. It is a means of analysis and understanding of the physical phenomena making it possible to design more effective inspection strategies. Difference between the measured signals reveals the acoustic field scattered by a perturbation (a crack for instance), which may occur between periodical measurements. The imaging method relies on the adequate combination of two computed ultrasonic fields, one forward and one adjoint. The adjoint field, which carries the information about the defects, is analogous to a time-reversal operation. One of the interests of the presented method is that the time-reversal operation is not done experimentally but numerically. Numerical simulations have been carried out to validate the practical relevance of this approach. The preliminary numerical results show a nice agreement between the guessed and the actual positions of the defect. After water-tests, in sodium-tests must be done in order to validate the water/sodium transposition. For this purpose, an under-sodium device is under development, which can move the transducers with four degrees of freedom in a 1.5 m{sup 3} sodium pot. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Radiation Source Mapping with Bayesian Inverse Methods

In this work, we present a method to map the spectral and spatial distributions of radioactive sources using a limited number of detectors. Locating and identifying radioactive materials is important for border monitoring, in accounting for special nuclear material in processing facilities, and in cleanup operations following a radioactive material spill. Most methods to analyze these types of problems make restrictive assumptions about the distribution of the source. In contrast, the source mapping method presented here allows an arbitrary three-dimensional distribution in space and a gamma peak distribution in energy. To apply the method, the problem is cast as an inverse problem where the system’s geometry and material composition are known and fixed, while the radiation source distribution is sought. A probabilistic Bayesian approach is used to solve the resulting inverse problem since the system of equations is ill-posed. The posterior is maximized with a Newton optimization method. The probabilistic approach also provides estimates of the confidence in the final source map prediction. A set of adjoint, discrete ordinates flux solutions, obtained in this work by the Denovo code, is required to efficiently compute detector responses from a candidate source distribution. These adjoint fluxes form the linear mapping from the state space to the response space. The test of the method’s success is simultaneously locating a set of 137 Cs and 60 Co gamma sources in a room. This test problem is solved using experimental measurements that we collected for this purpose. Because of the weak sources available for use in the experiment, some of the expected photopeaks were not distinguishable from the Compton continuum. However, by supplanting 14 flawed measurements (out of a total of 69) with synthetic responses computed by MCNP, the proof-of-principle source mapping was successful. The locations of the sources were predicted within 25 cm for two of the sources and 90 cm for the third, in a room with an ~4-x 4-m floor plan. Finally, the predicted source intensities were within a factor of ten of their true value.

07 ISOTOPE AND RADIATION SOURCES↗

Sensitivity Coefficients for Diffusion Coefficients and Other Reactor Physics Parameters using CE TSUNAMI-3D

The TSUNAMI (Tools for Sensitivity and Uncertainty Analysis Methodology Implementation) capabilities within the SCALE code system leverage sensitivity coefficients for many criticality safety applications, including quantifying the data-induced uncertainty in the eigenvalue of critical systems, quantifying computational biases, and selecting applicable benchmark experiments. TSUNAMI sensitivity and uncertainty analysis tools have traditionally been limited to criticality safety application spaces, but the introduction of Generalized Perturbation Theory (GPT) sensitivity methods by Jessee in 2009 and Perfetti in 2013 has extended the scope of SCALE adjoint-weighted sensitivity and uncertainty analysis to include reactor physics applications. The continuous-energy (CE) TSUNAMI-3D GPT sensitivity analysis methods were originally developed to calculate sensitivity coefficients for a limited number of reaction-rate responses using CE Monte Carlo methods. These tools were recently applied in an Oak Ridge National Laboratory (ORNL)-directed research and development project to improve the efficiency of {sup 252}Cf production in the High Flux Isotope Reactor (HFIR) by understanding the sensitivity of key heavy actinide capture-to- fission ratios to potential system design changes. This work further extends the applicability of the CE TSUNAMI- 3D GPT methods to reactor physics applications by enabling the calculation of sensitivity coefficients for an expanded set of reaction rate responses-including a first-ever capability for conducting sensitivity analysis of neutron diffusion coefficients.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Linearization errors in discrete goal-oriented error estimation

This paper is concerned with goal-oriented a posteriori error estimation for nonlinear functionals in the context of nonlinear variational problems solved with continuous Galerkin finite element discretizations. A two-level, or discrete, adjoint-based approach for error estimation is considered. The traditional method to derive an error estimate in this context requires linearizing both the nonlinear variational form and the nonlinear functional of interest which introduces linearization errors into the error estimate. In this paper, we investigate these linearization errors. In particular, we develop a novel discrete goal-oriented error estimate that accounts for traditionally neglected nonlinear terms at the expense of greater computational cost. We demonstrate how this error estimate can be used to drive mesh adaptivity. Here, we show that accounting for linearization errors in the error estimate can improve its effectivity for several nonlinear model problems and quantities of interest. We also demonstrate that an adaptive strategy based on the newly proposed estimate can lead to more accurate approximations of the nonlinear functional with fewer degrees of freedom when compared to uniform refinement and traditional adjoint-based approaches.

42 ENGINEERING↗

Asynchronous Two-Level Checkpointing Scheme for Large-Scale Adjoints in the Spectral-Element Solver Nek5000

Adjoints are an important computational tool for large-scale sensitivity evaluation, uncertainty quantification, and derivative-based optimization. An essential component of their performance is the storage/recomputation balance in which efficient checkpointing methods play a key role. We introduce a novel asynchronous two-level adjoint checkpointing scheme for multistep numerical time discretizations targeted at large-scale numerical simulations. The checkpointing scheme combines bandwidth-limited disk checkpointing and binomial memory checkpointing. Based on assumptions about the target petascale systems, which we later demonstrate to be realistic on the IBM Blue Gene/Q system Mira, we create a model of the expected performance of our checkpointing approach and validate it using the highly scalable Navier-Stokes spectralelement solver Nek5000 on small to moderate subsystems of the Mira supercomputer. In turn, this allows us to predict optimal algorithmic choices when using all of Mira. We also demonstrate that two-level checkpointing is significantly superior to single-level checkpointing when adjoining a large number of time integration steps. To our knowledge, this is the first time two-level checkpointing had been designed, implemented, tuned, and demonstrated on fluid dynamics codes at large scale of 50k+ cores.

Adjoints↗

Least-Squares PN Formulation of the Transport Equation Using Self-Adjoint-Angular-Flux Consistent Boundary Conditions.

In this paper, we study the Least-Squares (LS) PN form of the transport equation compatible with voids in the context of Continuous Finite Element Methods (CFEM).We first deriveweakly imposed boundary conditions which make the LS weak formulation equivalent to the Self-Adjoint Angular Flux (SAAF) variational formulation with a void treatment, in the particular case of constant cross-sections and a uniform mesh. We then implement this method in Rattlesnake with the Multiphysics Object Oriented Simulation Environment (MOOSE) framework using a spherical harmonics (PN) expansion to discretize in angle. We test our implementation using the Method of Manufactured Solutions (MMS) and find the expected convergence behavior both in angle and space. Lastly, we investigate the impact of the global non-conservation of LS by comparing the method with SAAF on a heterogeneous test problem.

Least-Squares↗

Least-Squares PN Formulation of the Transport Equation Using Self-Adjoint-Angular-Flux Consistent Boundary Conditions

In this paper, we study the Least-Squares (LS) PN form of the transport equation compatible with voids [1] in the context of Continuous Finite Element Methods (CFEM).We first deriveweakly imposed boundary conditions which make the LS weak formulation equivalent to the Self-Adjoint Angular Flux (SAAF) variational formulation with a void treatment [2], in the particular case of constant cross-sections and a uniform mesh. We then implement this method in Rattlesnake with the Multiphysics Object Oriented Simulation Environment (MOOSE) framework [3] using a spherical harmonics (PN) expansion to discretize in angle. We test our implementation using the Method of Manufactured Solutions (MMS) and find the expected convergence behavior both in angle and space. Lastly, we investigate the impact of the global non-conservation of LS by comparing the method with SAAF on a heterogeneous test problem.

97 MATHEMATICS AND COMPUTING↗

MC21 analysis of the nuclear energy agency Monte Carlo performance benchmark problem

Due to the steadily decreasing cost and wider availability of large scale computing platforms, there is growing interest in the prospects for the use of Monte Carlo for reactor design calculations that are currently performed using few-group diffusion theory or other low-order methods. To facilitate the monitoring of the progress being made toward the goal of practical full-core reactor design calculations using Monte Carlo, a performance benchmark has been developed and made available through the Nuclear Energy Agency. A first analysis of this benchmark using the MC21 Monte Carlo code was reported on in 2010, and several practical difficulties were highlighted. In this paper, a newer version of MC21 that addresses some of these difficulties has been applied to the benchmark. In particular, the confidence-interval-determination method has been improved to eliminate source correlation bias, and a fission-source-weighting method has been implemented to provide a more uniform distribution of statistical uncertainties. In addition, the Forward-Weighted, Consistent-Adjoint-Driven Importance Sampling methodology has been applied to the benchmark problem. Results of several analyses using these methods are presented, as well as results from a very large calculation with statistical uncertainties that approach what is needed for design applications. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Verification of the pin power reconstruction method in NESTLE

NESTLE is a 3D nodal core simulator that solves the few group neutron diffusion equation using the nodal expansion method (NEM) for the steady state (eigenvalue or fixed-source), adjoint (eigenvalue), and transient (eigenvalue or fixed-source) problems. NESTLE has been in use for over 25 years and has been continuously improved and developed. NESTLE can be used to model either Cartesian geometries (for use with typical PWR, BWR fuel assemblies) or hexagonal geometries (for use with VVER and other triangularly pitched fuel assemblies). As part of NESTLE's ongoing verification and validation process, several computational comparisons have been made to quantify the discrepancies in NESTLE's hexagonal pin power reconstruction method. In this paper, we present the results of these code-to-code comparisons and find that the root mean squared (RMS) error in pin power is comparable to other nodal codes.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

A Posteriori Error Analysis of a Cell-centered Finite Volume Method for Semilinear Elliptic Problems

In this paper, we conduct an a posteriori analysis for the error in a quantity of interest computed from a cell-centered finite volume scheme. The a posteriori error analysis is based on variational analysis, residual error and the adjoint problem. To carry out the analysis, we use an equivalence between the cell-centered finite volume scheme and a mixed finite element method with special choice of quadrature.

99 GENERAL AND MISCELLANEOUS↗

Convergence study of Rattlesnake solutions for the two-dimensional C5G7 MOX benchmark

This paper presents the convergence study of a specific transport scheme, self-adjoint angular flux (SAAF) formulation with the discrete ordinates (SN) method and continuous finite element method (CFEM), implemented with Rattlesnake, on solving the well known two-dimensional C5G7 MOX benchmark. Both the convergence in space and angle are studied. Numerical results show the convergence of the spatial and angular refinements.

Benchmark↗

Goal-based angular adaptivity applied to a wavelet-based discretisation of the neutral particle transport equation

A method for applying goal-based adaptive methods to the angular resolution of the neutral particle transport equation is presented. The methods are applied to an octahedral wavelet discretisation of the spherical angular domain which allows for anisotropic resolution. The angular resolution is adapted across both the spatial and energy dimensions. The spatial domain is discretised using an inner-element sub-grid scale finite element method. The goal-based adaptive methods optimise the angular discretisation to minimise the error in a specific functional of the solution. The goal-based error estimators require the solution of an adjoint system to determine the importance to the specified functional. The error estimators and the novel methods to calculate them are described. Several examples are presented to demonstrate the effectiveness of the methods. It is shown that the methods can significantly reduce the number of unknowns and computational time required to obtain a given error. The novelty of the work is the use of goal-based adaptive methods to obtain anisotropic resolution in the angular domain for solving the transport equation. -- Highlights: •Wavelet angular discretisation used to solve transport equation. •Adaptive method developed for the wavelet discretisation. •Anisotropic angular resolution demonstrated through the adaptive method. •Adaptive method provides improvements in computational efficiency.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive mesh refinement for steady flows in Nek5000

Adaptive mesh refinement is performed in the framework of the spectral element method augmented by approaches to error estimation and control. The h-refinement technique is used for adapting the mesh, where selected grid elements are split by a quadtree (2D) or octree (3D) structure. Continuity between parent-child elements is enforced by high-order interpolation of the solution across the common faces. Parallel mesh partitioning and grid management respectively, are taken care of by the external libraries ParMETIS and p4est. Two methods are considered for estimating and controlling the error of the solution. The first error estimate is local and based on the spectral properties of the solution on each element. This method gives a local measure of the L-2-norm of the solution over the entire computational domain. The second error estimate uses the dual-weighted residuals method - it is based on and takes into account both the local properties of the solution and the global dependence of the error in the solution via an adjoint problem. The objective of this second approach is to optimize the computation of a given functional of physical interest. The simulations are performed by using the code Nek5000 and three steady-state test cases are studied: a two-dimensional lid-driven cavity at Re = 7, 500, a two-dimensional flow past a cylinder at Re = 40, and a three-dimensional lid-driven cavity at Re = 2,000 with a moving lid tilted by an angle of 30 degrees. Finally, the efficiency of both error estimators is compared in terms of refinement patterns and accuracy on the functional of interest. In the case of the adjoint error estimators, the trend on the error of the functional is shown to be correctly represented up to a multiplicative constant.

42 ENGINEERING↗

Low-Rank Solution Methods for Stochastic Eigenvalue Problems

In this report, we study efficient solution methods for stochastic eigenvalue problems arising from discretization of self-adjoint partial differential equations with random data, where the underlying operators depend linearly on the random parameters. With the stochastic Galerkin approach, the solutions are represented as generalized polynomial chaos expansions. When these solutions can be approximated well by low-rank objects, we introduce a low-rank variant of the inverse subspace iteration algorithm for computing one or several minimal eigenvalues and corresponding eigenvectors of parameter-dependent matrices. In the algorithm, the iterates are approximated by low-rank matrices, which leads to significant cost savings. Furthermore, the algorithm is tested on two benchmark problems, a stochastic diffusion problem with some poorly separated eigenvalues, and an operator derived from a discrete stochastic Stokes problem whose minimal eigenvalue is related to the inf-sup stability constant. Numerical experiments show that the low-rank algorithm produces accurate solutions compared to the Monte Carlo method, and it uses much less computational time than the original algorithm without low-rank approximation.

97 MATHEMATICS AND COMPUTING↗