Search NASA⌕ Search

SEARCH · Search NASA

Results for “deterministic”

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 1,783 records · Page 99

A 2-D/1-D transverse leakage approximation based on azimuthal, Fourier moments

Here, the MPACT code being developed collaboratively by Oak Ridge National Laboratory and the University of Michigan is the primary deterministic neutron transport solver within the Virtual Environment for Reactor Applications Core Simulator (VERA-CS). In MPACT, the two-dimensional (2-D)/one-dimensional (1-D) scheme is the most commonly used method for solving neutron transport-based three-dimensional nuclear reactor core physics problems. Several axial solvers in this scheme assume isotropic transverse leakages, but work with the axial S N solver has extended these leakages to include both polar and azimuthal dependence. However, explicit angular representation can be burdensome for run-time and memory requirements. The work here alleviates this burden by assuming that the azimuthal dependence of the angular flux and transverse leakages are represented by a Fourier series expansion. At the heart of this is a new axial SN solver that takes in a Fourier expanded radial transverse leakage and generates the angular fluxes used to construct the axial transverse leakages used in the 2-D-Method of Characteristics calculations.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Transmutation approximations for the application of hybrid Monte Carlo/deterministic neutron transport to shutdown dose rate analysis

In fusion energy systems (FES) neutrons born from burning plasma activate system components. The photon dose rate after shutdown from resulting radionuclides must be quantified. This shutdown dose rate (SDR) is calculated by coupling neutron transport, activation analysis, and photon transport. The size, complexity, and attenuating configuration of FES motivate the use of hybrid Monte Carlo (MC)/deterministic neutron transport. The Multi-Step Consistent Adjoint Driven Importance Sampling (MS-CADIS) method can be used to optimize MC neutron transport for coupled multiphysics problems, including SDR analysis, using deterministic estimates of adjoint flux distributions. When used for SDR analysis, MS-CADIS requires the formulation of an adjoint neutron source that approximates the transmutation process. In this work, transmutation approximations are used to derive a solution for this adjoint neutron source. It is shown that these approximations are reasonably met for typical FES neutron spectra and materials over a range of irradiation scenarios. When these approximations are met, the Groupwise Transmutation (GT)-CADIS method, proposed here, can be used effectively. GT-CADIS is an implementation of the MS-CADIS method for SDR analysis that uses a series of single-energy-group irradiations to calculate the adjoint neutron source. For a simple SDR problem, GT-CADIS provides speedups of 200 100 relative to global variance reduction with the Forward-Weighted (FW)-CADIS method and 9 ± 5 • 10 4 relative to analog. As a result, this work shows that GT-CADIS is broadly applicable to FES problems and will significantly reduce the computational resources necessary for SDR analysis.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Risk-Informed Safety Analysis for Accident Tolerant Fuels

Accident Tolerant Fuels (ATF) are being tested by different nuclear vendors and research organizations and their introduction in the US light water reactors fleet is planned for the second half of the 2020`s. In the framework of the US-DOE Light-Water Reactor Sustainability program, Risk-Informed Systems Analysis pathway, researches are being conducted at the Idaho National Laboratory for developing tools and methods that can help the industry quantifying the benefits from the adoption of ATF technology. In this paper we describe the developed risk-informed methodology including the safety analysis codes improvements, and we present some results for selected accident scenarios. The developed methodology combines INL state-of-the-art deterministic Best Estimate code RELAP5-3D, and Probabilistic Risk Analysis tools RAVEN and SAPHIRE. The analyses are performed on a three-loops pressurized water reactor, simulating Station Blackout and LB-LOCA accidents and considering near-term ATFs, or FeCrAl and Chromium-coated clads. Finally, we show how, applying our methodology, the new Core Damage Frequency can be assessed. The results indicated that the main benefits in introducing near-term ATFs concern a significant reduction in the hydrogen production during accident conditions. No significant Core Damage Frequency reduction was found.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Multigroup Constant Calculation with Static α-Eigenvalue Monte Carlo for Time-Dependent Neutron Transport Simulations

Herein, multigroup constants for deterministic methods that preserve the time-dependent physics of the neutron transport equations are derived. Alternative multigroup constant weighting spectra are discussed: (1) the fundamental k-eigenfunction, (2) the fundamental α-eigenfunction, and (3) a composite of several α-modes. To generate the fundamental α-eigenfunction for calculating the multigroup constants, a static fundamental α-eigenvalue method is implemented into the open source Monte Carlo code OpenMC. Several static and kinetic problems are devised to verify the implementations and to investigate the relative performance of the alternative multigroup constant weighting spectra. Results emphasize that as a multigroup constant weighting spectrum, the fundamental α-eigenfunction offers physical characteristics that make it advantageous (in producing accurate solutions) over the typically used fundamental k-eigenfunction.

42 ENGINEERING↗

Nonlinear Elimination Applied to Radiation Diffusion

We apply a nonlinearly preconditioned, quasi-Newton framework to accelerate the numerical solution of the thermal radiative transfer (TRT) equations. This framework was inspired by the unpublished method that has existed for years in Teton, Lawrence Livermore National Laboratory’s deterministic TRT code. In this paper, we cast this iteration scheme within a formal nonlinear preconditioning framework and compare its performance against other iteration schemes in the framework. With proper choices of iteration controls for the various levels of the solver, we can recover the standard linearized one-step method, a full nonlinear Newton scheme, as well as the method in Teton. In brief, the nonlinear preconditioning TRT scheme formally eliminates the material temperature equation from the nonlinear system in a nonlinear analog of a Schur complement. This nonlinear elimination step involves solving a decoupled nonlinear equation for each spatial degree of freedom and is therefore inexpensive. By applying a quasi-Newton iteration scheme on the new system, we obtain a three-level iteration scheme that is at least as efficient as commonly used TRT schemes. The new method allows full convergence to the nonlinear backward Euler time-discretized system, increasing accuracy and robustness, while using a similar number of linear iterations as the more common linearized one-step methods Eq. (4).

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Diffusion Synthetic Acceleration for Heterogeneous Domains, Compatible with Voids

A standard approach to solving the S N transport equations is to use source iteration with diffusion synthetic acceleration (DSA). Although this approach is widely used and effective on many problems, there remain some practical issues with DSA preconditioning, particularly on highly heterogeneous domains. For large-scale parallel simulation, it is critical that both (a) preconditioned source iteration converges rapidly and (b) the action of the DSA preconditioner can be applied using fast, scalable solvers, such as algebraic multigrid (AMG). For heterogeneous domains, these two interests can be at odds. In particular, there exist DSA diffusion discretizations that can be solved rapidly using AMG, but they do not always yield robust/fast convergence of the larger source iteration. Conversely, there exist robust DSA discretizations where source iteration converges rapidly on difficult heterogeneous problems, but fast parallel solvers like AMG tend to struggle applying the action of such operators. Moreover, very few current methods for the solution of deterministic transport are compatible with voids. This paper develops a new heterogeneous DSA preconditioner based on only preconditioning the optically thick subdomains. The resulting method proves robust on a variety of heterogeneous transport problems, including a linearized hohlraum mesh related to inertial confinement fusion. Moreover, the action of the preconditioner is easily computed using O(1) AMG iterations, convergence of the transport iteration typically requires 2 to 5× fewer iterations than current state-of-the-art “full” DSA, and the proposed method is trivially compatible with voids. On the hohlraum problem, rapid convergence is obtained by preconditioning less than 3% of the mesh elements with five to ten AMG iterations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Secondary-Source Core Reload Modeling with VERA

The CASL reactor simulation package VERA has been adapted to provide high-fidelity simulation capabilities for modeling source range detector response during subcritical reactor configurations. New features include the activation and shuffling of secondary-source assemblies, use of burned fuel neutron emission data from the ORIGEN depletion solver to the MPACT deterministic neutron transport solver, allowance of user-defined sources in MPACT based on material composition, ability to solve the subcritical source-driven system with neutron multiplication using the MPACT diffusion solver, and transfer of the calculated fission source from MPACT to the continuous-energy Monte Carlo solver Shift for final detector response evaluation using the CADIS methodology for variance reduction. These new capabilities were benchmarked against Watts Bar Unit 1 plant operating data for the first few fuel loading steps and were found to demonstrate excellent agreement with the measured data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An Analytic Benchmark for Neutron Boltzmann Transport with Downscattering—Part I: Flux and Eigenvalue Solutions

Computing in the energy dimension is one of the greatest challenges confronting present-day deterministic neutron transport solvers. Accurately resolving the neutron flux as neutrons downscatter across resonances in the nuclear cross sections currently requires considerable computing power and suffers from approximation errors. Flux uncertainty resulting from the uncertainty of the resonance structure is the single-largest cause of reactivity uncertainty. Any additional reference solution for the critical neutron downscattering problem with resonance phenomena would be a boon to verification and validation of neutronics codes. This paper establishes a benchmark to verify the accuracy of neutron transport criticality solvers along the energy dimension. For the first time, the analytic solution of the flux amplitude is derived in the particular case of an infinite homogeneous medium with isotropic scattering in the center of mass and an arbitrary number of no-threshold, neutral particle reaction resonances (e.g., radiative capture, fission, and resonance scattering). Furthermore, original analytic expressions are established to quantify the discrepancy between the ψ k (E) and ψ α (E) flux amplitudes, respective solutions of the multiplication factor k, or the exponential time-evolution frequency α eigenproblems. The physical study of these relations led to analysis of their first-order relative difference near the criticality condition α=0. Finally, numerical solutions are provided to a benchmark problem constituted of the first resonance of 239 Pu, the 6.67-eV resonance of 238 U, and a scattering isotope with a flat cross section, allowing for the computational verification of the energy resolution of current neutron transport criticality codes. Through these novel results, this analytic benchmark can serve as a reference to verify the energy resolution and sensitivity analysis of neutron transport criticality calculations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Deep Learning for Multigroup Cross-Section Representation in Two-Step Core Calculations

Here we investigate using deep learning, a type of machine-learning algorithm employing multiple layers of artificial neurons, for the mathematical representation of multigroup cross sections for use in the Griffin reactor multiphysics code for two-step deterministic neutronics calculations. A three-dimensional fuel element typical of a high-temperature gas reactor as well as a two-dimensional sodium-cooled fast reactor lattice are modeled using the Serpent Monte Carlo code, and multigroup macroscopic cross sections are generated for various state parameters to produce a training data set and a separate validation data set. A fully connected, feedforward neural network is trained using the open-source PyTorch machine-learning framework, and its accuracy is compared against the standard piecewise linear interpolation model. Additionally, we provide in this work a generic technique for propagating the cross-section model errors up to the k eff using sensitivity coefficients with the first-order uncertainty propagation rule. Quantifying the eigenvalue error due to the cross-section regression errors is especially practical for appropriately selecting the mathematical representation of the cross sections. We demonstrate that the artificial neural network model produces lower errors and therefore enables better accuracy relative to the piecewise linear model when the cross sections exhibit nonlinear dependencies; especially when a coarse grid is employed, where the errors can be halved by the artificial neural network. However, for linearly dependent multigroup cross sections as found for the sodium-cooled fast reactor case, a simpler linear regression outperforms deeper networks.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Three-Dimensional Full-Core BEAVRS Using OpenMOC with Transport Equivalence

Using an optimized implementation of the three-dimensional (3D) method of characteristics for neutron transport, along with a novel equivalence method for transport calculations that was designed to correct self-shielding errors from neglecting the angular dependence of resonant group absorption, a 3D full-core light water reactor hybrid stochastic-deterministic eigenvalue calculation was achieved. This paper presents the optimizations developed and compares the transport solutions obtained. For the statepoint, run times near 10 000 CPU hours are achieved—improving on previous works by an order of magnitude—with near 1% error on pin fission to 238 U capture ratios and a few dozen pcms on the eigenvalue.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A Survey of Multimaterial Treatments for Thermal Radiative Transfer

Arbitrary Lagrangian-Eulerian methods are a popular choice for hydrodynamic modeling in radiation (rad-hydro) simulations. Because these methods involve a relaxation step that moves the mesh relative to material boundaries, multimaterial spatial zones are generally present. Accurate treatments of these zones are needed to resolve various physical phenomena of interest for inertial confinement fusion applications. However, these codes are often paired with single-material, deterministic thermal radiative transfer (TRT) codes that are oblivious to the material compositions of each zone. These single-material TRT codes can only accept homogenized material properties (opacities, specific heats, etc.) from the hydrodynamic code and output homogenized solutions. After each TRT time step, the multimaterial hydrodynamic code must dehomogenize the quantities computed by the TRT package in order to update subzonal material temperatures. The process by which hydrodynamic codes perform this dehomogenization has not been well documented in previous literature, and the methods can vary significantly from code to code. The purpose of this paper is to document, study, and compare existing techniques used for rad-hydro simulations as well as present a new method with potentially promising results. We summarize several methods and give comparisons on infinite-medium problems as well a finite-medium problem for two of the methods.

42 ENGINEERING↗

Multiphysics Simulation of KRUSTY Warm Critical Experiments Using MOOSE Tools

A series of critical experiments were performed during the Kilopower Reactor Using Stirling TechnologY (KRUSTY) project, producing valuable and unique data for the validation of corresponding microreactor models. In this paper, the development of a high-fidelity multiphysics model of the KRUSTY microreactor within the MOOSE ecosystem is presented, with a focus on the microreactor configuration during the warm critical experiments. The model was established by coupling a deterministic neutronics model using the Griffin code, with a BISON thermomechanical model. The multiphysics model successfully simulated the KRUSTY 15 ¢ and 30 ¢ warm critical reactivity insertion experiments in satisfactory agreement with the experimental measurement data. In conclusion, the modeling results demonstrated the performance of MOOSE-based multiphysics tools in microreactor simulations, and spotlighted the useful applications of these tools in supporting microreactor design, qualification, and licensing activities.

KRUSTY↗

CADIS and FW-CADIS Variance Reduction in Gamma Transport for Predicting Prompt Forensics Signatures

The goal of prompt nuclear forensics is to determine the characteristics of a nuclear detonation based on the signatures available almost immediately after the explosion. An important characteristic is the reaction time history (RTH), a measure of the device’s rate of neutron multiplication. The RTH can be estimated by observation of the gamma radiation emitted from the detonation, which can be detected directly or observed indirectly as Teller light. Gamma transport simulations used to predict these radiation fields are often modeled stochastically using the Monte Carlo N-Particle (MCNP) code, which can be a computationally demanding task due to the number of particle histories needed to achieve statistical convergence. In an attempt to improve the efficiency of these calculations, we evaluate two variance reduction techniques: Consistent Adjoint-Driven Importance Sampling (CADIS) and Forward-Weighted Consistent Adjoint-Driven Importance Sampling (FW-CADIS). These methods use a deterministically calculated adjoint flux to create weight windows and source biasing that guide MCNP sampling. We study the utility of CADIS and FW-CADIS for their use in MCNP gamma transport for nuclear forensics prediction simulations. Furthermore, the results demonstrate that both CADIS and FW-CADIS improve the accuracy for forensics-focused simulations, with CADIS being most beneficial in direct detection and FW-CADIS being ideal for computing a global Teller light source.

CADIS↗

Optimization of Multi-Fidelity Computer Experiments via the EQIE Criterion

Computer experiments based on mathematical models are powerful tools for understanding physical processes. This article addresses the problem of kriging-based optimization for deterministic computer experiments with tunable accuracy. Our approach is to use multi- delity computer experiments with increasing accuracy levels and a nonstationary Gaussian process model. We propose an optimization scheme that sequentially adds new computer runs by following two criteria. The first criterion, called EQI, scores candidate inputs with given level of accuracy, and the second criterion, called EQIE, scores candidate combinations of inputs and accuracy. Here, from simulation results and a real example using finite element analysis, our method out-performs the expected improvement (EI) criterion which works for single-accuracy experiments.

97 MATHEMATICS AND COMPUTING↗

Accelerating Asymptotically Exact MCMC for Computationally Intensive Models via Local Approximations

We construct a new framework for accelerating Markov chain Monte Carlo in posterior sampling problems where standard methods are limited by the computational cost of the likelihood, or of numerical models embedded therein. Our approach introduces local approximations of these models into the Metropolis–Hastings kernel, borrowing ideas from deterministic approximation theory, optimization, and experimental design. Previous efforts at integrating approximate models into inference typically sacrifice either the sampler’s exactness or efficiency; our work seeks to address these limitations by exploiting useful convergence characteristics of local approximations. We prove the ergodicity of our approximate Markov chain, showing that it samples asymptotically from the exact posterior distribution of interest. We describe variations of the algorithm that employ either local polynomial approximations or local Gaussian process regressors. Our theoretical results reinforce the key observation underlying this article: when the likelihood has some local regularity, the number of model evaluations per Markov chain Monte Carlo (MCMC) step can be greatly reduced without biasing the Monte Carlo average. Numerical experiments demonstrate multiple order-of-magnitude reductions in the number of forward model evaluations used in representative ordinary differential equation (ODE) and partial differential equation (PDE) inference problems, with both synthetic and real data. Supplementary materials for this article are available online.

97 MATHEMATICS AND COMPUTING↗

Augmenting subspace optimization methods with linear bandits

In this work, we consider the framework of methods for unconstrained minimization that are, in each iteration, restricted to a model that is only a valid approximation to the objective function on some affine subspace containing an incumbent point. These methods are of practical interest in computational settings where derivative information is either expensive or impossible to obtain. Recent attention has been paid in the literature to employing randomized matrix sketching for generating the affine subspaces within this framework. We consider a relatively straightforward, deterministic augmentation of such a generic subspace optimization method. In particular, we consider a sequential optimization framework where actions consist of one-dimensional linear subspaces and rewards consist of (approximations to) the magnitudes of directional derivatives computed in the direction of the action subspace. Reward maximization in this context is consistent with maximizing lower bounds on descent guaranteed by first-order Taylor models. This sequential optimization problem can be analysed through the lens of dynamic regret. We modify an existing linear upper confidence bound (UCB) bandit method and prove sublinear dynamic regret in the subspace optimization setting. We demonstrate the efficacy of employing this linear UCB method in a setting where forward-mode algorithmic differentiation can provide directional derivatives in arbitrary directions and in a derivative-free setting. For the derivative-free setting, we propose SS-POUNDers, an extension of the derivative-free optimization method POUNDers that employs the linear UCB mechanism to identify promising subspaces. Our numerical experiments suggest a preference, in either computational setting, for employing a linear UCB mechanism within a subspace optimization method.

97 MATHEMATICS AND COMPUTING↗

Efficient Decision Trees for Tensor Regressions

Here, we proposed the tensor-input tree (TT) method for scalar-on-tensor and tensor-on-tensor regression problems. We first address scalar-on-tensor problem by proposing scalar-output regression tree models whose input variables are tensors (i.e., multi-way arrays). We devised and implemented fast randomized and deterministic algorithms for efficient fitting of scalar-on-tensor trees, making TT competitive against tensor-input GP models (Yu, Li, and Liu; Sun et al.). Based on scalar-on-tensor tree models, we extend our method to tensor-on-tensor problems using additive tree ensemble approaches. Theoretical justification and extensive experiments, including testing robustness to entrywise input tensor noise, are provided on real and synthetic datasets to illustrate the performance of TT. Our implementation is provided at https://github.com/hrluo/TensorDecisionTreeRegressor. Supplementary materials for this article are available online.

Decision tree regressions↗

Application of the Denovo Discrete Ordinates Radiation Transport Code to Large-Scale Fusion Neutronics

Fusion energy systems pose unique challenges to the modeling and simulation community. These challenges must be met to ensure the success of the ITER experimental fusion reactor. ITER’s complex systems require detailed modeling that goes beyond the scale of comparable simulations to date. In this work, the Denovo radiation transport code was used to calculate neutron fluence and kerma for the JET streaming benchmark. This work was performed on the Titan supercomputer at the Oak Ridge Leadership Computing Facility. Denovo is a novel three-dimensional discrete ordinates transport code designed to be highly scalable. Sensitivity studies have been completed to examine the impact of several deterministic parameters. Furthermore, results were compared against experiment as well as the MCNP and Shift Monte Carlo codes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗