[~Home~] | Monte Carlo Integration II. Stratified Sampling. | Numerical Methods. Note~ « 12 » |
Stratified sampling. This algorithm tries to distribute more points to those regions where the variance is largest. The MISER routine implements recursive stratified sampling along the following lines:
if the number of given points is too small call plain montecarlo and return sample a fraction (Ntrial) of given points randomly from the given volume for each dimension: subdivide the volume into two subvolumes (left and right) along this dimension estimate the (sub)variances in the two subvolumes pick the dimension whith the largest (sub)variance subdivide your volume in two along this dimension distribute the remaining points between the two subvolumes proportional to (sub)variances (Nleft and Nright) dispatch two recursive calls to each of the sub-volumes estimate the grand average and grand variance: grand_average = (Ntrial*trial_average+Nleft*left_average+Nright*right_average)/(Ntrial+Nleft+Nright) return
Quasi-Random (Low-discrepancy) sampling. Lattices. The idea of the quasi-random sampling is to distribute points "more uniformly" than in random sampling thus (hopefully) reducing the error. One of the quasi-random methods is lattices, which can be considered as a grid with non-orthogonal axes. Let αk, k=1:n be a set of (wisely chosen) irrational numbers. Then the i-th point is generated as
xi = { frac(i α1), ... , frac(i αn) }, |
Problems