Constructions of general polynomial lattice rules based on the weighted star discrepancy
From MaRDI portal
Publication:2467335
DOI10.1016/j.ffa.2006.09.001zbMath1132.11039OpenAlexW2169465938MaRDI QIDQ2467335
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
General theory of distribution modulo (1) (11K06) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (3)
A lower bound on a quantity related to the quality of polynomial lattices ⋮ The construction of extensible polynomial lattice rules with small weighted star discrepancy ⋮ Discrepancy Theory and Quasi-Monte Carlo Integration
Cites Work
- 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
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- The existence of good extensible rank-1 lattices
- The existence of good extensible polynomial lattice rules
- 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
- Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- The construction of extensible polynomial lattice rules with small weighted star discrepancy
- Low-discrepancy point sets obtained by digital constructions over finite fields
- Randomized Polynomial Lattice Rules for Multivariate Integration and Simulation
- On Korobov Lattice Rules in Weighted Spaces
- Reducing the construction cost of the component-by-component construction of good lattice rules
- 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: Constructions of general polynomial lattice rules based on the weighted star discrepancy
