Advertisement

Quasi-Monte Carlo Methods for Particle Transport Problems

  • Jerome Spanier
Part of the Lecture Notes in Statistics book series (LNS, volume 106)

Abstract

Particle transport problems arise in such diverse application areas as the modeling of nuclear reactors and of semiconductor devices, and in the remote sensing of underground geologic features. Conventional Monte Carlo methods solve such problems by using pseudorandom numbers to make decisions at the microscopic level in order to draw conclusions about the macroscopic behavior of the system. Application of quasirandom (low discrepancy) sequences to such problems encounters certain difficulties that must be overcome if predictable gains over the use of pseudorandom Monte Carlo are to be realized. This paper outlines several ideas for achieving this and presents the results of “model” problem analyses and numerical tests of these ideas.

Keywords

Model Problem Mixed Strategy Transport Problem Pseudorandom Sequence Neumann Series 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, CBMS-SIAM, 1992.Google Scholar
  2. [2]
    W.J. Morokoff and R.E. Caflisch, “A quasi-Monte Carlo approach to particle simulation of the heat equation”, SIAM J. Num. Anal., 30, (1993), 1558–1573.MathSciNetMATHCrossRefGoogle Scholar
  3. [3]
    J. Spanier and E.H. Maize, “Quasi-random methods for estimating integrals using relatively small samples”, SIAM Rev., 36, (1994), 18–44.MathSciNetMATHCrossRefGoogle Scholar
  4. [4]
    J. Spanier and E.M. Gelbard, Monte Carlo Principles and Particle Transport Problems, Addison-Wesley, 1969.Google Scholar
  5. [5]
    J. Spanier, “Some results on transport theory and their application to Monte Carlo methods”, J. Math. Anal. Appl., 17, (1967), 549 –559.MathSciNetCrossRefGoogle Scholar
  6. [6]
    P. Chelson, “Quasi-random techniques for Monte Carlo methods”, Ph.D. dissertation, The Claremont Graduate School, 1976.Google Scholar
  7. [7]
    I. Lux and L. Koblinger, Monte Carlo Particle Transport Methods: Neutron and Photon Calculations, CRC Press, 1990.Google Scholar
  8. [8]
    J. Kingman and S. Taylor, Introduction to Measure and Probability, Cambridge Univ. Press, 1966.MATHGoogle Scholar
  9. [9]
    J. Olmstead, Real Variables, Appleton-Century-Crofts, 1959.Google Scholar
  10. [10]
    E. Maize, “Contributions to the theory of error reduction in quasi-Monte Carlo Methods”, Ph.D. Dissertation, The Claremont Graduate School, 1981.Google Scholar
  11. [11]
    M.J.D. Powell and J. Swann, “Weighted uniform sampling - a Monte Carlo technique for reducing variance”, J. Inst. Maths. Applics., 2, (1966), 228–236.MathSciNetMATHCrossRefGoogle Scholar
  12. [12]
    J. Spanier, “A new family of estimators for random walk problems”, J. Inst. Maths. Applics., 23, (1979), 1–31.MathSciNetCrossRefGoogle Scholar
  13. [13]
    C. Lécot, “Low discrepancy sequences for solving the Boltzmann equation”, J. Comp. Appl. Math., 25, (1989), 237–249.MATHCrossRefGoogle Scholar
  14. [14]
    C. Lécot, “A quasi-Monte Carlo method for the Boltzmann equation”, Math. Comp., 56, (1991), 621–644.MathSciNetMATHCrossRefGoogle Scholar
  15. [15]
    H. Babovsky, F. Gropengiesser, H. Neunzert, J. Struckmeier, and B. Wiesen, “Application of well-distributed sequences to the numerical simulation of the Boltzmann equation”, J. Comp. Appl. Math., 31, (1990), 15–22.MathSciNetMATHCrossRefGoogle Scholar
  16. [16]
    E. Braaten and G. Weller, “An improved low-discrepancy sequence for multidimensional integration”, J. Comp. Phys., 33, (1979), 249–258.MATHCrossRefGoogle Scholar
  17. [17]
    D. Knuth, “Construction of a random sequence”, BIT, 5, (1965), 246 – 250.MathSciNetMATHCrossRefGoogle Scholar
  18. [18]
    D. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 2nd ed., Addison-Wesley, 1981.Google Scholar
  19. [19]
    H. Faure, Good permutations for extreme discrepancy, J. Number Theory, 1992, 47 – 56.Google Scholar
  20. [20]
    H.Niederreiter, “Point sets and sequences with small discrepancy”, Monatsch. Math.. 104, (1987), 273–337.MathSciNetMATHCrossRefGoogle Scholar
  21. [21]
    B.S. Moskowitz, “Application of quasi-random sequences to Monte Carlo methods”, Ph.D. Dissertation, UCLA, 1993.Google Scholar
  22. [22]
    J. Spanier, “An analytic approach to variance reduction”, SIAM J. Appl. Math., 18, (1970), 172–190.MathSciNetMATHCrossRefGoogle Scholar
  23. [23]
    A.B. Owen, “Randomly permuted (t,m,s)- nets and (t,s)- sequences”, this volume.Google Scholar
  24. [24]
    “Quasi-Monte Carlo methods applied to oil well logging problems”, CGS Mathematics Clinic final report to Chevron Petroleum Technology Company, June, 1994.Google Scholar

Copyright information

© Springer-Verlag New York, Inc. 1995

Authors and Affiliations

  • Jerome Spanier
    • 1
  1. 1.Mathematics DepartmentThe Claremont Graduate SchoolClaremontUSA

Personalised recommendations