Abstract
The Faure sequences are a popular class of low-discrepancy sequences. Their generalized variants, with better equi-distribution properties, are extensively used in quasi-Monte Carlo methods, especially for very high dimensional problems. The task of generating these sequences can take substantial part of the overall CPU time of a quasi-Monte Carlo computation. We present an efficient algorithm for generating these sequences, and demonstrate how it may be tuned to use the extended instruction sets, available on many modern CPUs, to reduce drastically the CPU-time, spent for generating these sequences. © Springer-Verlag 2004.
Cite
CITATION STYLE
Atanassov, E. I. (2004). Efficient CPU-specific algorithm for generating the generalized faure sequences. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2907, 121–127. https://doi.org/10.1007/978-3-540-24588-9_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
