Irreducible Sobol’ sequences in prime power bases
From MaRDI portal
Publication:2804252
DOI10.4064/aa8226-1-2016zbMath1347.11059OpenAlexW2587036098MaRDI QIDQ2804252
Henri Faure, Christiane Lemieux
Publication date: 28 April 2016
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/aa8226-1-2016
Irregularities of distribution, discrepancy (11K38) General theory of distribution modulo (1) (11K06)
Related Items (3)
Comparison of Sobol' sequences in financial applications ⋮ A Universal Median Quasi-Monte Carlo Integration ⋮ Implementation of irreducible Sobol' sequences in prime power bases
Uses Software
Cites Work
- Constructing Sobol Sequences with Better Two-Dimensional Projections
- New star discrepancy bounds for \((t,m,s)\)-nets and \((t,s)\)-sequences
- Point sets and sequences with small discrepancy
- On the exact \(t\)-value of Niederreiter and Sobol' sequences
- Revisiting Gauss's analogue of the prime number theorem for polynomials over a finite field
- Low-discrepancy and low-dispersion sequences
- Low-discrepancy sequences and global function fields with many rational places
- A construction of \((t,s)\)-sequences with finite-row generating matrices using global function fields
- A construction of low-discrepancy sequences involving finite-row digital \((t,s)\)-sequences
- On the discrepancy of generalized Niederreiter sequences
- Improved upper bounds on the star discrepancy of \((t,m,s)\)-nets and \((t,s)\)-sequences
- A variant of Atanassov's method for \((t, s)\)-sequences and \((t, \mathbf{e}, s)\)-sequences
- New Perspectives on (0,s)-Sequences
- Algorithm 659
- Polynomial arithmetic analogue of Halton sequences
- Implementation and tests of low-discrepancy sequences
- Remark on algorithm 659
- Unnamed Item
- Unnamed Item
This page was built for publication: Irreducible Sobol’ sequences in prime power bases
