Low-discrepancy point sets obtained by digital constructions over finite fields

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

Publication:4018214

DOI10.21136/CMJ.1992.128322zbMath0757.11024OpenAlexW1504916371MaRDI QIDQ4018214

Harald Niederreiter

Publication date: 16 January 1993

Full work available at URL: https://eudml.org/doc/31269




Related Items (51)

The quality parameter for digital \((t,m,s)\)-netsQuasi-Monte Carlo integration using digital nets with antitheticsConstruction algorithms for good extensible lattice rulesSpline methods using integration lattices and digital netsCalculation of the quality parameter of digital nets and application to their constructionAdaptive quasi-Monte Carlo finite element methods for parametric elliptic PDEsThe tent transformation can improve the convergence rate of quasi-Monte Carlo algorithms using digital netsConstruction algorithms for polynomial lattice rules for multivariate integrationDigital nets and sequences constructed over finite rings and their application to quasi-Monte Carlo integrationComponent-by-component digit-by-digit construction of good polynomial lattice rules in weighted Walsh spacesQuasi-Monte Carlo methods for the numerical integration of multivariate Walsh seriesConstruction of interlaced polynomial lattice rules for infinitely differentiable functionsConstruction of good polynomial lattice rules in weighted Walsh spaces by an alternative component-by-component constructionConstruction of interlaced scrambled polynomial lattice rules of arbitrary high orderExtrapolated Polynomial Lattice Rule Integration in Computational Uncertainty QuantificationConstruction of scrambled polynomial lattice rules over \(\mathbb{F}_{2}\) with small mean square weighted \(\mathcal{L}_{2}\) discrepancyConstruction-Free Median Quasi-Monte Carlo Rules for Function Spaces with Unspecified Smoothness and General WeightsComponent-by-component construction of randomized rank-1 lattice rules achieving almost the optimal randomized error rateTractability of Multivariate Integration in Hybrid Function SpacesA Tool for Custom Construction of QMC and RQMC Point SetsA Universal Median Quasi-Monte Carlo IntegrationA survey of some applications of finite fieldsExtensible hyperplane netsA lower bound on a quantity related to the quality of polynomial latticesA construction of polynomial lattice rules with small gain coefficientsLow discrepancy polynomial lattice point setsConstructing lattice points for numerical integration by a reduced fast successive coordinate search algorithmInfinite-dimensional integration in weighted Hilbert spaces: anchored decompositions, optimal deterministic algorithms, and higher-order convergenceGood Parameters for a Class of Node Sets in Quasi-Monte Carlo IntegrationStrong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rulesOn the existence of higher order polynomial lattices based on a generalized figure of meritConstructions of general polynomial lattice rules based on the weighted star discrepancyRichardson Extrapolation of Polynomial Lattice RulesDigital net properties of a polynomial analogue of Frolov's constructionOrthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubesWalsh functions, scrambled \(( 0 , m , s )\)-nets, and negative covariance: applying symbolic computation to quasi-Monte Carlo integrationConstructing good higher order polynomial lattice rules with modulus of reduced degreeQuasi-Monte Carlo methods with applications in financeConstruction algorithms for higher order polynomial lattice rulesOptimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decompositionThe construction of extensible polynomial lattice rules with small weighted star discrepancyOn the Numerical Integration of Walsh Series by Number-Theoretic MethodsWeighted integration over a hyperrectangle based on digital nets and sequencesDigital nets with infinite digit expansions and construction of folded digital nets for quasi-Monte Carlo integrationConstructions of \((t,m,s)\)-nets and \((t,s)\)-sequencesHigher-Order Quasi-Monte Carlo Training of Deep Neural NetworksThe \(b\)-adic tent transformation for quasi-Monte Carlo integration using digital netsGood interlaced polynomial lattice rules for numerical integration in weighted Walsh spacesDiscrepancy Theory and Quasi-Monte Carlo IntegrationProof techniques in quasi-Monte Carlo theoryFast construction of higher order digital nets for numerical integration in weighted Sobolev spaces




Cites Work




This page was built for publication: Low-discrepancy point sets obtained by digital constructions over finite fields