Implementation of irreducible Sobol sequences in prime power bases
classification
🧮 math.NA
cs.NA
keywords
sequencesimplementationimplementationsirreduciblesearchsobolapproachesbases
read the original abstract
We present different implementations for the irreducible Sobol (IS) sequences introduced in [3]. For this purpose we retain two strategies: first we use the connection between IS and Niederreiter sequences to provide a very simple implementation requiring no computer search; then we use criteria measuring the equidistribution to search for good parameters. Numerical results comparing these IS sequences to known implementations show promise for the proposed approaches.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.