Algorithm 647: Implementation and Relative Efficiency of Quasirandom Sequence Generators
From MaRDI portal
Recommendations
- Algorithm 659
- Generating parallel quasirandom sequences via randomization
- scientific article; zbMATH DE number 1950388
- Quasirandom sequences in random process simulation algorithms
- scientific article; zbMATH DE number 4066203
- On quasirandom sequences for numerical computations
- scientific article; zbMATH DE number 4068143
- On the Quality of Random Sequences Produced with a Combined Random Bit Generator
- Design of high-quality of pseudo-random sequence generators
Cited in
(42)- An algorithm for generating low discrepancy sequences on vector computers
- Recent trends in random number and random vector generation
- Discrepancy-based error estimates for quasi-Monte Carlo. I: General formalism
- Random and quasirandom sequences: Numerical estimates of uniformity of distribution
- Generation of quasi-random \(\text{(LP}_ \tau)\) vectors for parallel computation
- Monte Carlo methods for security pricing
- Hybridization of a multi-objective genetic algorithm, a neural network and a classical optimizer for a complex design problem in fluid dynamics
- Applications of randomized low discrepancy sequences to the valuation of complex securities
- Randomized Halton sequences
- Epi-convergent discretizations of stochastic programs via integration quadratures
- Monte Carlo modelling of imperfections in two-dimensional photonic crystals
- Continuous approximation schemes for stochastic programs
- Fast generation of low-discrepancy sequences
- Quasi-Monte-Carlo methods and the dispersion of point sequences
- A study of highly efficient stochastic sequences for multidimensional sensitivity analysis
- The new scramble for Faure sequence based on irrational numbers
- A computational investigation of the optimal Halton sequence in QMC applications
- Fast, portable, and reliable algorithm for the calculation of Halton numbers
- Variance reduction in sample approximations of stochastic programs
- Algorithm 647
- On the optimal Halton sequence
- Numerical integration using sequences generating permutations
- Implementation of a component-by-component algorithm to generate small low-discrepancy samples
- Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation
- Reduced-order modeling of parameterized PDEs using time-space-parameter principal component analysis
- Algorithm 659
- scientific article; zbMATH DE number 4066203 (Why is no real title available?)
- Programs to generate Niederreiter's low-discrepancy sequences
- Quasi-Monte Carlo mesh-free integration for meshless weak formulations
- Defects in parallel Monte Carlo and quasi-Monte Carlo integration using the leap-frog technique
- Evolutionary optimization of low-discrepancy sequences
- Quasi-Random Sampling Importance Resampling
- scientific article; zbMATH DE number 3999100 (Why is no real title available?)
- New modified scrambled Faure sequences
- Large-Scale Scientific Computing
- Remark on algorithm 659
- Algorithm 823
- Estimation of the Generalized Lambda Distribution Parameters for Grouped Data
- Valuation of the Reset Options Embedded in Some Equity-Linked Insurance Products
- On a Full Monte Carlo Approach to Computational Finance
- Computational investigations of scrambled Faure sequences
- Advanced Monte Carlo optimizations for multidimensional European style options
This page was built for publication: Algorithm 647: Implementation and Relative Efficiency of Quasirandom Sequence Generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4723131)
