Efficient Generation of Parallel Quasirandom Faure Sequences Via Scrambling
Authors:
- 1 January 2007
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 723-730
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Efficient simulated maximum likelihood with an application to online retailingStatistics and Computing, 2006
- On the optimal Halton sequenceMathematics and Computers in Simulation, 2005
- A Scalable Low Discrepancy Point Generator for Parallel ComputingLecture Notes in Computer Science, 2004
- Analysis of Large-Scale Grid-Based Monte Carlo ApplicationsThe International Journal of High Performance Computing Applications, 2003
- On the asymptotic distribution of scrambled net quadratureThe Annals of Statistics, 2003
- Variations on (0, s)-SequencesJournal of Complexity, 2001
- Computational investigations of low-discrepancy sequencesACM Transactions on Mathematical Software, 1997
- Quasirandom Number Generators for Parallel Monte Carlo AlgorithmsJournal of Parallel and Distributed Computing, 1996
- Algorithm 647: Implementation and Relative Efficiency of Quasirandom Sequence GeneratorsACM Transactions on Mathematical Software, 1986
- Discrépance de suites associées à un système de numération (en dimension s)Acta Arithmetica, 1982