A randomised lattice rule algorithm with pre-determined generating vector and random number of points for Korobov spaces with 0 < 1/2
In this interesting paper, the authors study the approximation of the integral \(\int_{[0,1]^d}f(x)dx\) for multivariate functions belonging to a Krorobov function space with smoothness parameter \(0<\alpha\leq 1/2\). The results build on the earlier paper [\textit{F. Y. Kuo} et al., J. Complexity 79, Article ID 101785, 28 p. (2023; Zbl 1564.65034)] which dealt with the smoothness case of \(\alpha>1/2\).\N\NIn the latter paper, the authors proved that a lattice rule determined generating vector but with a random number of points gives for a fixed \(\varepsilon>0\), an optimal rate of \(O\left(n^{-\alpha-1/2+\varepsilon}\right)\) for the randomized error. In the paper under review, the authors prove that that a pre-determined generating vector exists in the case of \(0<\alpha\leq 1/2\) with near optimal convergence of \(O\left(n^{-\alpha-1/2+\varepsilon}\right)\) for a fixed \(\varepsilon>0\).\N\NFor the entire collection see [Zbl 1552.65006].
- A Monte Carlo method for integration of multivariate smooth functions
- A universal algorithm for multivariate integration
- An estimate of the mean remainder term in quadrature formulae
- Component-by-component construction of randomized rank-1 lattice rules achieving almost the optimal randomized error rate
- Construction-free median quasi-Monte Carlo rules for function spaces with unspecified smoothness and general weights
- Discrete calculus. Methods for counting
- Higher order scrambled digital nets achieve the optimal rate of the root mean square error for smooth integrands
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 822320 (Why is no real title available?)
- scientific article; zbMATH DE number 914714 (Why is no real title available?)
- Improved bounds on Bell numbers and on moments of sums of random variables
- Lattice Rules
- Lattice rules with random \(n\) achieve nearly the optimal \(\mathcal{O}(n^{-\alpha-1/2})\) error independently of the dimension
- Monte Carlo Variance of Scrambled Net Quadrature
- On the step-by-step construction of quasi--Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spaces
- Random-prime-fixed-vector randomised lattice-based algorithm for high-dimensional integration
- Scaled lattice rules for integration on \(\mathbb{R}^d\) achieving higher-order convergence with error analysis in terms of orthogonal projections onto periodic spaces
- Tractability of multivariate integration for weighted Korobov classes
- Tractability of multivariate problems. Volume I: Linear information
- Tractability of multivariate problems. Volume II: Standard information for functionals.
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
This page was built for publication: A randomised lattice rule algorithm with pre-determined generating vector and random number of points for Korobov spaces with \(0 < \alpha \le 1/2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7012102)
