Bennett L. Fox
Supplemental Material
Available for Download
gz
647.gz (7 KB)
< Gams: H2c,L6b21
- 1 ANTONOV, I. A., AND SALEEV, V. M. An economic method of computing LP,-sequences. USSR Comput. Math. Math. Phys. 19 (1979), 252-256.Google Scholar
- 2 BRATLEY, P., AND Fox, B. L. Implementing ;Sobol's quasirandom sequence generator. Tech. Rep. Universite de Montreal, Montreal, Quebec, Canada.Google Scholar
- 3 BRATLEY, P., Fox, B. L., AND SCHRAGE, L. E. A Guide to Simulation. Springer-Verlag, New York, 1983. Google Scholar
- 4 DAVIS, P. J., AND RABINOWITZ, P. Methods of Numerical Integration. Academic Press, New York, 1984.Google Scholar
- 5 FAURE, H. Discrepance de suites associees i un systeme de numeration (en dimension s). Acta Arithmetica XLZ (1982), 337-351.Google Scholar
- 6 HALTON, J. H. On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Numer. Math. 2 (1960), 84-90.Google Scholar
- 7 HALTON, J. H., AND SMITH, G. B. Algorithm 247; radical-inverse quasi-random point sequence. Commun. ACM 7 (1964), 701-702. Google Scholar
- 8 HLAWKA, E. Functionen von .beschranker Variation in der Theorie der Gleichverteilung. Ann. Math. Pura Appl. 54 (1961), 325-333.Google Scholar
- 9 KAHANER, D. Sources of information on quadrature software. In Sources and Development of Mathematical Software (W. R. Cowell, Ed.). Prentice-Hall, Englewood Cliffs, N. J. 1984, pp. 134-164.Google Scholar
- 10 NIEDERREITER, H. Quasi-Monte Carlo methods and pseudo-random numbers. Bull. Amer. Math. Sot. 84 (1978), 957-1041.Google Scholar
- 11 NIEDERREITER, H. The serial test for pseudo-random numbers generated by the linear congruential method. Numer. Math. 46 (1985), 51-68.Google Scholar
- 12 NIEDERREITER, H., AND MCCIJRLEY, K. Optimization of functions by quasi-random search methods. Computing 22 (1979), 119-123.Google Scholar
- 13 RICE, J. R. Numerical Methods, Sdftware, and Analysis. McGraw-Hill, New York, 1983. Google Scholar
- 14 SOBOL', L. M. Pseudo-random numbers for constructing discrete Markov chains by the Monte Carlo method. USSR Comput. Math. Math. Phys. 14 (1974), 36-45.Google Scholar
- 15 SOBOL', I. M. Uniformly distributed sequences with an additional uniform property. USSR Comput. Math. Math. Phys. 16 (1976), 236-242.Google Scholar
- 16 SOBOL', I. M. On the systematic search in a hypercube. SIAM J. Numer. Anal. 16 (1979), 790-793.Google Scholar
- 17 SOBOL', I. M. On an estimate of the accuracy of a simple multidimensional search. Sov. Math. Dokl. 26 (1982), 398-401.Google Scholar
- 18 WICHMANN, B. A., AND HILL, I. D. An efficient and portable pseudo-random number generator. Appl. Stat. 31 (1982), 188-190.Google Scholar
Index Terms
- Algorithm 647: Implementation and Relative Efficiency of Quasirandom Sequence Generators
Recommendations
Efficient Generation of Parallel Quasirandom Faure Sequences Via Scrambling
ICCS '07: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007Much of the recent work on parallelizing quasi-Monte Carlo methods has been aimed at splitting a quasirandom sequence into many subsequences which are then used independently on the various parallel processes. This method works well for the ...
Zero-Correlation Zone Sequence Set Constructed from a Perfect Sequence and a Complementary Sequence Pair
The present paper introduces the construction of a class of sequence sets with zero-correlation zones called zero-correlation zone sequence sets. The proposed zero-correlation zone sequence set can be generated from an arbitrary perfect sequence and an ...
Quasirandom Number Generators for Parallel Monte Carlo Algorithms
A method for generating sequences of quasirandom numbers allows conventional serial Monte Carlo algorithms to be parallelized using a leapfrog scheme. Specifically, a Sobol' sequence can be broken up into interleaved subsets; with each processing node ...
Comments