A lower bound on a quantity related to the quality of polynomial lattices
From MaRDI portal
Publication:644313
DOI10.7169/facm/1317045237zbMath1247.11097OpenAlexW2061794678MaRDI QIDQ644313
Peter Kritzer, Friedrich Pillichshammer
Publication date: 3 November 2011
Published in: Functiones et Approximatio. Commentarii Mathematici (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.facm/1317045237
Irregularities of distribution, discrepancy (11K38) General theory of distribution modulo (1) (11K06)
Related Items (2)
Low discrepancy polynomial lattice point sets ⋮ Discrepancy Theory and Quasi-Monte Carlo Integration
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Point sets and sequences with small discrepancy
- Sequences, discrepancies and applications
- On the distribution of sequences connected with good lattice points
- A best lower bound for good lattice points
- Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces
- Constructions of general polynomial lattice rules based on the weighted star discrepancy
- Low-discrepancy point sets obtained by digital constructions over finite fields
- Randomized Polynomial Lattice Rules for Multivariate Integration and Simulation
- Optimal Polynomials for (T,M,S)-Nets and Numerical Integration of Multivariate Walsh Series
- Construction algorithms for polynomial lattice rules for multivariate integration
- Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy
This page was built for publication: A lower bound on a quantity related to the quality of polynomial lattices
