Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Neutron Transport”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Space to Air High-Altitude Region Adjoint Neutron Transport

Neutrons from an atmospheric nuclear explosion can be detected by sensors in orbit. Current tools for characterizing the neutron energy spectrum assume a known source and use forward transport to recreate the detector response. In realistic scenarios the true source is unknown, making this an inefficient, iterative approach. In contrast, the adjoint approach directly solves for the source spectrum, enabling source reconstruction. The time–energy fluence at the satellite and adjoint transport equation allow a Monte Carlo method to characterize the neutron source’s energy spectrum directly in a new model: the Space to High-Altitude Region Adjoint (SAHARA) model. A new adjoint source event estimator was developed in SAHARA to find feasible solutions to the neutron transport problem given the constraints of the adjoint environment. This work explores SAHARA’s development and performance for mono-energetic and continuous neutron energy sources. In general, the identified spectra were shifted towards energies approximately 5% lower than the true source spectra, but SAHARA was able to capture the correct spectral shapes. Continuous energy sources, including real-world sources Fat Man and Little Boy, resulted in identifiable spectra that could have been produced by the same distribution as the true sources as demonstrated by two-dimensional (2D) Kolmogorov–Smirnov tests.

LaMere, Zachary W.↗
DOE OSTI2024

Resolving Neutron Transport with the CoGNAC Neutron Scattering Program at LANSCE [Poster]

Neutron Scattering Defines Neutron Transport. Elastic (n,n) and inelastic (n,n'γ) reactions dictate the neutronic energy flow. Each scattering reaction changes neutron direction $\vartheta$ and energy E. Scattering cross sections and angular distributions are essential for neutron transport. Uncertainties on scattering evaluations and measurements dominate total uncertainties. New, high-precision neutron scattering measurements and evaluations are needed from light elements to actinides

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Data reduction in deterministic neutron transport calculations using machine learning

Neutron cross section matrices for fission and scattering data are required for each material, temperature, and enrichment level to calculate the neutron transport equation accurately. Here, this information can be a limiting factor when using the multigroup discrete ordinates (S N ) method when the number of energy groups is large. Machine Learning (ML) can be used to replace the need for the cross section matrices by reproducing the function that maps the scalar flux to the scattering and fission sources. Through the use of autoencoders and Deep Jointly-Informed Neural Networks (DJINN), the data storage requirements are reduced by 94% of the original data for a 618 group problem. This is accomplished while preserving the scalar flux, maintaining generality, and decreasing wall clock times.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2019

Development of a Novel Accelerator for Neutron Transport Solution Using the Galerkin Spectral Element Methods (Final Report)

This report summarizes the results of a three-year research project sponsored by the U.S. Department of Energy (DOE) Nuclear Energy University Program (NEUP) to develop and implement advanced acceleration schemes for the DOE NEAMS neutronics code PROTEUSSN. The project team included the University of Massachusetts Lowell, The Ohio State University, University of Michigan, and Argonne National Laboratory. The PROTEUS code is a high-fidelity capable deterministic neutron transport code based on unstructured finite element meshes, which solves the steady-state and transient neutron transport problem using the 2nd-order discrete ordinate method (SN2ND), the method of characteristics (MOC), and the advanced nodal transport method (NODAL). The DSA scheme has been implemented in PROTEUS to speed up SN transport calculations. The existing DSA scheme employs a consistent finite element formulation on the same fine mesh structure as the SN solution While the use of consistent discretizations makes the DSA method effective, it does not necessarily make it efficient because the numerical solution of a discretized elliptic diffusion problem itself can be costly, particularly when the problem size becomes large. We developed a new discontinuous Galerkin (DG) discretization of the diffusion equation, called DG-DSA, which can effectively and efficiently accelerate the SN transport iterations. As compared with the previous work, the novelty of our method is that the diffusion equation is solved on a coarse-mesh grid using the DG methods, and the DG diffusion discretization incorporates local hp adaptation, i.e., local adaptation of mesh size and/or polynomial degree, based on local total cross section (or optical thickness). Therefore, the resulting number of degrees of freedom (DOF) of the DG discretization is much less than the conventional consistent DSA discretizations, and thus DG-DSA can achieve significant improvement in computational efficiency. We implemented this scheme in PROTEUS-SN. In addition, we developed a new stabilization scheme named linear prolongation CMFD (lpCMFD). A novel feature of this scheme is that the conventional flat flux ratio–based scaling approach is replaced with a linear interpolation of the scalar flux differences at the coarse-mesh cell edges between the neutron transport and CMFD calculations. Fourier convergence analysis and numerical results show that lpCMFD is unconditionally stable and more effective than other CMFD based on acceleration schemes such as pCMFD, odCMFD. We also developed a new nonlinear diffusion acceleration scheme for solving neutron transport equations. This scheme, called LR-NDA, employs a local refinement approach on the framework of CMFD by solving a local boundary value problem of the scalar flux on the coarse-mesh structure to replace the piecewise constant scalar flux obtained by CMFD. The refined flux is then used to update the scalar flux in the neutron transport source iteration. It has been demonstrated that that LR-NDA is much more effective and stable than CMFD for a wide range of optical thicknesses. LR-NDA is a local adaptive method, which means LR-NDA does not necessarily require local refinement for all the coarse-mesh cells on the problem domain, i.e., it can be used only for relatively optically thick regions where the standard CMFD scheme would encounter the convergence problem.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

A low-rank power iteration scheme for neutron transport criticality problems

Computing effective eigenvalues for neutron transport often requires a fine numerical resolution. Here, the main challenge of such computations is the high memory effort of classical solvers, which limits the accuracy of chosen discretizations. In this work, we derive a method for the computation of effective eigenvalues when the underlying solution has a low-rank structure. This is accomplished by utilizing dynamical low-rank approximation (DLRA), which is an efficient strategy to derive time evolution equations for low-rank solution representations. The main idea is to interpret the iterates of the classical inverse power iteration as pseudo-time steps and apply the DLRA concepts in this framework. In our numerical experiment, we demonstrate that our method significantly reduces memory requirements while achieving the desired accuracy. Analytic investigations show that the proposed iteration scheme inherits the convergence speed of the inverse power iteration, at least for a simplified setting.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Calculating Time Eigenvalues of the Neutron Transport Equation with Dynamic Mode Decomposition

A novel method to compute time eigenvalues of neutron transport problems is presented based on solutions to the time-dependent transport equation. Using these solutions, we use the dynamic mode decomposition to form an approximate transport operator. This approximate operator has eigenvalues that are mathematically related to the time eigenvalues of the neutron transport equation. This approach works for systems of any level of criticality and does not require the user to have estimates for the eigenvalues. Numerical results are presented for homogeneous and heterogeneous media. The numerical results indicate that the method finds the eigenvalues that contribute the most to the change in the solution over a given time range, and the eigenvalue with the largest real part is not necessarily important to the system evolution at short and intermediate times.

42 ENGINEERING↗
DOE OSTI2023

Probability of Initiation in Neutron Transport

We discuss the numerical solution of the nonlinear integro-differential equation for the probability of a divergent neutron chain in a stationary system (i.e., the probability of initiation (POI)). We follow the development described in Bell’s classic paper on the stochastic theory of neutron transport. As noted by Bell, the linearized form of this equation resembles the linear adjoint neutron transport equation. A matrix formalism for the discretized steady state (or forward) neutron equation in slab geometry is first developed and is then used to derive the discrete adjoint equation. A main advantage of this discrete development is that the resulting discrete adjoint equation does not depend upon how the multigroup cross sections for the forward problem are obtained. That is, we derive the discrete adjoint directly from the discrete forward equations rather than discretizing directly the adjoint equation. This also guarantees that the discrete adjoint operator is consistent with the inner product used to define the adjoint operator. We discuss three approaches for the numerical solution of the POI equations, and present numerical results on several test problems. The three solution methods are a simple fixed-point iteration, a second approach that is akin to a nonlinear Power iteration, and a third approach which uses a Newton-Krylov nonlinear solver. We also give sufficient conditions to guarantee the existence and uniqueness of nontrivial solutions to our discrete POI equations when the discrete system is supercritical, and that only the trivial solution exists when the discrete system is subcritical. Our approach is modeled after the analysis presented for the continuous POI equations by Mokhtar-Kharroubi and Jarmouni-Idrissi, and by Pazy and Rabinowitz.

42 ENGINEERING↗
DOE OSTI2021

Benchmarking GEANT4 and PHITS for 14.8-MeV neutron transport in polyethylene and graphite materials

The feasibility of GEANT4 and PHITS with ENDF/B-VIII.0, JEFF-3.3 and JENDL-4.0 evaluated nuclear data libraries in 14.8-MeV neutron transport simulation are verified by comparing with the MCNP calculations and the experimental data. Here the measured data are from neutron integral experiments including graphite and polyethylene samples. For 6 cm-thick polyethylene and 20 cm-thick graphite samples, the results from GEANT4 and PHITS with three evaluated nuclear data libraries agree well with the MCNP calculations. For a 2 cm-thick graphite sample, the simulated results from GEANT4 and PHITS agree with the MCNP calculations, and they all underestimate the experiment data in below 3 MeV and overestimate them in the energy range of 5–7 MeV. The difference between the simulation results and the experimental data depends on the evaluated nuclear data libraries. In overall, GEANT4 and PHITS are performing reasonable jobs for 14.8-MeV neutron transport simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Error analysis of numerical methods for thick diffusive neutron transport problems on Shishkin mesh

A thin layer will develop at the boundary if the incoming angular flux is anisotropic in thick diffusive neutron transport problems. Solving such singularly perturbed problems, which have non-smooth solutions with singularity near the boundary, is computationally challenging. Standard finite difference schemes on a uniform mesh cannot yield ε-uniform convergence, where ε is a small parameter, while it can be achieved on a suitable piecewise-uniform Shishkin mesh. We present a formal error analysis of the diamond difference (DD) method and step difference (SD) method for solving the S{sub N} neutron transport equation. The analysis can be extended to other finite difference methods. Numerical results are presented to confirm the error estimates and the advantages of the Shishkin mesh. (author)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

New capabilities of the MORET 6 Monte Carlo neutron transport code

The MORET code is a simulation tool that solves the transport equation for neutrons using the Monte Carlo method. It allows users to model complex three-dimensional geometrical configurations in a user-friendly way. New features have been introduced to extend the application field of MORET beyond the usual criticality calculations for which it has been initially designed. The most important change is the addition of an analog fixed source mode which allows studies of systems of any reactivity combined with very flexible outputs. Other useful improvements have been added concerning the geometric part, the fission matrix, the multigroup sensitivity coefficients and the outputs. This paper presents an overview of these new features. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2022

On the novel 3-D neutron transport kinetic tRAPID algorithm and its validation

The Real-time Analysis for Particle-transport and In-situ Detection (RAPID) Code System, based on the Multi-stage Response-function Transport (MRT) methodology, allows for real-time simulation of nuclear systems based on 3-D continuous-energy particle transport. RAPID's steady-state (criticality) neutron transport algorithm is based on the Fission Matrix (FM) method, and has been extensively verified and validated against computational benchmarks and experiments. This paper introduces the novel 3-D time-dependent transport algorithm that has been implemented into the code, tRAPID, and its validation using the JSI TRIGA Mark-II reactor. tRAPID accurately and efficiently calculates neutron kinetics parameters (such as β{sub eff}, l{sub eff} , Λ, α{sub Rossi}) and 3-D time-dependent neutron fission source distribution and neutron importances for both prompt and delayed neutrons. tRAPID is used to simulate a rod insertion experiment performed at the JSI TRIGA Mark-II reactor, during which signals from four fission chambers at four different locations in the core were collected. The results demonstrate how tRAPID is capable of calculating detailed and accurate results with only a minimal use computational resources and time.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Comparison of nested geometry treatments within GPU-based Monte Carlo neutron transport simulations of fission reactors

Monte Carlo (MC) neutron transport provides detailed estimates of radiological quantities within fission reactors. This involves tracking individual neutrons through a computational geometry. CPU-based MC codes use multiple polymorphic tracker types with different tracking algorithms to exploit the repeated configurations of reactors, but virtual function calls have high overhead on the GPU. The Shift MC code was modified to support GPU-based tracking with three strategies: dynamic polymorphism with virtual functions, static polymorphism, and a single tracker type with tree-based acceleration. On the Frontier supercomputer these methods achieve 77.8%, 91.2%, and 83.4%, respectively, of the tracking rate obtained using a specialized tracker optimized for rectilinear-grid-based reactors. This indicates that all three methods are suitable for typical reactor problems in which tracking does not dominate runtime. The flexibility of the single tracker method is highlighted with a hexagonal-grid microreactor problem, performed without hexagonal-grid-specific tracking routines, providing a 2.19× speedup over CPU execution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A flexible linear diffusion acceleration to k-eigenvalue neutron transport with SN discontinuous finite element method

In this paper, we derive a flexible linear diffusion acceleration (LDA) for k-eigenvalue neutron transport discretized with discontinuous finite element method (DFEM) and discrete ordinates(SN). This LDA is based on our two pieces of previous works: the flexible non linear diffusion acceleration (NDA) for DFEM-SN and LDA for k-eigenvalue neutron transport using pre-conditioned Jacobian-free Newton-Krylov with self-adjoint angular flux (SAAF), continuous finite element method(CFEM), and SN. We point out the differences between LDA and NDA for DFEM-SN and the difference between DFEM-SN and SAAF-CFEM-SN for LDA. Numerical tests are presented to compare the convergence behaviour of NDA and LDA. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Divergence Reduction in Monte Carlo Neutron Transport with On-GPU Asynchronous Scheduling

While Monte Carlo Neutron Transport (MCNT) is near-embarrasingly parallel, the effectively unpredictable lifetime of neutrons can lead to divergence when MCNT is evaluated on GPUs. Divergence is the phenomenon of adjacent threads in a warp executing different control flow paths; on GPUS, it reduces performance because each work group may only execute one path at a time. The process of Thread Data Remapping (TDR) resolves these discrepancies by moving data across hardware such that data in the same warp will be processed through similar paths. A common issue among prior implementations of TDR is the synchronous nature of its remapping and processing cycles, which exhaustively sort data produced by prior processing passes and exhaustively evaluate the sorted data. In another work, we defined a method of remapping data through an asynchronous scheduler which allows for work to be stored in shared memory and deferred arbitrarily until that work is a viable option for low-divergence evaluation. This article surveys a wider set of cases, with the goal of characterizing performance trends across a more comprehensive set of parameters. These parameters include cross sections of scattering/capturing/fission, use of implicit capture, source neutron counts, simulation time spans, and tuned memory allocations. Across these cases, we have recorded minimum and average execution times, as well as a heuristically tuned near-optimal memory allocation size for both synchronous and asynchronous scheduling. Across the collected data, it is shown that the asynchronous method is faster and more memory efficient in the majority of cases, and that it requires less tuning to achieve competitive performance.

Computer Science↗