Combined random number generator via the generalized Chinese remainder theorem
From MaRDI portal
Publication:1612315
DOI10.1016/S0377-0427(01)00424-1zbMath1003.65005OpenAlexW2035962245MaRDI QIDQ1612315
Publication date: 22 August 2002
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-0427(01)00424-1
Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds in spectral test for multiple recursive random number generators with missing terms
- A new class of random number generators
- Thoughts on pseudorandom number generators
- Several extensively tested multiple recursive random number generators
- Systematic searches for good multiple recursive random number generators
- Lower bounds in spectral tests for vectors of nonsuccessive values produced by multiple recursive generator with some zero multipliers
- The k -distribution of generalized feedback shift register pseudorandom numbers
- Structural Properties for Two Classes of Combined Random Number Generators
- Combined Multiple Recursive Random Number Generators
- An Implementation of the Lattice and Spectral Tests for Multiple Recursive Linear Random Number Generators
- Bad Lattice Structures for Vectors of Nonsuccessive Values Produced by Some Linear Recurrences
- Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators
- Twisted GFSR generators
- Uniform Random Number Generators
- Generalized Feedback Shift Register Pseudorandom Number Algorithm
- The General Chinese Remainder Theorem
This page was built for publication: Combined random number generator via the generalized Chinese remainder theorem
