Remark on algorithm 659: Implementing Sobol's quasirandom sequence generator
ACM Transactions on Mathematical Software (TOMS)
Journal of Complexity
Finite-order weights imply tractability of multivariate integration
Journal of Complexity
On the convergence rate of the component-by-component construction of good lattice rules
Journal of Complexity
Journal of Complexity
Quasi-Monte Carlo methods can be efficient for integration over products of spheres
Journal of Complexity
Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points
Journal of Complexity - Special issue: Algorithms and complexity for continuous problems Schloss Dagstuhl, Germany, September 2004
Randomly shifted lattice rules on the unit cube for unbounded integrands in high dimensions
Journal of Complexity - Special issue: Algorithms and complexity for continuous problems Schloss Dagstuhl, Germany, September 2004
Randomized Quasi-Monte Carlo: a tool for improving the efficiency of simulations in finance
WSC '04 Proceedings of the 36th conference on Winter simulation
Randomly shifted lattice rules for unbounded integrands
Journal of Complexity - Special issue: Information-based complexity workshops FoCM conference Santander, Spain, July 2005
Lattice rule algorithms for multivariate approximation in the average case setting
Journal of Complexity
Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points
Journal of Complexity - Special issue: Algorithms and complexity for continuous problems Schloss Dagstuhl, Germany, September 2004
Randomly shifted lattice rules on the unit cube for unbounded integrands in high dimensions
Journal of Complexity - Special issue: Algorithms and complexity for continuous problems Schloss Dagstuhl, Germany, September 2004
Journal of Complexity
Dimension-wise integration of high-dimensional functions with applications to finance
Journal of Complexity
Quasi-Monte Carlo methods for elliptic PDEs with random coefficients and applications
Journal of Computational Physics
Weighted compound integration rules with higher order convergence for all N
Numerical Algorithms
Hi-index | 0.01 |
Shifted rank-1 lattice rules, a special class of quasi-Monte Carlo methods, have recently been proposed by the present authors for the integration of functions belonging to certain "weighted" Sobolev spaces. The shifts in these rules were generated in a deterministic manner. In contrast, in this paper we generate these shifts randomly. This allows probabilistic estimates for the error in a given integral. It also reduces the number of operations required to find the generating vectors for the underlying lattice rules component-by-component. The rules thus constructed achieve a worst-case strong tractability error bound in an average or probabilistic sense.