Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation
From MaRDI portal
Publication:3600420
DOI10.1007/978-3-540-85912-3_1zbMath1198.65021OpenAlexW2165302679MaRDI QIDQ3600420
Publication date: 10 February 2009
Published in: Sequences and Their Applications - SETA 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85912-3_1
Monte Carlo methods (65C05) Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved long-period generators based on linear recurrences modulo 2
- Constructing Sobol Sequences with Better Two-Dimensional Projections
- Point sets and sequences with small discrepancy
- A new class of random number generators
- Uniform random number generation
- Liberating the weights
- Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points
- Good lattice rules in weighted Korobov spaces with general weights
- Duality for digital nets and its applications
- Variance Reduction via Lattice Rules
- Efficient Monte Carlo and Quasi–Monte Carlo Option Pricing Under the Variance Gamma Model
- Distribution properties of multiply-with-c arry random number generators
- On the step-by-step construction of quasi--Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spaces
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- A Randomized Quasi-Monte Carlo Simulation Method for Markov Chains
- Efficient multiply-with-carry random number generators with maximal period
- Efficient and portable multiple recursive generators of large order
- TestU01
- Discrépance de suites associées à un système de numération (en dimension s)
- Randomization of Number Theoretic Methods for Multiple Integration
- Tables of linear congruential generators of different sizes and good lattice structure
- Tables of maximally equidistributed combined LFSR generators
- Mersenne twister
- Latin supercube sampling for very high-dimensional simulations
- Generating Quasi-Random Paths for Stochastic Processes
- An Implementation of the Lattice and Spectral Tests for Multiple Recursive Linear Random Number Generators
- A generalized discrepancy and quadrature error bound
- Randomized Polynomial Lattice Rules for Multivariate Integration and Simulation
- Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators
- On the xorshift random number generators
- On strong tractability of weighted multivariate integration
- On the lattice structure of the add-with-carry and subtract-with-borrow random number generators
- Maximally equidistributed combined Tausworthe generators
- Constructing Embedded Lattice Rules for Multivariate Integration
- Brownian bridge and principal component analysis: towards removing the curse of dimensionality
- On the distribution of points in a cube and the approximate evaluation of integrals
- Why Are High-Dimensional Finance Problems Often of Low Effective Dimension?
- Combination of General Antithetic Transformations and Control Variables
- Geometric discrepancy. An illustrated guide
- Modeling uncertainty. An examination of stochastic theory, methods, and applications
