Variations on \((0,s)\)-sequences

DOI10.1006/jcom.2001.0590zbMath0997.11060OpenAlexW2056138982MaRDI QIDQ1347853

Henri Faure

Publication date: 2 July 2002

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0eb4510242630a592eeca67820b8af4b15433982

zbMATH Keywords

survey\((t,s)\)-sequencesformal Laurent seriesconstructions of \((0,s)\)-sequences

Mathematics Subject Classification ID

Combinatorial probability (60C05) Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (6)

\(I\)-binomial scrambling of digital nets and sequences ⋮ Computational investigations of scrambled Faure sequences ⋮ The new scramble for Faure sequence based on irrational numbers ⋮ Density codes and shape spaces ⋮ Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences ⋮ New Modified Scrambled Faure Sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Point sets and sequences with small discrepancy
• Using permutations to reduce discrepancy
• Low-discrepancy and low-dispersion sequences
• Good permutations for extreme discrepancy
• Scrambled net variance for integrals of smooth functions
• Discrépance de suites associées à un système de numération (en dimension s)
• The asymptotic efficiency of randomized nets for quadrature
• The mean square discrepancy of randomized nets
• A note on polynomial arithmetic analogue of Halton sequences
• Polynomial arithmetic analogue of Halton sequences

This page was built for publication: Variations on \((0,s)\)-sequences