#include <QuasiMonteCarlo.h>
Inheritance diagram for Sobol:
Public Member Functions  
void  restart () 
const RealArray1D &  nextPoint () 
void  read_prim_pol (int k, int n, int d) 
void  printInitialization () 
Sobol (int dim) 

Constructor


empty default implementation Reimplemented from LowDiscrepancySequence. 

The next Sobol point in the unit cube [0,1]^dim. Implements LowDiscrepancySequence. 

A primitive polynomial p(x) modulo 2 is encoded by a pair of numbers (d,n) as follows: d=degree(p), the leading and trailing coefficient of p are 1 and the intermediate coefficients are the bits of n in the binary representation of n: for example the polynomial
with coefficients (1)1101(1) is encoded as (5,n) with n=1101=13. In other words the least significant bit of n corresponds to the second highest power of x etc. The routine allocates the coefficient array p[k] of this polynomial and writes the coefficients into the array with powers of x decreasing left to right.


Test function, prints the v[j][k] initialization. 