Low-discrepancy point sets obtained by digital constructions over finite fields
From MaRDI portal
Recommendations
Cites work
- A combinatorial problem for vector spaces over finite fields
- 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)
- Figures of Merit for Digital Multistep Pseudorandom Numbers
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 3842011 (Why is no real title available?)
- scientific article; zbMATH DE number 4082826 (Why is no real title available?)
- scientific article; zbMATH DE number 3728384 (Why is no real title available?)
- scientific article; zbMATH DE number 3997925 (Why is no real title available?)
- Irregularities of distribution, VII
- Low-discrepancy and low-dispersion sequences
- Low-discrepancy point sets
- On the distribution of points in a cube and the approximate evaluation of integrals
- On the Distribution of Pseudo-Random Numbers Generated by the Linear Congruential Method. III
- Optimal characteristic polynomials for digital multistep pseudorandom numbers
- Point sets and sequences with small discrepancy
- Quasi-Monte Carlo methods and pseudo-random numbers
- Rational functions with partial quotients of small degree in their continued fraction expansion
- The Arithmetic of Polynomials in a Galois Field
- The expression of a polynomial as a sum of three irreducibles
- The singular series for sums of squares of polynomials
Cited in
(60)- Low-discrepancy point sets
- Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes
- Calculation of the quality parameter of digital nets and application to their construction
- Constructing lattice points for numerical integration by a reduced fast successive coordinate search algorithm
- Digital net properties of a polynomial analogue of Frolov's construction
- The quality parameter for digital (t,m,s)-nets
- Digital nets and sequences constructed over finite rings and their application to quasi-Monte Carlo integration
- Quasi-Monte Carlo methods for the numerical integration of multivariate Walsh series
- Walsh functions, scrambled \(( 0 , m , s )\)-nets, and negative covariance: applying symbolic computation to quasi-Monte Carlo integration
- Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition
- Weighted integration over a hyperrectangle based on digital nets and sequences
- Adaptive quasi-Monte Carlo finite element methods for parametric elliptic PDEs
- Component-by-component digit-by-digit construction of good polynomial lattice rules in weighted Walsh spaces
- Constructing good higher order polynomial lattice rules with modulus of reduced degree
- A nonlocal functional promoting low-discrepancy point sets
- 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
- Proof techniques in quasi-Monte Carlo theory
- Fast construction of higher order digital nets for numerical integration in weighted Sobolev spaces
- Construction of interlaced polynomial lattice rules for infinitely differentiable functions
- 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
- Constructions of (t,m,s)-nets and (t,s)-sequences
- Construction of good polynomial lattice rules in weighted Walsh spaces by an alternative component-by-component construction
- Quasi-Monte Carlo integration using digital nets with antithetics
- Tractability of multivariate integration in hybrid function spaces
- Good Parameters for a Class of Node Sets in Quasi-Monte Carlo Integration
- Explicit constructions of point sets and sequences with low discrepancy
- Component-by-component construction of low-discrepancy point sets of small size
- The construction of extensible polynomial lattice rules with small weighted star discrepancy
- Construction of scrambled polynomial lattice rules over \(\mathbb{F}_{2}\) with small mean square weighted \(\mathcal{L}_{2}\) discrepancy
- On the Numerical Integration of Walsh Series by Number-Theoretic Methods
- Low discrepancy polynomial lattice point sets
- Richardson extrapolation of polynomial lattice rules
- Infinite-dimensional integration in weighted Hilbert spaces: anchored decompositions, optimal deterministic algorithms, and higher-order convergence
- scientific article; zbMATH DE number 881166 (Why is no real title available?)
- Higher-order quasi-Monte Carlo training of deep neural networks
- Extrapolated polynomial lattice rule integration in computational uncertainty quantification
- 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
- Discrepancy theory and quasi-Monte Carlo integration
- Construction algorithms for polynomial lattice rules for multivariate integration
- Construction algorithms for higher order polynomial lattice rules
- Digital nets with infinite digit expansions and construction of folded digital nets for quasi-Monte Carlo integration
- A Tool for Custom Construction of QMC and RQMC Point Sets
- A Universal Median Quasi-Monte Carlo Integration
- 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
- Deep learning based on randomized quasi-Monte Carlo method for solving linear Kolmogorov partial differential equation
- Column reduced digital nets
- A-posteriori QMC-FEM error estimation for Bayesian inversion and optimal control with entropic risk measure
- Quasi-Monte Carlo integration over \(\mathbb{R}^s\) based on digital nets
- Construction algorithms for good extensible lattice rules
- Spline methods using integration lattices and digital nets
- The tent transformation can improve the convergence rate of quasi-Monte Carlo algorithms using digital nets
- Construction of interlaced scrambled polynomial lattice rules of arbitrary high order
- A survey of some applications of finite fields
- Quasi-Monte Carlo methods with applications in finance
This page was built for publication: Low-discrepancy point sets obtained by digital constructions over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018214)
