Discrepancy bound for low-dimensional point sets

zbMATH Open1368.11079arXiv1407.0819MaRDI QIDQ2811671FDOQ2811671

Peter Kritzer, Henri Faure

Publication date: 10 June 2016

Abstract: The class of $(t,m,s)$-nets and $(t,s)$-sequences, introduced in their most general form by Niederreiter, are important examples of point sets and sequences that are commonly used in quasi-Monte Carlo algorithms for integration and approximation. Low-dimensional versions of $(t,m,s)$-nets and $(t,s)$-sequences, such as Hammersley point sets and van der Corput sequences, form important sub-classes, as they are interesting mathematical objects from a theoretical point of view, and simultaneously serve as examples that make it easier to understand the structural properties of $(t,m,s)$-nets and $(t,s)$-sequences in arbitrary dimension. For these reasons, a considerable number of papers have been written on the properties of low-dimensional nets and sequences.

Full work available at URL: https://arxiv.org/abs/1407.0819

zbMATH Keywords

Hammersley point sets\((t,m,s)\)-netsvan der Corput sequences\((t,s)\)-sequences

Mathematics Subject Classification ID

Irregularities of distribution, discrepancy (11K38)

Cited In (9)

• Title not available (Why is that?)
• Low Distortion Maps Between Point Sets
• Low-dimensional pinned distance sets via spherical averages
• A method for exact calculation of the discrepancy of low-dimensional finite point sets (II)
• On the computation of sets of points with low Lebesgue constant on the unit disk
• Low distortion maps between point sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Discrepancy of Digital Sequences: New Results on a Classical QMC Topic

This page was built for publication: Discrepancy bound for low-dimensional point sets

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