Application of Monte Carlo Chord-Length Sampling Algorithms to Transport Through a 2-D Binary Stochastic Mixture


Book Description

Monte Carlo algorithms are developed to calculate the ensemble-average particle leakage through the boundaries of a 2-D binary stochastic material. The mixture is specified within a rectangular area and consists of a fixed number of disks of constant radius randomly embedded in a matrix material. The algorithms are extensions of the proposal of Zimmerman et al., using chord-length sampling to eliminate the need to explicitly model the geometry of the mixture. Two variations are considered. The first algorithm uses Chord-Length Sampling (CLS) for both material regions. The second algorithm employs Limited Chord Length Sampling (LCLS), only using chord-length sampling in the matrix material. Ensemble-average leakage results are computed for a range of material interaction coefficients and compared against benchmark results for both accuracy and efficiency. both algorithms are exact for purely absorbing materials and provide decreasing accuracy as scattering is increased in the matrix material. The LCLS algorithm shows a better accuracy than the CLS algorithm for all cases while maintaining an equivalent or better efficiency. Accuracy and efficiency problems with the CLS algorithm are due principally to assumptions made in determining the chord-length distribution within the disks.




A Comparison of Monte Carlo Particle Transport Algorithms for Binary Stochastic Mixtures


Book Description

Two Monte Carlo algorithms originally proposed by Zimmerman and Zimmerman and Adams for particle transport through a binary stochastic mixture are numerically compared using a standard set of planar geometry benchmark problems. In addition to previously-published comparisons of the ensemble-averaged probabilities of reflection and transmission, we include comparisons of detailed ensemble-averaged total and material scalar flux distributions. Because not all benchmark scalar flux distribution data used to produce plots in previous publications remains available, we have independently regenerated the benchmark solutions including scalar flux distributions. Both Monte Carlo transport algorithms robustly produce physically-realistic scalar flux distributions for the transport problems examined. The first algorithm reproduces the standard Levermore-Pomraning model results for the probabilities of reflection and transmission. The second algorithm generally produces significantly more accurate probabilities of reflection and transmission and also significantly more accurate total and material scalar flux distributions.




Monte Carlo Methods for Particle Transport


Book Description

Fully updated with the latest developments in the eigenvalue Monte Carlo calculations and automatic variance reduction techniques and containing an entirely new chapter on fission matrix and alternative hybrid techniques. This second edition explores the uses of the Monte Carlo method for real-world applications, explaining its concepts and limitations. Featuring illustrative examples, mathematical derivations, computer algorithms, and homework problems, it is an ideal textbook and practical guide for nuclear engineers and scientists looking into the applications of the Monte Carlo method, in addition to students in physics and engineering, and those engaged in the advancement of the Monte Carlo methods. Describes general and particle-transport-specific automated variance reduction techniques Presents Monte Carlo particle transport eigenvalue issues and methodologies to address these issues Presents detailed derivation of existing and advanced formulations and algorithms with real-world examples from the author’s research activities













A Comparison of Monte Carlo Particle Transport Algorithms for an Interior Source Binary Stochastic Medium Benchmark Suite


Book Description

Particle transport through binary stochastic mixtures has received considerable research attention in the last two decades. Zimmerman and Adams proposed a Monte Carlo algorithm (Algorithm A) that solves the Levermore-Pomraning equations and another Monte Carlo algorithm (Algorithm B) that should be more accurate as a result of improved local material realization modeling. Zimmerman and Adams numerically confirmed these aspects of the Monte Carlo algorithms by comparing the reflection and transmission values computed using these algorithms to a standard suite of planar geometry binary stochastic mixture benchmark transport solutions. The benchmark transport problems are driven by an isotropic angular flux incident on one boundary of a binary Markovian statistical planar geometry medium. In a recent paper, we extended the benchmark comparisons of these Monte Carlo algorithms to include the scalar flux distributions produced. This comparison is important, because as demonstrated, an approximate model that gives accurate reflection and transmission probabilities can produce unphysical scalar flux distributions. Brantley and Palmer recently investigated the accuracy of the Levermore-Pomraning model using a new interior source binary stochastic medium benchmark problem suite. In this paper, we further investigate the accuracy of the Monte Carlo algorithms proposed by Zimmerman and Adams by comparing to the benchmark results from the interior source binary stochastic medium benchmark suite, including scalar flux distributions. Because the interior source scalar flux distributions are of an inherently different character than the distributions obtained for the incident angular flux benchmark problems, the present benchmark comparison extends the domain of problems for which the accuracy of these Monte Carlo algorithms has been investigated.







Monte Carlo Particle Transport Methods


Book Description

With this book we try to reach several more-or-less unattainable goals namely: To compromise in a single book all the most important achievements of Monte Carlo calculations for solving neutron and photon transport problems. To present a book which discusses the same topics in the three levels known from the literature and gives us useful information for both beginners and experienced readers. It lists both well-established old techniques and also newest findings.