A randomized lattice rule without component-by-component construction
From MaRDI portal
Cites work
- A note on concatenation of quasi-Monte Carlo and plain Monte Carlo rules in high dimensions
- A randomised lattice rule algorithm with pre-determined generating vector and random number of points for Korobov spaces with \(0 < \alpha \le 1/2\)
- Component-by-component construction of good lattice rules
- Component-by-component construction of randomized rank-1 lattice rules achieving almost the optimal randomized error rate
- Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
- Construction-free median quasi-Monte Carlo rules for function spaces with unspecified smoothness and general weights
- Deterministic and stochastic error bounds in numerical analysis
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- Good lattice rules in weighted Korobov spaces with general weights
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 1790439 (Why is no real title available?)
- scientific article; zbMATH DE number 914714 (Why is no real title available?)
- Lattice Rules
- Lattice rules for nonperiodic smooth integrands
- Lattice rules in non-periodic subspaces of Sobolev spaces
- Lattice rules with random \(n\) achieve nearly the optimal \(\mathcal{O}(n^{-\alpha-1/2})\) error independently of the dimension
- On the convergence rate of the component-by-component construction of good lattice rules
- Random-prime-fixed-vector randomised lattice-based algorithm for high-dimensional integration
- Randomizing the trapezoidal rule gives the optimal RMSE rate in Gaussian Sobolev spaces
- Stability of lattice rules and polynomial lattice rules constructed by the component-by-component algorithm
- Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions
- 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?
Cited in
(2)
This page was built for publication: A randomized lattice rule without component-by-component construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6927795)
