The following pages link to (Q5482377):
Displayed 17 items.
- Construction of scrambled polynomial lattice rules over \(\mathbb{F}_{2}\) with small mean square weighted \(\mathcal{L}_{2}\) discrepancy (Q398623) (← links)
- A construction of polynomial lattice rules with small gain coefficients (Q644778) (← links)
- Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules (Q664602) (← links)
- Construction of interlaced scrambled polynomial lattice rules of arbitrary high order (Q887154) (← links)
- On a projection-corrected component-by-component construction (Q895985) (← links)
- Numerical integration in log-Korobov and log-cosine spaces (Q907580) (← links)
- Random weights, robust lattice rules and the geometry of the \(cbcrc\) algorithm (Q1938427) (← links)
- Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition (Q2016136) (← links)
- Constructing good higher order polynomial lattice rules with modulus of reduced degree (Q2254684) (← links)
- Good interlaced polynomial lattice rules for numerical integration in weighted Walsh spaces (Q2345667) (← links)
- Proof techniques in quasi-Monte Carlo theory (Q2347957) (← links)
- Fast construction of higher order digital nets for numerical integration in weighted Sobolev spaces (Q2351489) (← links)
- Constructions of general polynomial lattice rules based on the weighted star discrepancy (Q2467335) (← links)
- Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points (Q2489147) (← links)
- Fast QMC Matrix-Vector Multiplication (Q5254809) (← links)
- Constructions of general polynomial lattices for multivariate integration (Q5756325) (← links)
- Digital nets with infinite digit expansions and construction of folded digital nets for quasi-Monte Carlo integration (Q5963451) (← links)