Scrambled Soboĺ sequences via permutation
From MaRDI portal
Publication:3405599
Recommendations
Cites work
- An economic method of computing LPτ-sequences
- On the \(L_2\)-discrepancy for anchored boxes
- On the distribution of points in a cube and the approximate evaluation of integrals
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- Quasi-Monte Carlo methods and pseudo-random numbers
- Quasi-Random Sequences and Their Discrepancies
Cited in
(9)- On Dropping the First Sobol’ Point
- Computational Science – ICCS 2005
- A note on scrambling permutations
- Good permutations for deterministic scrambled Halton sequences in terms of L₂-discrepancy
- Tuning the generation of Sobol sequence with Owen scrambling
- scientific article; zbMATH DE number 1969616 (Why is no real title available?)
- Computational investigations of scrambled Faure sequences
- A Finite-Row Scrambling of Niederreiter Sequences
- scientific article; zbMATH DE number 1790437 (Why is no real title available?)
This page was built for publication: Scrambled Soboĺ sequences via permutation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3405599)