Constructions of general polynomial lattice rules based on the weighted star discrepancy

DOI10.1016/J.FFA.2006.09.001zbMATH Open1132.11039OpenAlexW2169465938MaRDI QIDQ2467335FDOQ2467335

Peter Kritzer, Josef Dick, Gunther Leobacher, Friedrich Pillichshammer

Publication date: 21 January 2008

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2006.09.001

zbMATH Keywords

digital netsweighted star discrepancypolynomial lattice rule

Mathematics Subject Classification ID

General theory of distribution modulo (1) (11K06) Pseudo-random numbers; Monte Carlo methods (11K45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sequences, discrepancies and applications
• When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
• Low-discrepancy point sets obtained by digital constructions over finite fields
• Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces
• Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points
• Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
• Point sets and sequences with small discrepancy
• Construction algorithms for polynomial lattice rules for multivariate integration
• Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy
• Reducing the construction cost of the component-by-component construction of good lattice rules
• The existence of good extensible rank-1 lattices
• The construction of extensible polynomial lattice rules with small weighted star discrepancy
• The existence of good extensible polynomial lattice rules
• Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences
• Randomized Polynomial Lattice Rules for Multivariate Integration and Simulation
• Optimal Polynomials for (T,M,S)-Nets and Numerical Integration of Multivariate Walsh Series
• On Korobov Lattice Rules in Weighted Spaces

Cited In (8)

• Title not available (Why is that?)
• Discrepancy Theory and Quasi-Monte Carlo Integration
• A lower bound on a quantity related to the quality of polynomial lattices
• Component-by-component digit-by-digit construction of good polynomial lattice rules in weighted Walsh spaces
• The construction of extensible polynomial lattice rules with small weighted star discrepancy
• On the Behavior of the Weighted Star Discrepancy Bounds for Shifted Lattice Rules
• Title not available (Why is that?)
• Tractability properties of the weighted star discrepancy of regular grids

This page was built for publication: Constructions of general polynomial lattice rules based on the weighted star discrepancy

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