Using permutations to reduce discrepancy

DOI10.1016/0377-0427(90)90340-6zbMATH Open0709.65005OpenAlexW2043030414WikidataQ127097169 ScholiaQ127097169MaRDI QIDQ921848FDOQ921848

Authors: Henri Faure 

Publication date: 1990

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(90)90340-6

Recommendations

• Good permutations for extreme discrepancy
• On the discrepancy of \((0,1)\)-sequences.
• scientific article; zbMATH DE number 4136057
• Discrépance et diaphonie en dimension un
• scientific article; zbMATH DE number 409842

zbMATH Keywords

Monte Carlo methodsrandom number generationreductionasymptotic resultsirregularities of distributionmeasure of discrepancyrepartition of numbersvan der Corput sequences

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Random number generation in numerical analysis (65C10)

Cites Work

• An improved low-discrepancy sequence for multidimensional quasi-Monte Carlo integration
• Title not available (Why is that?)
• Low-discrepancy and low-dispersion sequences
• Symmetrization of the van der Corput generalized sequences
• Discrépance de suites associées à un système de numération (en dimension s)
• Discrépances de suites associées à un système de numération (en dimension un)
• Point sets and sequences with small discrepancy
• On the star-discrepancy of generalized Hammersley sequences in two dimensions
• On the diaphony of the van der Corput-Halton sequence
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A comparative study of pseudo and quasi random sequences for the solution of integral equations
• Title not available (Why is that?)

Cited In (9)

• A good permutation for one-dimensional diaphony
• Quasirandom arithmetic permutations
• On the intriguing search for good permutations
• Good permutations for extreme discrepancy
• Recent progress in improvement of extreme discrepancy and star discrepancy of one-dimen\-sional sequences
• A mixed integer linear programming formulation for low discrepancy consecutive \(k\)-sums permutation
• Using Rademacher permutations to reduce randomness
• Variations on \((0,s)\)-sequences
• Permutations with low discrepancy consecutive \(k\)-sums

This page was built for publication: Using permutations to reduce discrepancy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q921848)