Variance bounds and existence results for randomly shifted lattice rules
From MaRDI portal
Publication:421840
DOI10.1016/j.cam.2012.02.034zbMath1264.65005OpenAlexW2036346468MaRDI QIDQ421840
Vasile Sinescu, Pierre L'Ecuyer
Publication date: 14 May 2012
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2012.02.034
Monte Carlo methods (65C05) Numerical quadrature and cubature formulas (65D32) Analysis of variance and covariance (ANOVA) (62J10) Numerical integration (65D30) Irregularities of distribution, discrepancy (11K38)
Related Items (3)
Random weights, robust lattice rules and the geometry of the \(cbcrc\) algorithm ⋮ A Tool for Custom Construction of QMC and RQMC Point Sets ⋮ Variance reduction with array-RQMC for tau-leaping simulation of stochastic biological and chemical reaction networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Existence and construction of shifted lattice rules with an arbitrary number of points and bounded weighted star discrepancy for general decreasing weights
- On the convergence rate of the component-by-component construction of good lattice rules
- Quasi-Monte Carlo methods with applications in finance
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
- Component-by-component construction of good lattice rules with a composite number of points
- Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points
- Good lattice rules in weighted Korobov spaces with general weights
- Approximate formulas for some functions of prime numbers
- Error bounds for rank 1 lattice quadrature rules modulo composites
- Variance Reduction via Lattice Rules
- Staffing Multiskill Call Centers via Linear Programming and Simulation
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- On the Behavior of the Weighted Star Discrepancy Bounds for Shifted Lattice Rules
- Good lattice rules based on the general weighted star discrepancy
- On Figures of Merit for Randomly-Shifted Lattice Rules
- Constructing Embedded Lattice Rules for Multivariate Integration
- Monte Carlo estimators for small sensitivity indices
- Efficient Weighted Lattice Rules with Applications to Finance
- Estimating Mean Dimensionality of Analysis of Variance Decompositions
This page was built for publication: Variance bounds and existence results for randomly shifted lattice rules
