Good Lattice Rules in Weighted Korobov Spaces with General Weights
We study the problem of multivariate integration and the construction of good lattice rules in weighted Korobov spaces with general weights. These spaces are not necessarily tensor products of spaces of univariate functions. Sufficient conditions for tractability and strong tractability of multivariate integration in such weighted function spaces are found. These conditions are also necessary if the weights are such that the reproducing kernel of the weighted Korobov space is pointwise non-negative. The existence of a lattice rule which achieves the nearly optimal convergence order is proven. A component-by-component (CBC) algorithm that constructs good lattice rules is presented. The resulting lattice rules achieve tractability or strong tractability error bounds and achieve nearly optimal convergence order for suitably decaying weights. We also study special weights such as finite-order and order-dependent weights. For these special weights, the cost of the CBC algorithm is polynomial. Numerical computations show that the lattice rules constructed by the CBC algorithm give much smaller worst-case errors than the mean worst-case errors over all quasi-Monte Carlo rules or over all lattice rules, and generally smaller worst-case errors than the best Korobov lattice rules in dimensions up to hundreds. Numerical results are provided to illustrate the efficiency of CBC lattice rules and Korobov lattice rules (with suitably chosen weights), in particular for high-dimensional finance problems.
KeywordsQuasi-Monte Carlo methods lattice rules multivariate integration
Mathematics Subject Classification (2000)65C05 65D30 65D32
Unable to display preview. Download preview PDF.
- 1.Acworth, P., Broadie M., Glasserman, P.: A comparison of some Monte Carlo and quasi-Monte Carlo techniques for option pricing. In: Hellekallek, P., Niederreiter H. (eds) Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing. Spring-Verlag, pp 1–18, 1997Google Scholar
- 2.Brown, G., Chandler, G.A., Sloan, I.H., Wilson, D.C.: Properties of certain trigonometric series arising in numerical analysis. J. Math. Anal. Appl. 371–380 (1991)Google Scholar
- 3.Caflisch, R.E., Morokoff, W., Owen, A.B.: Valuation of Mortgage backed securities using Brownian bridges to reduce effective dimension. J. Comp. Finance 1, 27–46 (1997)Google Scholar
- 10.Niederreiter, H.: Random Number Generation and Quasi-Monte Carlo Methods. Philadelphia: SIAM, 1992Google Scholar
- 12.Sloan, I.H., Joe, S.: Lattice Methods for Multiple Integration. Oxford: Oxford University Press, 1994Google Scholar
- 18.Traub, J.F., Wasilkowski, G.W., Woźniakowski, H.: Information-Based Complexity. New York: Academic Press, 1988Google Scholar
- 21.Wang, X., Sloan, I.: Efficient weighted lattice rules with application to finance. SIAM J. Sci. Comput. (to appear)Google Scholar