Pages that link to "Item:Q580423"
From MaRDI portal
The following pages link to Point sets and sequences with small discrepancy (Q580423):
Displaying 50 items.
- Mixed orthogonal arrays, \((u,m,\mathbf{e},s)\)-nets, and \((u,\mathbf{e},s)\)-sequences (Q297905) (← links)
- Optimal quasi-Monte Carlo rules on order 2 digital nets for the numerical integration of multivariate periodic functions (Q304528) (← links)
- Low-discrepancy sampling for approximate dynamic programming with local approximators (Q336896) (← links)
- A search for extensible low-WAFOM point sets (Q350301) (← links)
- New star discrepancy bounds for \((t,m,s)\)-nets and \((t,s)\)-sequences (Q372815) (← links)
- A construction of digital \((0,s)\)-sequences involving finite-row generator matrices (Q413562) (← links)
- A characterization of strong orthogonal arrays of strength three (Q464184) (← links)
- Discrepancy estimates for index-transformed uniformly distributed sequences (Q466165) (← links)
- On the \(L_p\) discrepancy of two-dimensional folded Hammersley point sets (Q477324) (← links)
- Tractability using periodized generalized Faure sequences (Q478997) (← links)
- Cubic and higher degree bounds for codes and \((t,m,s)\)-nets (Q543422) (← links)
- Construction algorithms for higher order polynomial lattice rules (Q544121) (← links)
- Duality theory and propagation rules for higher order nets (Q626792) (← links)
- Extensible hyperplane nets (Q640003) (← links)
- The triple distribution of codes and ordered codes (Q641207) (← links)
- A lower bound on a quantity related to the quality of polynomial lattices (Q644313) (← links)
- A construction of polynomial lattice rules with small gain coefficients (Q644778) (← links)
- Wei-type duality theorems for matroids (Q664380) (← links)
- The Halton sequence and its discrepancy in the Cantor expansion (Q682115) (← links)
- A higher order Blokh-Zyablov propagation rule for higher order nets (Q690427) (← links)
- On the \(L_2\)-discrepancy of the Sobol-Hammersley net in dimension 3 (Q700170) (← links)
- Duality for digital sequences (Q731970) (← links)
- Bounds on the discrepancy of linear recurring sequences over Galois rings (Q783107) (← links)
- Construction algorithms for good extensible lattice rules (Q843720) (← links)
- Spline methods using integration lattices and digital nets (Q843727) (← links)
- MacWilliams-type identities for fragment and sphere enumerators (Q854830) (← links)
- Weight distribution of the crown-weight space (Q854839) (← links)
- On the mean square weighted \(\mathcal {L}_2\) discrepancy of randomized digital nets in prime base (Q855890) (← links)
- The tent transformation can improve the convergence rate of quasi-Monte Carlo algorithms using digital nets (Q861659) (← links)
- The covering problem in Rosenbloom-Tsfasman spaces (Q888588) (← links)
- From van der Corput to modern constructions of sequences for quasi-Monte Carlo rules (Q898073) (← links)
- A survey of some applications of finite fields (Q908045) (← links)
- Finite field constructions of combinatorial arrays (Q908047) (← links)
- Statistical independence properties of pseudorandom vectors produced by matrix generators (Q920538) (← links)
- Using permutations to reduce discrepancy (Q921848) (← links)
- On a simple quasi-Monte Carlo approach for classical ultimate ruin probabilities (Q931177) (← links)
- Dyadic diaphony of digital sequences (Q933206) (← links)
- On the connectedness of limit net sets (Q946606) (← links)
- On the exact \(t\)-value of Niederreiter and Sobol' sequences (Q958245) (← links)
- Quasi-Monte Carlo methods with applications in finance (Q964676) (← links)
- New explicit bounds for ordered codes and \((t,m,s)\)-nets (Q965983) (← links)
- MinT-architecture and applications of the \((t, m, s)\)-net and OOA database (Q974248) (← links)
- On the distribution properties of Niederreiter-Halton sequences (Q999723) (← links)
- Constructions and bounds on linear error-block codes (Q1008949) (← links)
- Maximum distance separable poset codes (Q1009045) (← links)
- A simple derivation of the MacWilliams identity for linear ordered codes and orthogonal arrays (Q1009110) (← links)
- What Monte Carlo models can do and cannot do efficiently? (Q1031571) (← links)
- Commutative association schemes (Q1039424) (← links)
- On the approximation of smooth functions using generalized digital nets (Q1049399) (← links)
- Low-discrepancy and low-dispersion sequences (Q1106264) (← links)
