This article discusses the general problem of generating representative point sets from a distribution known up to a multiplicative constant. The sampling/importance resampling (SIR) algorithm is known to be useful in this context. Moreover, the quasi-random sampling/importance resampling (QSIR)...

The standard domain for quasi-Monte Carlo approximations is the unit cube. Recently, much research has been done to make quasi-Monte Carlo methods applicable to the real space. Mathé and Wei proposed an algorithm that splits Rd into cubes. One of the difficulties with their approach is that the...

The Faure sequence is one of the well-known quasi-random sequences used in quasi-Monte Carlo applications. In its original and most basic form, the Faure sequence suffers from correlations between different dimensions. These correlations result in poorly distributed two-dimensional projections....