Coarse Scrambling for Sobol’ and Niederreiter Sequences
SIAM Journal on Numerical Analysis · 31.08.2026 · 64 (4) · 1342-1363
DOI: 10.1137/25m1807514 ↗Kurz gefasst
Fachartikel in der Zeitschrift SIAM Journal on Numerical Analysis, online erschienen am 15.07.2026. Verfasst von Kosuke Suzuki. Die Arbeit nennt 31 Literaturangaben. Gefördert von: Japan Society for the Promotion of Science.
Abstract (Originalsprache)
We introduce coarse scrambling, a novel randomization for digital sequences that permutes blocks of digits in a mixed-radix representation. This construction is designed to preserve the powerful [Formula: see text]-sequence property of the underlying points. For sufficiently smooth integrands, we prove that this method achieves the canonical [Formula: see text] variance decay rate, matching that of standard Owen’s scrambling. Crucially, we show that its maximal gain coefficient grows only logarithmically with dimension [Formula: see text], thus providing theoretical robustness against the curse of dimensionality affecting scrambled Sobol’ sequences. Numerical experiments validate these findings and illustrate a practical trade-off: while Owen’s scrambling is superior for integrands sensitive to low-dimensional projections, coarse scrambling is competitive for functions with low effective truncation dimension.
Förderung
- Japan Society for the Promotion of Science
Zitieren
APA
Suzuki, K. (2026). Coarse Scrambling for Sobol’ and Niederreiter Sequences. SIAM Journal on Numerical Analysis, 64(4), 1342-1363. https://doi.org/10.1137/25m1807514
Vancouver
Suzuki K. Coarse Scrambling for Sobol’ and Niederreiter Sequences. SIAM Journal on Numerical Analysis. 2026;64(4):1342-1363. doi:10.1137/25m1807514
BibTeX
@article{Suzuki2026,
author = {Suzuki, Kosuke},
title = {Coarse Scrambling for Sobol’ and Niederreiter Sequences},
journal = {SIAM Journal on Numerical Analysis},
year = {2026},
volume = {64},
number = {4},
pages = {1342--1363},
doi = {10.1137/25m1807514}
}
EUVIMED