Low discrepancy polynomial lattice point sets

DOI10.1016/J.JNT.2012.05.006zbMATH Open1256.11042OpenAlexW2043964372MaRDI QIDQ452386FDOQ452386

Authors: Peter Kritzer, Friedrich Pillichshammer 

Publication date: 21 September 2012

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jnt.2012.05.006

Recommendations

• Polynomial lattice point sets
• Discrepancy of higher rank polynomial lattice point sets
• Polynomial discrepancy of sequences
• A reduced fast construction of polynomial lattice point sets with low weighted star discrepancy
• Low-discrepancy point sets

zbMATH Keywords

star discrepancypolynomial lattice point sets

Mathematics Subject Classification ID

Irregularities of distribution, discrepancy (11K38) General theory of distribution modulo (1) (11K06)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Minoration de la discrépance d'une suite quelconque sur T
• Title not available (Why is that?)
• Irregularities of distribution, VII
• On irregularities of distribution
• Low-discrepancy point sets obtained by digital constructions over finite fields
• On the small ball inequality in all dimensions
• Rational functions with partial quotients of small degree in their continued fraction expansion
• Nets obtained from rational functions over finite fields
• A lower bound on a quantity related to the quality of polynomial lattices

Cited In (14)

• Discrepancy of higher rank polynomial lattice point sets
• Construction of scrambled polynomial lattice rules over \(\mathbb{F}_{2}\) with small mean square weighted \(\mathcal{L}_{2}\) discrepancy
• On an example of finite hybrid quasi-Monte Carlo point sets
• An algorithm for QMC integration using low-discrepancy lattice sets
• A note on isotropic discrepancy and spectral test of lattice point sets
• Polynomial lattice point sets
• Constructing good higher order polynomial lattice rules with modulus of reduced degree
• A lower bound on a quantity related to the quality of polynomial lattices
• On Hybrid Point Sets Stemming from Halton-Type Hammersley Point Sets and Polynomial Lattice Point Sets
• Proof techniques in quasi-Monte Carlo theory
• Discrepancy theory and quasi-Monte Carlo integration
• Metrical lower bounds on the discrepancy of digital Kronecker-sequences
• Title not available (Why is that?)
• Low-discrepancy point sets obtained by digital constructions over finite fields

This page was built for publication: Low discrepancy polynomial lattice point sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452386)