Sorting methods and convergence rates for Array-RQMC: some empirical comparisons
From MaRDI portal
Publication:1996950
DOI10.1016/j.matcom.2016.07.010zbMath1482.65005OpenAlexW2504632360WikidataQ60347103 ScholiaQ60347103MaRDI QIDQ1996950
David Munger, Bruno Tuffin, Pierre L'Ecuyer, Christian Lécot
Publication date: 1 March 2021
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2016.07.010
Related Items (3)
Sudoku Latin Square Sampling for Markov Chain Simulation ⋮ Quasi-Monte Carlo simulation of coagulation-fragmentation ⋮ Variance reduction with array-RQMC for tau-leaping simulation of stochastic biological and chemical reaction networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the \(L_p\) discrepancy of two-dimensional folded Hammersley point sets
- Coupling from the past with randomized quasi-Monte Carlo
- Quasi-Monte Carlo methods for Markov chains with continuous multi-dimensional state space
- Quasi-Monte Carlo methods with applications in finance
- Space-Filling Curves
- A Randomized Quasi-Monte Carlo Simulation Method for Markov Chains
- On Array-RQMC for Markov Chains: Mapping Alternatives and Convergence Rates
- Spacefilling curves and the planar travelling salesman problem
- Rare events, splitting, and quasi-Monte Carlo
- Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
- Quasi-Monte Carlo methods and pseudo-random numbers
- A Quasi-Monte Carlo Scheme Using Nets for a Linear Boltzmann Equation
- A direct inversion method for non-uniform quasi-random point sequences
- Sequential Quasi Monte Carlo
- Extensible Grids: Uniform Sampling on a Space Filling Curve
- Geometric discrepancy. An illustrated guide
This page was built for publication: Sorting methods and convergence rates for Array-RQMC: some empirical comparisons
