Math 2.0

Number theory Concept

Low-discrepancy sequence

Summary

A low-discrepancy sequence is a sequence of points in the unit cube [0,1)s[0, 1)^s whose initial segments fill the cube as evenly as possible. Evenness is measured by the star discrepancy. It compares the share of the first NN points in each box anchored at the origin with the volume of the box. For a low-discrepancy sequence the largest difference is of order (log⁡N)s/N(\log N)^s / N. For large NN this is much smaller than the typical value of order N−1/2N^{-1/2} for random points. Such sequences are the point sets of quasi-Monte Carlo integration. Every low-discrepancy sequence is uniformly distributed in the cube; for s=1s = 1 this is equidistribution modulo one.

Where this leads

4 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Low-discrepancy_sequence
About this page
TagXSPX1KW9AQ
URIm2://XSPX1KW9AQ
Kindconcept
WritingW0 stub
MSC11K38, 11K36, 65C05
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • 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

Definitions

Results about this

Used by

Instances