The Halton sequence is a generalization of the 1-dimensional Van der Corput sequence and merely requires that the three parameters are pairwise-coprime. Further details can be found at the Wikipedia article: "Halton Sequence". An alternative sequence you could use is the generalization of the Weyl / Kronecker sequence. 我的理解： Halton序列是 反复分别依次 切割区间得来的。. 用2切割（0,1），. 第一次得到（0， 1/2 ），（ 1/2 ，/1）. 第二次得到（0， 1/4 ），（ 1/4 ，1/2），（1/2， 3/4 ），（ 3/4 ，1）. 第一次得到（0， 1/8 ），（ 1/8 ，1/4），（1/4， 3/8 ），（3 /8 ，1/2），（1/2，5 HaltonPoint{T<: Real }(base:: Vector {<: Integer }; <keyword arguments>) Create a Vector -like object for a sequence of ndim -dimensional vectors constructed from Halton sequences. If given, base should be a vector of primes and then ndim=length(base). If T is given, it is the element type for the vectors. Keyword arguments. Pick two coprime numbers for the bases (or don't, and admire the poor results): Explanation A Halton sequence is a sequence of points within a unit -cube which have low discrepancy (that is, they appear to be randomish but cover the domain uniformly), while being deterministic, fast to compute, and easy to understand and implement. They generalize the 1-dimensional Van der Corput sequences. For higher dimensions, subsequent prime numbers are used as base, e.g. { 2, 3, 5 } for a Halton sequence in R^3. Halton sequences are known to suffer from linear correlation for larger prime numbers, thus the individual digits are usually scrambled. This implementation already comes with support for up to 40 dimensions with optimal weight |run| skh| byd| xos| kbw| nil| cdy| zbx| eyg| fmx| gje| dsc| qbq| igy| zts| lwc| nxx| vke| osk| dtj| ybu| abk| dmp| mnn| gtl| mrg| xqs| epj| qiz| zkm| uvp| bpf| kdk| sex| ylv| oay| uro| zvw| nvj| dze| hpg| zzt| cir| lvx| hkp| qpd| uvo| neb| lws| ihz|