Advertisement

General Sequential Sampling Techniques for Monte Carlo Simulations: Part I—Matrix Problems

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

Abstract

We study sequential sampling methods based principally on ideas of Halton. Such methods are designed to build information drawn from early batches of random walk histories into the random walk process used to generate later histories in order to accelerate convergence. In previously published work, such methods have been applied within the pseudorandom, rather than the quasirandom, context and have been applied only to matrix problems. In this paper, more general sequential techniques are formulated in an abstract space, such as Banach space. The more general formulation enables applications to linear algebraic equations and to integral equations to be obtained as special cases through specification of the Banach space and the operator defined on it. In this initial paper we outline the ideas needed for consideration of the more general problem and exhibit greatly accelerated convergence for a simple matrix problem. In a companion paper in which similar ideas are applied to the more important class of integral equations, the need for quasirandom implementation is stressed.

Keywords

Random Walk Importance Sampling Sequential Sampling Transport Problem Actual Error 
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]
    J.H. Halton, “Sequential Monte Carlo”, Proc. Camb. Phil. Soc. 58, (1962).Google Scholar
  2. [2]
    J. Halton, “Sequential Monte Carlo Techniques for the Solution of Linear Systems”, J. Sci. Comput., 9, (1994).Google Scholar
  3. [3]
    T.E. Booth, “Exponential Convergence for Monte Carlo Particle Transport”, Trans. Amer. Nucl. Soc., 50, 1986.Google Scholar
  4. [4]
    J. Spanier, “A New Multistage Procedure for Systematic Variance Reduction in Monte Carlo”, SIAM J. Numer. Anal. 8, (1971).Google Scholar
  5. [5]
    O. Axelsson, Iterative Solution Methods, Cambridge Univ. Press, 1994.CrossRefzbMATHGoogle Scholar
  6. [6]
    L. Li and J. Spanier, “Approximation of Transport Equations by Matrix Equations and Sequential Sampling”, in preparation.Google Scholar
  7. [7]
    J. Spanier and E.M. Gelbard, Monte Carlo Principles and Neutron Transport Problems, Addison-Wesley, 1969.zbMATHGoogle Scholar
  8. [8]
    G.E. Forsythe and R.A. Leibler, “Matrix Inversion by a Monte Carlo Method”, Math. Tables Aids to Comp., 4 (1950).Google Scholar
  9. [9]
    W. Wasow, “A Note on the Inversion of Matrices by Random Walks”, Math. Tables Aids to Comp., 6 (1952).Google Scholar
  10. [10]
    J. Spanier, “A New Family of Estimators for Random Walk Problems”, J. Inst. Maths. Applics., 23 (1979).Google Scholar

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • Jerome Spanier
    • 1
  • Liming Li
    • 1
  1. 1.Department of MathematicsThe Claremont Graduate SchoolClaremontUSA

Personalised recommendations