Lattice Rules: How Well Do They Measure Up?
A simple, but often effective, way to approximate an integral over the s-dimensional unit cube is to take the average of the integrand over some set P of N points. Monte Carlo methods choose P randomly and typically obtain an error of 0(N-1/2). Quasi-Monte Carlo methods attempt to decrease the error by choosing P in a deterministic (or quasi-random) way so that the points are more uniformly spread over the integration domain.
Unable to display preview. Download preview PDF.
- [AS64]M. Abramowitz and I. A. Stegun (eds.), Handbook of mathematical functions with formulas, graphs and mathematical tables, U. S. Government Printing Office, Washington, DC, 1964.Google Scholar
- [CMO97]R. E. Caflisch, W. Morokoff, and A. Owen, Valuation of mortgage backed securities using Brownian bridges to reduce effective dimension, J. Comput. Finance 1 (1997), 27–46.Google Scholar
- [HH97]F. J. Hickernell and H. S. Hong, Computing multivariate normal probabilities using rank-1 lattice sequences, Proceedings of the Workshop on Scientific Computing (Hong Kong) (G. H. Golub, S. H. Lui, F. T. Luk, and R. J. Plemmons, eds.), Springer-Verlag, Singapore, 1997, pp. 209–215.Google Scholar
- [HH98]F. J. Hickernell and H. S. Hong, The asymptotic efficiency of randomized nets for quadrature, Math. Comp. 67 (1998), to appear.Google Scholar
- [Hic95]F. J. Hickernell, A comparison of random and quasirandom points for multidimensional quadrature, Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing (H. Niederreiter and P. J.-S. Shiue, eds.), Lecture Notes in Statistics, vol. 106, Springer-Verlag, New York, 1995, pp. 213–227.Google Scholar
- [Owe95]A. B. Owen, Randomly permuted (t, m, s)-nets and (t, s)-sequences, Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing (H. Niederreiter and P. J.-S. Shiue, eds.), Lecture Notes in Statistics, vol. 106, Springer-Verlag, New York, 1995, pp. 299–317.Google Scholar
- [PT96]A. Papageorgiou and J. F. Traub, Beating monte carlo, Risk 9 (1996), no. 6, 63–65.Google Scholar
- [Rit95]K. Ritter, Average case analysis of numerical problems, Ph.D.thesis, Universität Erlangen-Nürnberg, Erlangen, Germany, 1995.Google Scholar
- [Sob69]I. M. Sobol’, Multidimensional quadrature formulas and Haar functions (in Russian), Izdat. “Nauka”, Moscow, 1969.Google Scholar