Search NASA⌕ Search

Engineering topics

Brown, Peter N.

Publications and source records attributed to Brown, Peter N..

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↗

Eigenmode Analysis of Pulsed Neutron Transport Simulations

We discuss the time dependent behavior of some simple pulsed neutron simulations of subcritical problems in slab geometry. Our intent is to investigate the eigenvalue structure of the discretized neutron transport equation and to show under some reasonable assumptions that a dominant time eigenvalue exists that has a nonnegative eigenvector that determines the long time dependent behavior of the solution.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

TNSL Overview

Thermal neutron scattering law (TNSL) data describe low-energy neutrons scattering off of bound materials, and can have a significant impact on modeling any system with slow neutrons, including nuclear reactors. Previous work to introduce TNSL data to neutron transport codes at LLNL focused on COG and TART [1], with the limitation that these codes require highly specialized data processing and formatting. We have recently increased efforts to process TNSL data with the central LLNL nuclear data processing code FUDGE, to be stored in the generalized nuclear database structure (GNDS) for use in any general transport code with the ability to read GNDS data. The first step in this effort is to verify that the TNSL processing with FUDGE yields results comparable to results obtained using the LANL nuclear data processing code NJOY. The next step is to verify the transport of thermal neutrons in Mercury (a Monte Carlo code) and Ardra (a deterministic code) against one another, as well as against the LANL Monte Carlo neutron transport code MCNP. This verification step has not been completed, due to a number of discrepancies between results obtained using differently processed data. There is ongoing effort to understand differences between FUDGE and NJOY. Finally, we map out our current capability to validate TNSL data against benchmark systems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

The Improved Simple Corner Balance Method and Efforts to Enhance its Computational Performance

The diamond difference (DD) spatial discretization has long been a work horse of the neutron transport community. For nearly as long as DD has been used in neutron transport, it has been observed that DD produces undamped, non-physical angular fluxes in spatially under resolved problems and can fail in the thick diffusion limit. A long list of alternative spatial discretizations, all with better physics properties: accuracy, robustness, and/or preservation of the thick diffusion limit, have been proposed as alternatives to DD. Unfortunately, these alternative spatial discretizations also require significantly more floating point operations (FLOPs) per unknown compared to DD. Historically, neutron transport problems of interest have been able to be resolved sufficiently that DD is accurate enough and FLOPs have been the computational performance bottleneck controlling time to solution. Thus, in practice DD has been and remains a preferred spatial discretization for neutron transport simulations. Trends in computing architecture are leading to a new paradigm where data movement, not FLOPs will control time to solution. This presents an opportunity to improve neutron transport physics by reconsidering more FLOP intensive spatial discretization than DD without incurring a time to solution penalty. In this work, we consider the improved simple corner balance (ISCB) spatial discretization, a unique alternative to DD that has the same memory footprint as DD, and detail efforts to improve its computational performance. The ISCB spatial discretization is a more FLOP intensive spatial discretization than DD with the same memory footprint as DD. Though designed to maximize FLOP intensity, third party libraries such as LAPACK are not tuned for the unique, frequent, small linear algebra needs of neutron transport problems. While hand coding a sparse Gauss elimination is likely to be faster than a dense matrix solve (CM vs. HGE), were LAPACK suitable for small linear algebra problems, we would not have seen a performance increase with decreased numbers of LAPACK calls for the Schur complement solve (SC4 vs. SC1). Significant effort has reduced the relative compute time of ISCB to DD, but on current computer architectures DD is still faster than ISCB. Future work comparing the overall efficiency of ISCB to DD may reveal that while ISCB is slower than DD on current computers, ISCB is more accurate than DD by a factor greater than the compute time slowdown. As new computer architectures become available, we will test our hypothesis that neutron transport simulations will be bandwidth limited, ideally rendering the additional FLOPs required by ISCB to be 'free' [in terms of time to solution]. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Computation Annual Report (2013)

Computation provides the intellectual electricity that helps make Lawrence Livermore National Laboratory (LLNL) a thriving and innovative research and development (R&D) institution. Our hardware, software, and discipline experts are integrated into almost every field of research at LLNL. Our in-house programs, software applications, and support initiatives help achieve mission-critical national-security objectives for the U.S. Departments of Energy, Homeland Security, and Defense, as well as other federal and state agencies. We deliver comprehensive support to a wide set of scientific disciplines that include physical sciences (materials modeling, fluid dynamics), biology (genomic sequencing), mathematics (scalable algorithms), and computer sciences (parallel processing, real-time control systems). This year, we have expanded our outreach with high performance computing (HPC) collaborations and made great strides in our capabilities related to mathematical computation, control systems, and computation infrastructure, many of them in concert with partners in industry and academia. The Computation workforce remains highly motivated and passionate about melding computational expertise with cutting-edge science and technology to enable breakthroughs. 2013 has once again proven that Computation provides the foundation and support that are essential for productivity at LLNL. Every scientific discipline and program leverages the tools and expertise provided by our staff. We remain at the forefront of HPC moving towards exascale and have developed the infrastructure and proficiency to make this an achievable goal. Our researchers repeatedly deliver outstanding research, attracting collaborations with the biggest names in academia and industry, while joining forces with other national laboratories to further push the bounds of what is scientifically possible. Computation’s mission is echoed by the President of the United States in his assertion that “our future depends on reaffirming America’s role as the world’s engine of scientific discovery and technological innovation.” Driven by this lofty goal, we employ our state-of-the-art computational capabilities to ensure LLNL’s position as a global science and technology leader.

97 MATHEMATICS AND COMPUTING↗

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 modelled after the analysis presented for the continuous POI equations by Mokhtar-Kharroubi and Jarmouni-Idrissi [12], and by Pazy and Rabinowitz [14].

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Globally convergent techniques in nonlinear Newton-Krylov

Some convergence theory is presented for nonlinear Krylov subspace methods. The basic idea of these methods is to use variants of Newton's iteration in conjunction with a Krylov subspace method for solving the Jacobian linear systems. These methods are variants of inexact Newton methods where the approximate Newton direction is taken from a subspace of small dimensions. The main focus is to analyze these methods when they are combined with global strategies such as linesearch techniques and model trust region algorithms. Most of the convergence results are formulated for projection onto general subspaces rather than just Krylov subspaces.

Brown, Peter N.↗