Quasi-Monte Carlo methods and pseudo-random numbers

From MaRDI portal
Revision as of 12:46, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4190029

DOI10.1090/S0002-9904-1978-14532-7zbMath0404.65003OpenAlexW2140262981WikidataQ96623555 ScholiaQ96623555MaRDI QIDQ4190029

Harald Niederreiter

Publication date: 1978

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9904-1978-14532-7




Related Items (only showing first 100 items - show all)

Grid-free simulation of diffusion using random wall methodsLattice methods for multiple integrationIntegration of nonperiodic functions of two variables by Fibonacci lattice rulesA comparative study of pseudo and quasi random sequences for the solution of integral equationsA brief and understandable guide to pseudo-random number generators and specific models for securityDistribution of exponential functions with squarefull exponent in residue rings.Sequential Monto Carlo techniques for the solution of linear systemsQuasi-random simulation of linear kinetic equationsGeneral discrepancy estimates. III: The Erdös-Turán-Koksma inequality for the Haar function systemMonte Carlo radiosityExistentially closed graphs via permutation polynomials over finite fieldsDegradation-based maintenance decision using stochastic filtering for systems under imperfect maintenanceMethod of good matrices for multi-dimensional numerical integrations - An extension of the method of good lattice pointsOn a problem of Kodama concerning the Hasse-Witt matrix and the distribution of residuesLow-discrepancy and low-dispersion sequencesStatistical independence of nonlinear congruential pseudorandom numbersOn the diaphony of the van der Corput-Halton sequenceA pseudo-marginal sequential Monte Carlo algorithm for random effects models in Bayesian sequential designIrregularities of point distributions relative to homothetic convex bodies. IMonte Carlo integration with quasi-random numbers: Some experienceA review of pseudorandom number generatorsA direct simulation Monte Carlo scheme and uniformly distributed sequences for solving the Boltzmann equationDesigning combined physical and computer experiments to maximize prediction accuracyImproved Markov chain Monte Carlo method for cryptanalysis substitution-transposition cipherOptimal multipliers for linear congruential pseudorandom number generators with prime moduliBootstrap variance estimation for complex survey data: a quasi Monte Carlo approachLow discrepancy sequences for solving the Boltzmann equationNumerical integration of singular integrands using low-discrepancy sequencesParticle simulations of the Kac model of the Boltzmann equationAn improved low-discrepancy sequence for multidimensional quasi-Monte Carlo integrationA particle method for some parabolic equationsComputational investigations of scrambled Faure sequencesRobust adaptive numerical integration of irregular functions with applications to basket and other multi-dimensional exotic optionsSome current issues in quasi-Monte Carlo methodsBayesian-validated computer-simulation surrogates for optimization and design: Error estimates and applicationsAn iterative computation of approximations on Korobov-like spaces.An efficient dimension-adaptive uncertainty propagation approachA proof of Niederreiter's conjecture concerning error bounds for quasi- Monte Carlo integrationMultiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomialsOptimal coefficients modulo prime powers in the three-dimensional caseCriteria for the assessment of random number generatorsThe dispersion of the Hammersley sequence in the unit squareAn aperiodic pseudorandom number generatorStatistical independence properties of pseudorandom vectors produced by matrix generatorsOn the discrepancy of \((0,1)\)-sequences.Approximating convolution products better than the DFT while keeping the FFTUncertainty quantification of MEMS using a data-dependent adaptive stochastic collocation methodRecent trends in random number and random vector generationA new measure of irregularity of distributionA search program for finding optimal integration latticesLattice rules with random \(n\) achieve nearly the optimal \(\mathcal{O}(n^{-\alpha-1/2})\) error independently of the dimensionOn randomization of Halton quasi-random sequencesMulti-fidelity uncertainty quantification method with application to nonlinear structural response analysisLattice-based integration algorithms: Kronecker sequences and rank-1 latticesAn algorithm for finding optimal integration lattices of composite orderLong-term bounds on nonlinear Hamiltonian motionOrthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubesOn computing the exact value of dispersion of a sequenceEfficient multivariate approximation on the cubeSorting methods and convergence rates for Array-RQMC: some empirical comparisonsSelf-organization and a.s. convergence of the one-dimensional Kohonen algorithm with non-uniformly distributed stimuliAverage case complexity of linear multivariate problems. II: ApplicationsNumerical solution of the Poisson equation over hypercubes using reduced Chebyshev polynomial basesVan der Corput sequences, Kakutani transforms and one-dimensional numerical integrationMultivariate permutation polynomial systems and nonlinear pseudorandom number generatorsA new class of equal-weight integration rules on the hypercubeOn pseudorandom numbers from multivariate polynomial systemsOn a conjecture of ZarembaPoint sets and sequences with small discrepancySurface area estimation of digitized 3D objects using quasi-Monte Carlo methodsExistence of good lattice points in the sense of HlawkaOptimization of functions by quasi-random search methodsUniform random number generationReject the rejection techniqueThe ultratriangular form for prime-power lattice rulesPseudo-random trees: Multiple independent sequence generators for parallel and branching computationsEvaluation of the discrepancy of the linear congruential pseudo-random number sequencesTree based credible set estimationMean characteristics of Gibbsian point processesApplications to risk theory of a Monte Carlo multiple integration method.What Monte Carlo models can do and cannot do efficiently?Incomplete character sums and a special class of permutationsQuasirandom permutationsOptimal multipliers for pseudo-random number generation by the linear congruential methodMonte Carlo integration with quasi-random numbers: Experience with discontinuous integrandsGood random number generators are (not so) easy to findThe serial test for pseudo-random numbers generated by the linear congruential methodNon-Archimedean Koksma inequalities, variation, and Fourier analysisOn the discrepancy of inversive congruential pseudorandom numbers with prime power modulusA method for exact calculation of the discrepancy of low-dimensional finite point sets. IOn integration latticesOn the discrepancy of quadratic congruential pseudorandom numbersQuasi-Monte Carlo, low discrepancy sequences, and ergodic transformationsDyadic fractions with small partial quotientsLow-discrepancy point setsAdaptive random search in quasi-Monte Carlo methods for global optimizationOn the distribution of the Diffie-Hellman pairsA method for exact calculation of the stardiscrepancy of plane sets applied to the sequences of HammersleyRandom and quasirandom sequences: Numerical estimates of uniformity of distributionHyperbolic automorphisms of tori and pseudo-random sequences


Uses Software



Cites Work




This page was built for publication: Quasi-Monte Carlo methods and pseudo-random numbers