On a reduced component-by-component digit-by-digit construction of lattice point sets
DOI10.2478/udt-2023-0007zbMath1520.65014arXiv2211.12237OpenAlexW4385730060MaRDI QIDQ6169856
Onyekachi Osisiogu, Peter Kritzer
Publication date: 15 August 2023
Published in: Uniform Distribution Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.12237
numerical integrationlattice pointsweighted function spacesquasi-Monte Carlo methodscomponent-by-component constructionfast implementationdigit-by-digit construction
Monte Carlo methods (65C05) Multidimensional problems (41A63) Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32) Numerical integration (65D30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions
- A reduced fast component-by-component construction of lattice points for integration in weighted spaces with fast decreasing weights
- Zur angenäherten Berechnung mehrfacher Integrale
- On the convergence rate of the component-by-component construction of good lattice rules
- Tractability of multivariate problems. Volume I: Linear information
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Tractability of multivariate integration for weighted Korobov classes
- The existence of good extensible rank-1 lattices
- Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
- Lattice rules in non-periodic subspaces of Sobolev spaces
- Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness
- Stability of lattice rules and polynomial lattice rules constructed by the component-by-component algorithm
- Lattice rules for nonperiodic smooth integrands
- A note on the CBC-DBD construction of lattice rules with general positive weights
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- A generalized discrepancy and quadrature error bound
- Lattice Rules
- High-dimensional integration: The quasi-Monte Carlo way
This page was built for publication: On a reduced component-by-component digit-by-digit construction of lattice point sets
