A review of discrepancy bounds for (t, s) and (t, e, s)-sequences with numerical comparisons
From MaRDI portal
Publication:2229038
Recommendations
- A variant of Atanassov's method for \((t, s)\)-sequences and \((t, \mathbf{e}, s)\)-sequences
- Improvement on the discrepancy of \((t,{\mathbf e},s)\)-sequences
- Low-discrepancy sequences: Atanassov's methods revisited
- Improvements on the star discrepancy of (t,s)-sequences
- New star discrepancy bounds for \((t,m,s)\)-nets and \((t,s)\)-sequences
Cites work
- A construction of \((t,s)\)-sequences with finite-row generating matrices using global function fields
- A variant of Atanassov's method for \((t, s)\)-sequences and \((t, \mathbf{e}, s)\)-sequences
- Discrépance de suites associées à un système de numération (en dimension s)
- Extensions of Atanassov’s Methods for Halton Sequences
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 953226 (Why is no real title available?)
- scientific article; zbMATH DE number 2233281 (Why is no real title available?)
- Improved Halton sequences and discrepancy bounds
- Improved upper bounds on the star discrepancy of (t,m,s)-nets and (t,s)-sequences
- Improvements on the star discrepancy of (t,s)-sequences
- New perspectives on (0,s)-sequences
- New star discrepancy bounds for \((t,m,s)\)-nets and \((t,s)\)-sequences
- On Atanassov's methods for discrepancy bounds of low-discrepancy sequences
- On the discrepancy of generalized Niederreiter sequences
- On the distribution of points in a cube and the approximate evaluation of integrals
- Point sets and sequences with small discrepancy
- Polynomial arithmetic analogue of Halton sequences
Cited in
(5)- Low-discrepancy sequences: Atanassov's methods revisited
- Generalized Hofer-Niederreiter sequences and their discrepancy from an \((\boldsymbol{U}, \boldsymbol{e}, s)\)-point of view
- Discrepancy bounds for infinite-dimensional order two digital sequences over \(\mathbb F_2\)
- On the lower bound of the discrepancy of \((t, s)\) sequences. I
- Discrepancy of Digital Sequences: New Results on a Classical QMC Topic
This page was built for publication: A review of discrepancy bounds for \((t, s)\) and \((t, \mathbf{e}, s)\)-sequences with numerical comparisons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229038)