Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel hilbert spaces

Mathematics of Computation

Volumn 75, Issue 254, 2006, Pages 903-920

  Nuyens, Dirk ^a   Cools, Ronald ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Component by component construction; Fast algorithms; Numerical integration; Quasi Monte Carlo; Rank 1 lattice rules

Indexed keywords

EID: 33646385879     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-06-01785-6     Document Type: Article

References (13)

1. Milton Abramowitz and Irene A. Stegun (eds.), Handbook of mathematical functions with formulas, graphs and mathematical tables, National Bureau of Standards Applied Mathematics Series, vol. 55, U.S. Government Printing Office, Washington, D.C., 1964. MR0167642 (29:4914)
2. Josef Dick and Frances Kuo, Constructing good lattice rules with millions of points, Monte-Carlo and quasi-Monte Carlo Methods - 2002 (Harald Niederreiter, ed.), Springer-Verlag, January 2004, pp. 181-197. MR2076933
3. _, Reducing the construction cost of the component-by-component construction of good lattice rules, Mathematics of Computation 73 (2004), 1967-1988. MR2059746 (2005b:65021).
4. Josef Dick, Ian H. Sloan, Xiaoqun Wang, and Henryk Woźniakowski, Liberating the weights, Journal of Complexity 20 (2004), no. 5, 593-623. MR2086942
5. Matteo Frigo and Steven G. Johnson, FFTW: An adaptive software architecture for the FFT, Proc. 1998 IEEE Intl. Conf. Acoustics Speech and Signal Processing, Vol. 3, IEEE, 1998, pp. 1381-1384.
6. Gene H. Golub and Charles F. Van Loan, Matrix computations, third ed., Studies in the Mathematical Sciences, Johns Hopkins University Press, 1996. MR1417720 (97g:65006)
7. Fred J. Hickernell, Lattice rules: How well do they measure up?, Random and Quasi-Random Point Sets (P. Hellekalek and G. Larcher, eds.), Springer-Verlag, 1998, pp. 109-166. MR1662841 (2000b:65007)
8. Frances Kuo, Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces, Journal of Complexity 19 (2003), 301-320. MR1984116 (2004c:41066)
9. Dirk Nuyens and Ronald Cools, Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces, Report TW392, Dept. of Computer Science, K.U.Leuven, May 2004.
10. Charles M. Rader, Discrete Fourier transforms when the number of data samples is prime, Proc. IEEE 5 (1968), 1107-1108.
11. Ian H. Sloan, Frances Kuo, and Stephen Joe, Constructing randomly shifted lattice rules in weighted Sobolev spaces, SIAM Journal on Numerical Analysis 40 (2002), no. 5, 1650-1665. MR1950616 (2003m:65031)
12. Ian H. Sloan and Andrew V. Reztsov, Component-by-component construction of good lattice rules, Mathematics of Computation 71 (2002), no. 237, 263-273. MR1862999 (2002h:65028)
13. Charles F. Van Loan, Computational frameworks for the fast Fourier transform, Frontiers in Applied Mathematics, vol. 10, SIAM, 1992. MR1153025 (93a:65186)