Low-discrepancy point sets obtained by digital constructions over finite fields
From MaRDI portal
Publication:4018214
DOI10.21136/CMJ.1992.128322zbMath0757.11024OpenAlexW1504916371MaRDI QIDQ4018214
Publication date: 16 January 1993
Full work available at URL: https://eudml.org/doc/31269
low-discrepancy point setsquasi-Monte Carlo methodsstar discrepancydigit expansionLaurent series expansions
Monte Carlo methods (65C05) Numerical integration (65D30) Irregularities of distribution, discrepancy (11K38)
Related Items (51)
The quality parameter for digital \((t,m,s)\)-nets ⋮ Quasi-Monte Carlo integration using digital nets with antithetics ⋮ Construction algorithms for good extensible lattice rules ⋮ Spline methods using integration lattices and digital nets ⋮ Calculation of the quality parameter of digital nets and application to their construction ⋮ Adaptive quasi-Monte Carlo finite element methods for parametric elliptic PDEs ⋮ The tent transformation can improve the convergence rate of quasi-Monte Carlo algorithms using digital nets ⋮ Construction algorithms for polynomial lattice rules for multivariate integration ⋮ Digital nets and sequences constructed over finite rings and their application to quasi-Monte Carlo integration ⋮ Component-by-component digit-by-digit construction of good polynomial lattice rules in weighted Walsh spaces ⋮ Quasi-Monte Carlo methods for the numerical integration of multivariate Walsh series ⋮ Construction of interlaced polynomial lattice rules for infinitely differentiable functions ⋮ Construction of good polynomial lattice rules in weighted Walsh spaces by an alternative component-by-component construction ⋮ Construction of interlaced scrambled polynomial lattice rules of arbitrary high order ⋮ Extrapolated Polynomial Lattice Rule Integration in Computational Uncertainty Quantification ⋮ Construction of scrambled polynomial lattice rules over \(\mathbb{F}_{2}\) with small mean square weighted \(\mathcal{L}_{2}\) discrepancy ⋮ Construction-Free Median Quasi-Monte Carlo Rules for Function Spaces with Unspecified Smoothness and General Weights ⋮ Component-by-component construction of randomized rank-1 lattice rules achieving almost the optimal randomized error rate ⋮ Tractability of Multivariate Integration in Hybrid Function Spaces ⋮ A Tool for Custom Construction of QMC and RQMC Point Sets ⋮ A Universal Median Quasi-Monte Carlo Integration ⋮ A survey of some applications of finite fields ⋮ Extensible hyperplane nets ⋮ A lower bound on a quantity related to the quality of polynomial lattices ⋮ A construction of polynomial lattice rules with small gain coefficients ⋮ Low discrepancy polynomial lattice point sets ⋮ Constructing lattice points for numerical integration by a reduced fast successive coordinate search algorithm ⋮ Infinite-dimensional integration in weighted Hilbert spaces: anchored decompositions, optimal deterministic algorithms, and higher-order convergence ⋮ Good Parameters for a Class of Node Sets in Quasi-Monte Carlo Integration ⋮ Strong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rules ⋮ On the existence of higher order polynomial lattices based on a generalized figure of merit ⋮ Constructions of general polynomial lattice rules based on the weighted star discrepancy ⋮ Richardson Extrapolation of Polynomial Lattice Rules ⋮ Digital net properties of a polynomial analogue of Frolov's construction ⋮ Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes ⋮ Walsh functions, scrambled \(( 0 , m , s )\)-nets, and negative covariance: applying symbolic computation to quasi-Monte Carlo integration ⋮ Constructing good higher order polynomial lattice rules with modulus of reduced degree ⋮ Quasi-Monte Carlo methods with applications in finance ⋮ Construction algorithms for higher order polynomial lattice rules ⋮ Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition ⋮ The construction of extensible polynomial lattice rules with small weighted star discrepancy ⋮ On the Numerical Integration of Walsh Series by Number-Theoretic Methods ⋮ Weighted integration over a hyperrectangle based on digital nets and sequences ⋮ Digital nets with infinite digit expansions and construction of folded digital nets for quasi-Monte Carlo integration ⋮ Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences ⋮ Higher-Order Quasi-Monte Carlo Training of Deep Neural Networks ⋮ The \(b\)-adic tent transformation for quasi-Monte Carlo integration using digital nets ⋮ Good interlaced polynomial lattice rules for numerical integration in weighted Walsh spaces ⋮ Discrepancy Theory and Quasi-Monte Carlo Integration ⋮ Proof techniques in quasi-Monte Carlo theory ⋮ Fast construction of higher order digital nets for numerical integration in weighted Sobolev spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Point sets and sequences with small discrepancy
- Low-discrepancy point sets
- Rational functions with partial quotients of small degree in their continued fraction expansion
- Low-discrepancy and low-dispersion sequences
- A combinatorial problem for vector spaces over finite fields
- Optimal characteristic polynomials for digital multistep pseudorandom numbers
- The singular series for sums of squares of polynomials
- Figures of Merit for Digital Multistep Pseudorandom Numbers
- A Statistical Analysis of Generalized Feedback Shift Register Pseudorandom Number Generators
- Discrépance de suites associées à un système de numération (en dimension s)
- On the Distribution of Pseudo-Random Numbers Generated by the Linear Congruential Method. III
- Quasi-Monte Carlo methods and pseudo-random numbers
- The Arithmetic of Polynomials in a Galois Field
- The expression of a polynomial as a sum of three irreducibles
- On the distribution of points in a cube and the approximate evaluation of integrals
- Irregularities of distribution, VII
This page was built for publication: Low-discrepancy point sets obtained by digital constructions over finite fields