3 Oéd©0ã@s$dZddlZdgZGdd„dƒZdS)a Licensing: This code is distributed under the MIT license. Authors: Original FORTRAN77 version of i4_sobol by Bennett Fox. MATLAB version by John Burkardt. PYTHON version by Corrado Chisari Original Python version of is_prime by Corrado Chisari Original MATLAB versions of other functions by John Burkardt. PYTHON versions by Corrado Chisari Original code is available from http://people.sc.fsu.edu/~jburkardt/py_src/sobol/sobol.html Modifications: Wrapped into Python class [30.10.2017] éNÚSobolc@s6eZdZdd„Zd dd„Zdd„Zdd „Zd d „Zd S)rcCsFd|_d|_d|_d|_d|_d|_d|_d|_d|_d|_ d|_ dS)N) ÚatmostÚdim_maxÚ dim_num_saveÚ initializedÚlastqÚlog_maxÚmaxcolÚpolyÚrecipdÚ seed_saveÚv)Úself©rúV/var/www/html/virt/lib64/python3.6/site-packages/scipy/optimize/_shgo_lib/sobol_seq.pyÚ__init__szSobol.__init__écCsLtj||ftjƒ}x4t|ƒD](}||}|j||ƒ\||d|…f<}qW|S)a; i4_sobol_generate generates a Sobol dataset. Parameters: Input, integer dim_num, the spatial dimension. Input, integer N, the number of points to generate. Input, integer SKIP, the number of initial points to skip. Output, real R(M,N), the points. r)ÚnpÚfullÚnanÚrangeÚi4_sobol)rÚdim_numÚnÚskipÚrÚjÚseedZ next_seedrrrÚi4_sobol_generate*s  zSobol.i4_sobol_generatecCs0tj|ƒ}d}x|dkr*|d7}|d}qW|S)aË i4_bit_hi1 returns the position of the high 1 bit base 2 in an integer. Example: +------+-------------+----- | N | Binary | BIT +------|-------------+----- | 0 | 0 | 0 | 1 | 1 | 1 | 2 | 10 | 2 | 3 | 11 | 2 | 4 | 100 | 3 | 5 | 101 | 3 | 6 | 110 | 3 | 7 | 111 | 3 | 8 | 1000 | 4 | 9 | 1001 | 4 | 10 | 1010 | 4 | 11 | 1011 | 4 | 12 | 1100 | 4 | 13 | 1101 | 4 | 14 | 1110 | 4 | 15 | 1111 | 4 | 16 | 10000 | 5 | 17 | 10001 | 5 | 1023 | 1111111111 | 10 | 1024 | 10000000000 | 11 | 1025 | 10000000001 | 11 Parameters: Input, integer N, the integer to be measured. N should be nonnegative. If N is nonpositive, the value will always be 0. Output, integer BIT, the number of bits base 2. rré)rÚfloor)rrÚiÚbitrrrÚ i4_bit_hi1<s %   zSobol.i4_bit_hi1cCs8d}tj|ƒ}x$|d|dkr2|d7}|d}qW|S)ay I4_BIT_LO0 returns the position of the low 0 bit base 2 in an integer. Example: +------+------------+---- | N | Binary | BIT +------+------------+---- | 0 | 0 | 1 | 1 | 1 | 2 | 2 | 10 | 1 | 3 | 11 | 3 | 4 | 100 | 1 | 5 | 101 | 2 | 6 | 110 | 1 | 7 | 111 | 4 | 8 | 1000 | 1 | 9 | 1001 | 2 | 10 | 1010 | 1 | 11 | 1011 | 3 | 12 | 1100 | 1 | 13 | 1101 | 2 | 14 | 1110 | 1 | 15 | 1111 | 5 | 16 | 10000 | 1 | 17 | 10001 | 2 | 1023 | 1111111111 | 1 | 1024 | 0000000000 | 1 | 1025 | 0000000001 | 1 Parameters: Input, integer N, the integer to be measured. N should be nonnegative. Output, integer BIT, the position of the low 1 bit. rr)rr )rrr"r!rrrÚ i4_bit_lo0hs $  zSobol.i4_bit_lo0c )Cs¼|jdkrd|_dL|_|j s*||jkrxd|_d|_dM|_d|_dN|_tj|j|jfƒ|_tjddddddddddddddddddddddddddddddddddddddddg(ƒ|jdd…df<tjddddddddddddddddddddddddddddddddddddddg&ƒ|jdd…df<tjdd ddddd d ddddddd ddd ddddd ddddd ddd ddd dddg%ƒ|jdd…df<tjddd d d dddd d d d d dd d dd dd d d dd dd d dd d d dddd g#ƒ|jd d…df<tjd ddd ddddd ddd ddddddd d ddddd ddd dd d dd g!ƒ|jdd…df<tjdddd d ddddd ddddd ddd ddddd ddd dgƒ|jd d…d f<tjd dddddddd d!d"dd#d$ddd%d&d'd(d)gƒ|jdd…d*f<tjdddgƒ|jdd…df<dddd d dddd#d+d&d,dd-d.d/d0d1dd2d3d4d5d6d7d8d9d:d;dd?d@dAdBdCdDdEdFg(|_ d|jd|_ |j |j ƒ|_ d|jdd|j …f<||jkrV||_xXt d|dƒD]D}|j |d}d}|d}x |dkrÜ|d}|d7}q¾W|j |d}tj|ƒ}x6t |ddOƒD]&}|d}|d|k||d<|}qWx°t |d|j dƒD]˜}|j|d||df} d} x\t d|dƒD]J}| d9} ||drvtjt| ƒt| |j|d||dfƒƒ} qvW| |j|d|df<qDWqœWd} xPt |j dddPƒD]:}| d9} |jd|…|df| |jd|…|df<qþWdGd| |_tj|ƒ|_ttj|ƒƒ}|dkrrd}d} |dkrtj|ƒ|_nb||jdkr®|j|ƒ} nD||jkrVd|_tj|ƒ|_x|t t|jƒt|ƒƒD]d} |j| ƒ} xRt d|dƒD]@}tjt|j|dƒt|j|d| dfƒƒ|j|d<qWqâW|j|ƒ} nœ|jd|kròx€t t|jdƒt|ƒƒD]d} |j| ƒ} xRt d|dƒD]@}tjt|j|dƒt|j|d| dfƒƒ|j|d<qžWq€W|j|ƒ} |j | kr,tdHƒtdIƒtdJ|j ƒtdK| ƒdStj|ƒ} xnt d|dƒD]\}|j|d|j| |d<tjt|j|dƒt|j|d| dfƒƒ|j|d<qFW||_|d7}| |gS)Qaó i4_sobol generates a new quasirandom Sobol vector with each call. Discussion: The routine adapts the ideas of Antonov and Saleev. Reference: Antonov, Saleev, USSR Computational Mathematics and Mathematical Physics, Volume 19, 1980, pages 252 - 256. Paul Bratley, Bennett Fox, Algorithm 659: Implementing Sobol's Quasirandom Sequence Generator, ACM Transactions on Mathematical Software, Volume 14, Number 1, pp. 88-100, 1988. Bennett Fox, Algorithm 647: Implementation and Relative Efficiency of Quasirandom Sequence Generators, ACM Transactions on Mathematical Software, Volume 12, Number 4, pp. 362-376, 1986. Ilya Sobol, USSR Computational Mathematics and Mathematical Physics, Volume 16, pp. 236-242, 1977. Ilya Sobol, Levitan, The Production of Points Uniformly Distributed in a Multidimensional Cube (in Russian), Preprint IPM Akad. Nauk SSSR, Number 40, Moscow 1976. Parameters: Input, integer DIM_NUM, the number of spatial dimensions. DIM_NUM must satisfy 1 <= DIM_NUM <= 40. Input/output, integer SEED, the "seed" for the sequence. This is essentially the index in the sequence of the quasirandom value to be generated. On output, SEED has been set to the appropriate next value, usually simply SEED+1. If SEED is less than 0 on input, it is treated as though it were 0. An input value of 0 requests the first (0th) element of the sequence. Output, real QUASI(DIM_NUM), the next quasirandom vector. Nrré(éérééé é é ééééééééééé%é!é'é?é1ésé)éOéwéKéIéié;éAéqé=éYé-ékéé/é7éCéaé[émégéƒéÁé‰é‘ééñéé¹é§éåé«éÕé¿éýéËéÓéïé÷iiqi+gð?zI4_SOBOL - Fatal error!z Too many calls!z MAXCOL = %d z L = %d éÿÿÿÿrdrdrdrd)rrrrr rZzerosr Z transposer rr#r rZ bitwise_xorÚintr rr r$Úprint) rrrr!rÚmZincludÚkZj2ZnewvZlseedZ seed_tempZquasirrrr“sò2 ((( ((((    *"2      B  B    <zSobol.i4_sobolN)r)Ú__name__Ú __module__Ú __qualname__rrr#r$rrrrrrs  ,+)Ú__doc__ZnumpyrÚ__all__rrrrrÚs