Math 2.0

Number theory Object

Sobol sequence

Builds on Low-discrepancy sequencePrimitive polynomial over a finite fieldQuasi-Monte Carlo method

Description

A Sobol sequence is a sequence of points in [0,1)s[0,1)^s built from binary digits. For each coordinate j=1,…,sj = 1, \ldots, s one fixes direction numbers vj,1,vj,2,…∈(0,1)v_{j,1}, v_{j,2}, \ldots \in (0,1), constructed as follows.

  1. Choose a primitive polynomial over 𝔽2\F_2 xd+c1xd−1+⋯+cd−1x+1x^{d} + c_1 x^{d-1} + \cdots + c_{d-1} x + 1 of degree d=djd = d_j, with different polynomials for different jj.
  2. Choose odd integers m1,…,mdm_1, \ldots, m_d with mk<2km_k < 2^k.
  3. For k>dk > d set mk=2c1mk−1⊕22c2mk−2⊕⋯⊕2d−1cd−1mk−d+1⊕2dmk−d⊕mk−dm_k = 2 c_1 m_{k-1} \oplus 2^2 c_2 m_{k-2} \oplus \cdots \oplus 2^{d-1} c_{d-1} m_{k-d+1} \oplus 2^d m_{k-d} \oplus m_{k-d}, where ⊕\oplus is the bitwise exclusive or of binary integers.
  4. Set vj,k=mk/2kv_{j,k} = m_k / 2^k.

Write n≥0n \ge 0 in binary as n=∑k≥1βk2k−1n = \sum_{k \ge 1} \beta_k 2^{k-1} with βk∈{0,1}\beta_k \in \set{0,1}. The jj-th coordinate of the nn-th point is xn,j=β1vj,1⊕β2vj,2⊕⋯ ,x_{n,j} = \beta_1 v_{j,1} \oplus \beta_2 v_{j,2} \oplus \cdots, where ⊕\oplus now acts digit by digit on binary expansions. The first coordinate usually takes v1,k=2−kv_{1,k} = 2^{-k}, which gives the van der Corput sequence in base 22.

Remarks

Take s=2s = 2, the van der Corput sequence in the first coordinate, and the polynomial x+1x + 1 with m1=1m_1 = 1 in the second. The recurrence gives mk=2mk−1⊕mk−1m_k = 2 m_{k-1} \oplus m_{k-1}, so m1,m2,m3=1,3,5m_1, m_2, m_3 = 1, 3, 5 and v2,k=1/2,3/4,5/8v_{2,k} = 1/2, 3/4, 5/8. The points for n=0,1,2,3n = 0, 1, 2, 3 are (0,0)(0,0), (1/2,1/2)(1/2, 1/2), (1/4,3/4)(1/4, 3/4), (3/4,1/4)(3/4, 1/4); for n=3n = 3 the second coordinate is 0.102⊕0.112=0.012=1/40.10_2 \oplus 0.11_2 = 0.01_2 = 1/4. Each of the four squares of side 1/21/2 contains exactly one of these points. So does each vertical strip of width 1/41/4 and each horizontal strip of height 1/41/4. In general Sobol sequences are (t,s)(t,s)-sequences in base 22 in the sense of Niederreiter, and their star discrepancy is O((log⁡N)s/N)O\big((\log N)^s / N\big). So they are low-discrepancy sequences, widely used in quasi-Monte Carlo methods. The quality of the points in practice depends on the choice of the initial numbers mkm_k. Because the construction uses only bit operations, the points are very fast to generate, especially in Gray code order.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Low-discrepancy sequence concept
  2. Primitive polynomial over a finite field concept
  3. Quasi-Monte Carlo method concept
  4. Sobol sequence object

Further reading

  1. Web https://en.wikipedia.org/wiki/Sobol_sequence
About this page
Tag4T7D0T5GJA
URIm2://4T7D0T5GJA
Kindobject
WritingW0 stub
MSC11K38, 11K45, 65C05
Instance ofLow-discrepancy sequence
UsesLow-discrepancy sequence, Primitive polynomial over a finite field, Quasi-Monte Carlo method
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.