Polynomial Lattice Point Sets

DOI10.1007/978-3-642-27440-4_8zbMath1294.11129OpenAlexW2224375053MaRDI QIDQ5326105

Friedrich Pillichshammer

Publication date: 31 July 2013

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-27440-4_8

zbMATH Keywords

numerical integrationdiscrepancyquasi-Monte Carlo methodlattice point setPolynomial lattice point set

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Irregularities of distribution, discrepancy (11K38) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (9)

Construction of interlaced polynomial lattice rules for infinitely differentiable functions ⋮ Construction of scrambled polynomial lattice rules over \(\mathbb{F}_{2}\) with small mean square weighted \(\mathcal{L}_{2}\) discrepancy ⋮ Construction-Free Median Quasi-Monte Carlo Rules for Function Spaces with Unspecified Smoothness and General Weights ⋮ Component-by-component construction of randomized rank-1 lattice rules achieving almost the optimal randomized error rate ⋮ Vandermonde Nets and Vandermonde Sequences ⋮ A Universal Median Quasi-Monte Carlo Integration ⋮ A reduced fast component-by-component construction of lattice points for integration in weighted spaces with fast decreasing weights ⋮ Good interlaced polynomial lattice rules for numerical integration in weighted Walsh spaces ⋮ Discrepancy Theory and Quasi-Monte Carlo Integration

This page was built for publication: Polynomial Lattice Point Sets