Random number generation and quasi-Monte Carlo methods
Random number generation and quasi-Monte Carlo methods
A generalized discrepancy and quadrature error bound
Mathematics of Computation
When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
Journal of Complexity
Component-by-component construction of good lattice rules
Mathematics of Computation
A constructive approach to strong tractability using Quasi-Monte Carlo algorithms
Journal of Complexity
The effective dimension and quasi-Monte Carlo integration
Journal of Complexity
Journal of Complexity
Open problems for tractability of multivariate integration
Journal of Complexity
I-binomial scrambling of digital nets and sequences
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
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
Randomly shifted lattice rules for unbounded integrands
Journal of Complexity - Special issue: Information-based complexity workshops FoCM conference Santander, Spain, July 2005
Weighted intermediate rank lattice rules with applications in finance
MOAS'07 Proceedings of the 18th conference on Proceedings of the 18th IASTED International Conference: modelling and simulation
Low discrepancy sequences in high dimensions: How well are their projections distributed?
Journal of Computational and Applied Mathematics
Lattice rule algorithms for multivariate approximation in the average case setting
Journal of Complexity
Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Intermediate rank lattice rules and applications to finance
Applied Numerical Mathematics
Shifted lattice rules based on a general weighted discrepancy for integrals over Euclidean space
Journal of Computational and Applied Mathematics
Weighted intermediate rank lattice rules with applications in finance
MS '07 The 18th IASTED International Conference on Modelling and Simulation
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
Hi-index | 0.00 |
We develop and justify an algorithm for the construction of quasi-Monte Carlo (QMC) rules for integration in weighted Sobolev spaces; the rules so constructed are shifted rank-1 lattice rules. The parameters characterising the shifted lattice rule are found "component-by-component": the (d+1)-th component of the generator vector and the shift are obtained by successive 1-dimensional searches, with the previous d components kept unchanged. The rules constructed in this way are shown to achieve a strong tractability error bound in weighted Sobolev spaces. A search for n-point rules with n prime and all dimensions 1 to d requires a total cost of O(n3d2) operations. This may be reduced to O(n3d) operations at the expense of O(n2) storage. Numerical values of parameters and worst-ease errors are given for dimensions up to 40 and n up to a few thousand. The worst-case errors for these rules are found to be much smaller than the theoretical bounds.