Constructions of general polynomial lattice rules based on the weighted star discrepancy
From MaRDI portal
Publication:2467335
Recommendations
- The construction of extensible polynomial lattice rules with small weighted star discrepancy
- Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy
- A reduced fast construction of polynomial lattice point sets with low weighted star discrepancy
- On the component by component construction of polynomial lattice point sets for numerical integration in weighted Sobolev spaces
- Constructions of general polynomial lattices for multivariate integration
Cites work
- scientific article; zbMATH DE number 3153486 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 1246221 (Why is no real title available?)
- scientific article; zbMATH DE number 2051209 (Why is no real title available?)
- scientific article; zbMATH DE number 2051215 (Why is no real title available?)
- scientific article; zbMATH DE number 3440485 (Why is no real title available?)
- Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy
- Construction algorithms for polynomial lattice rules for multivariate integration
- 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
- Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points
- Fast component-by-component construction, a reprise for different kernels
- 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
- On Korobov Lattice Rules in Weighted Spaces
- Optimal Polynomials for (T,M,S)-Nets and Numerical Integration of Multivariate Walsh Series
- Point sets and sequences with small discrepancy
- Randomized Polynomial Lattice Rules for Multivariate Integration and Simulation
- Reducing the construction cost of the component-by-component construction of good lattice rules
- Sequences, discrepancies and applications
- The construction of extensible polynomial lattice rules with small weighted star discrepancy
- The existence of good extensible polynomial lattice rules
- The existence of good extensible rank-1 lattices
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
Cited in
(15)- On the existence of higher order polynomial lattices based on a generalized figure of merit
- Construction schemes for weighted lattice rules
- Construction algorithms for polynomial lattice rules for multivariate integration
- scientific article; zbMATH DE number 5532056 (Why is no real title available?)
- On the Behavior of the Weighted Star Discrepancy Bounds for Shifted Lattice Rules
- A lower bound on a quantity related to the quality of polynomial lattices
- A reduced fast construction of polynomial lattice point sets with low weighted star discrepancy
- The construction of extensible polynomial lattice rules with small weighted star discrepancy
- Construction of scrambled polynomial lattice rules over \(\mathbb{F}_{2}\) with small mean square weighted \(\mathcal{L}_{2}\) discrepancy
- Discrepancy of higher rank polynomial lattice point sets
- Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy
- Component-by-component digit-by-digit construction of good polynomial lattice rules in weighted Walsh spaces
- Discrepancy theory and quasi-Monte Carlo integration
- Tractability properties of the weighted star discrepancy of regular grids
- scientific article; zbMATH DE number 2051222 (Why is no real title available?)
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)
