Point sets and sequences with small discrepancy
From MaRDI portal
DOI10.1007/BF01294651zbMATH Open0626.10045OpenAlexW2009231757MaRDI QIDQ580423FDOQ580423
Authors: Harald Niederreiter 
Publication date: 1987
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/178356
Recommendations
Latin squaresfinite fieldspseudorandom number generationopen problemspoint setsfinite projective planes\((t,m,s)\)- nets\(s\)-dimensional unit cubealgebraic coding theorydigital multistep methoddiscrepancy of \((t,s)\)-sequencesdiscrepancy of netsGFSR method
Permutations, words, matrices (05A05) Combinatorial aspects of finite geometries (05B25) General theory of distribution modulo (1) (11K06) Finite fields and commutative rings (number-theoretic aspects) (11T99)
Cites Work
- Title not available (Why is that?)
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Irregularities of distribution, VII
- On irregularities of distribution
- 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)
- Title not available (Why is that?)
- MONTE CARLO METHODS FOR SOLVING MULTIVARIABLE PROBLEMS
- Title not available (Why is that?)
- Zur angenäherten Berechnung mehrfacher Integrale
- Quasi-Monte Carlo methods and pseudo-random numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pseudo-random numbers and optimal coefficients
- Multidimensional numerical integration using pseudorandom numbers
- Existence of good lattice points in the sense of Hlawka
- ON IRREGULARITIES OF DISTRIBUTION II
- A Statistical Analysis of Generalized Feedback Shift Register Pseudorandom Number Generators
- On Optimal GFSR Pseudorandom Number Generators
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Error bounds for quasi-Monte Carlo integration with nets
- Probabilistic Diophantine approximation and the distribution of Halton-Kronecker sequences
- A higher order Blokh-Zyablov propagation rule for higher order nets
- New explicit bounds for ordered codes and \((t,m,s)\)-nets
- On the connectedness of limit net sets
- Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences
- On the \(L_2\)-discrepancy of the Sobol-Hammersley net in dimension 3
- A note onm-weights of linear codes
- Constructions of general polynomial lattice rules based on the weighted star discrepancy
- A quasi–Monte Carlo scheme for Smoluchowski’s coagulation equation
- Spline methods using integration lattices and digital nets
- Quasi-Monte Carlo methods for numerical integration of multivariate Haar series
- Low discrepancy sequences for solving the Boltzmann equation
- Weight distribution of the crown-weight space
- On the mean square weighted \(\mathcal {L}_2\) discrepancy of randomized digital nets in prime base
- Quasi-Monte Carlo simulation of diffusion
- On hybrid sequences built from Niederreiter-Halton sequences and Kronecker sequences
- On-line uniformity of points
- A study of orthogonal array-based designs under a broad class of space-filling criteria
- Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces
- Duality for digital sequences
- Constructions and bounds on linear error-block codes
- Digital Sequences with Best Possible Order of L 2 ‐Discrepancy
- A simple derivation of the MacWilliams identity for linear ordered codes and orthogonal arrays
- Digital nets and sequences constructed over finite rings and their application to quasi-Monte Carlo integration
- Point sets with optimal order of extreme and periodic discrepancy
- On the Numerical Integration of Walsh Series by Number-Theoretic Methods
- The covering problem in Rosenbloom-Tsfasman spaces
- Maximum distance separable poset codes
- Representation of Functions as Walsh Series to Different Bases and an Application to the Numerical Integration of High-Dimensional Walsh Series
- Perfect codes in poset spaces and poset block spaces
- Finite field constructions of combinatorial arrays
- Improving simulated annealing through derandomization
- Adaptive random search in quasi-Monte Carlo methods for global optimization
- Ruin theory with risk proportional to the free reserve and securitization
- What Monte Carlo models can do and cannot do efficiently?
- A new measure of irregularity of distribution
- Classification of weighted posets and digraphs admitting the extended Hamming code to be a perfect code
- Automorphism group of the crown-weight space
- Extensible hyperplane nets
- On the discrepancy of \((0,1)\)-sequences.
- Point sets with low L p-discrepancy
- A survey of some applications of finite fields
- Improved bounds and schemes for the declustering problem
- Precise distribution properties of the van der Corput sequence and related sequences
- Optimal \(L_{p}\)-discrepancy bounds for second order digital sequences
- The triple distribution of codes and ordered codes
- Valuation of the Reset Options Embedded in Some Equity-Linked Insurance Products
- Using permutations to reduce discrepancy
- Bounds on the discrepancy of linear recurring sequences over Galois rings
- Component-by-component construction of low-discrepancy point sets of small size
- On a simple quasi-Monte Carlo approach for classical ultimate ruin probabilities
- Scrambled geometric net integration over general product spaces
- On Rosenbloom and Tsfasman's generalization of the Hamming space
- Dyadic diaphony of digital sequences
- AN ADAPTIVE METHOD FOR EVALUATING MULTIDIMENSIONAL CONTINGENT CLAIMS: PART II
- Stable length estimates of tube-like shapes
- Wei-type duality theorems for matroids
- A metrical lower bound on the star discrepancy of digital sequences
- A variant of Atanassov's method for \((t, s)\)-sequences and \((t, \mathbf{e}, s)\)-sequences
- Orthogonal hypercubes and related designs
- Title not available (Why is that?)
- Point sets with uniformity properties and orthogonal hypercubes
- Sequential Monto Carlo techniques for the solution of linear systems
- Construction algorithms for polynomial lattice rules for multivariate integration
- Analysis of discrete least squares on multivariate polynomial spaces with evaluations at low-discrepancy point sets
- Duality theory and propagation rules for generalized digital nets
- Multidimensional quasi-Monte Carlo methods
- A construction of polynomial lattice rules with small gain coefficients
- Constructions of general polynomial lattices for multivariate integration
- MacWilliams-type identities for fragment and sphere enumerators
- Cubic and higher degree bounds for codes and \((t,m,s)\)-nets
- On the root mean square weighted \(L_{2}\) discrepancy of scrambled nets
- A construction of digital \((0,s)\)-sequences involving finite-row generator matrices
- Optimal Latin hypercube designs for the Kullback-Leibler criterion
- A combinatorial problem for vector spaces over finite fields
- From van der Corput to modern constructions of sequences for quasi-Monte Carlo rules
- On the approximation of smooth functions using generalized digital nets
- Title not available (Why is that?)
- Harmonic analysis on totally disconnected groups and irregularities of point distributions
- Construction algorithms for good extensible lattice rules
- Nets obtained from rational functions over finite fields
- Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes
- Statistical independence properties of pseudorandom vectors produced by matrix generators
- Application of deterministic low-discrepancy sequences in global optimization
- Improved upper bounds on the star discrepancy of \((t,m,s)\)-nets and \((t,s)\)-sequences
- Low-discrepancy and low-dispersion sequences
- Mixed orthogonal arrays, \((u,m,\mathbf{e},s)\)-nets, and \((u,\mathbf{e},s)\)-sequences
- Diaphony, discrepancy, spectral test and worst-case error
- Codes with a poset metric
- Quasi-Random Sampling Importance Resampling
- An algorithm to compute bounds for the star discrepancy
- Optimal quasi-Monte Carlo rules on order 2 digital nets for the numerical integration of multivariate periodic functions
- The Halton sequence and its discrepancy in the Cantor expansion
- On the distribution properties of Niederreiter-Halton sequences
- A lower bound on a quantity related to the quality of polynomial lattices
- Title not available (Why is that?)
- A best possible upper bound on the star discrepancy of (t, m, 2)-nets
- Title not available (Why is that?)
- A characterization of strong orthogonal arrays of strength three
This page was built for publication: Point sets and sequences with small discrepancy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580423)
