Application of Monte Carlo Chord-Length Sampling Algorithms to Transport through a Two-Dimensional Binary Stochastic Mixture

Abstract Monte Carlo algorithms are developed to calculate the ensemble-average particle leakage through the boundaries of a two-dimensional 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 (CLS) to eliminate the need to explicitly model the geometry of the mixture. Two variations are considered. The first algorithm uses CLS for both material regions. The second algorithm employs limited CLS (LCLS), using only CLS 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.

[1]  J. F. Briesmeister.  MCNP-A General Monte Carlo N-Particle Transport Code , 1993 .

[2]  Thieberger,et al.  Transport in two-dimensional scattering stochastic media: simulations and models , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[3]  M. Noskova,et al.  Stochastic laser-beam transfer through a binary Markovian mixture. , 1997, Applied optics.

[4]  Edward W. Larsen,et al.  Benchmark results for particle transport in a binary Markov statistical medium , 1989 .

[5]  J. Bertrand.  Calcul Des Probabilites , 2005 .

[6]  M. Williams.  Some Aspects of Neutron Transport in Spatially Random Media , 2000 .

[7]  G. C. Pomraning.  The variance in stochastic transport problems with Markovian mixing , 1996 .

[8]  T. Palmer,et al.  Analysis of iterative schemes for binary stochastic mixture transport equations , 2000 .

[9]  G. C. Pomraning,et al.  A Comparison of Models for Particle Transport Through Stochastic Mixtures , 1992 .

[10]  E. Jaynes.  The well-posed problem , 1973 .

[11]  M. Williams.  Neutron Transport in Spatially Random Media: An Assessment of the Accuracy of First Order Smoothing , 2000 .

[12]  G. C. Pomraning,et al.  Modification to a previous higher order model for particle transport in binary stochastic media , 1995 .

[13]  Marvin L. Adams,et al.  Algorithms for Monte Carlo particle transport in binary statistical mixtures , 1991 .

[14]  G. C. Pomraning,et al.  An exact analytical solution of a radiative transfer problem in a binary mixture , 1990 .

[15]  G. C. Pomraning,et al.  A Stochastic Description of a Broken Cloud Field , 1994 .

[16]  G. C. Pomraning,et al.  Linear Kinetic Theory and Particle Transport in Stochastic Mixtures , 1991 .

[17]  Graeme L. Stephens,et al.  The Parameterization of Radiation for Numerical Weather Prediction and Climate Models , 1984 .