A lower bound on a quantity related to the quality of polynomial lattices

DOI10.7169/facm/1317045237zbMath1247.11097MaRDI 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

zbMATH Keywords

digital nets; star discrepancy; polynomial lattices

Mathematics Subject Classification ID

11K38: Irregularities of distribution, discrepancy

11K06: General theory of distribution modulo (1)

Related Items

Discrepancy Theory and Quasi-Monte Carlo Integration, Low discrepancy polynomial lattice point sets

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