Modified Monte Carlo Methods Using Quasi-Random Sequences

  • Russel E. Caflisch
  • Bradley Moskowitz
Part of the Lecture Notes in Statistics book series (LNS, volume 106)


Computational experiments have shown that Monte Carlo methods using quasi-random sequences lose some of their effectiveness for integration problems in which the dimension is large or the integrand is not smooth. In this paper, two modified Monte Carlo methods are developed, which regain an enhanced convergence rate. The standard rejection method involves discontinuities, corresponding to the decision to accept or reject. In place of this, a smoothed rejection method is formulated and found to be very effective when used with quasi-random sequences. Monte Carlo evaluation of Feynman-Kac path integrals involves high dimension, one dimension for each discrete time interval. Through an alternative discretization, the effective dimension of the integration domain is drastically reduced, so that quasi-random sequences are effective.


Importance Sampling Effective Dimension Monte Carlo Estimate Monte Carlo Integration Importance Function 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G. Marsaglia. Normal (Gaussian) random variables for supercomputers. The Journal of Supercomputing, 5: 49 – 55, 1991MATHCrossRefGoogle Scholar
  2. [2]
    W. Morokoff and R.E. Caflisch. A Quasi-Monte Carlo approach to particle simulation of the heat equation. SIAM Journal on Numerical Analysis, 30: 1558 – 1573, 1993MathSciNetMATHCrossRefGoogle Scholar
  3. [3]
    W. Morokoff and R.E. Caflisch. Quasi-random sequences and their discrepancies. SIAM J. Sci. Stat Computing, 15: 1251 – 1279, 1994MathSciNetMATHCrossRefGoogle Scholar
  4. [4]
    W. Morokoff and R.E. Caflisch. Quasi-Monte Carlo integration. J. Comp. Phys., to appear, 1995Google Scholar
  5. [5]
    B. Moskowitz. Improved stochastic simulation using quasi-Monte Carlo: a computational study. 1994Google Scholar
  6. [6]
    B. Moskowitz. Quasirandom diffusion Monte Carlo. 1994Google Scholar
  7. [7]
    B. Moskowitz and R.E. Caflisch. Smoothness and dimension reduction in quasi-Monte Carlo methods. J. Math. Comp. Modeling, submitted, 1994Google Scholar
  8. [8]
    H. Niederreiter. Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia, 1992MATHGoogle Scholar
  9. [9]
    S.H. Paskov. Computing high dimensional integrals with applications to finance. preprint, 1994Google Scholar
  10. [10]
    M.J.D. Powell and J. Swann. Weighted uniform sampling - a Monte Carlo technique for reducing variance. J.Inst.Maths Applics, 2: 228 – 236, 1966MathSciNetMATHCrossRefGoogle Scholar
  11. [11]
    J. Spanier and E.H. Maize. Quasi-random methods for estimating integrals using relatively small samples. SIAM Review, 36: 1 – 44, 1994MathSciNetCrossRefGoogle Scholar
  12. [12]
    H. Wozniakowski. Average case complexity of multivariate integration. Bulletin of the AMS, 24: 185 – 194, 1991MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag New York, Inc. 1995

Authors and Affiliations

  • Russel E. Caflisch
    • 1
  • Bradley Moskowitz
    • 1
  1. 1.Mathematics DepartmentUniversity of CaliforniaLos AngelesUSA

Personalised recommendations