A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Simulation on Rank-1 Lattices
[chapter]
2008
Monte Carlo and Quasi-Monte Carlo Methods 2006
Rank-1 lattices are available in any dimension for any number of lattice points and because their generation is so efficient, they often are used in quasi-Monte Carlo methods. Applying the Fourier transform to functions sampled on rank-1 lattice points turns out to be simple and efficient if the number of lattice points is a power of two. Considering the Voronoi diagram of a rank-1 lattice as a partition of the simulation domain and its dual, the Delauney tessellation, as a mesh for display and
doi:10.1007/978-3-540-74496-2_11
fatcat:jwaqkystavhh5nvy6nakrj6g5q