Discrepancy bound for low-dimensional point sets
From MaRDI portal
(Redirected from Publication:2811671)
Abstract: The class of -nets and -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 -nets and -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 -nets and -sequences in arbitrary dimension. For these reasons, a considerable number of papers have been written on the properties of low-dimensional nets and sequences.
Recommendations
Cited in
(11)- On the computation of sets of points with low Lebesgue constant on the unit disk
- Low-dimensional pinned distance sets via spherical averages
- scientific article; zbMATH DE number 1629810 (Why is no real title available?)
- scientific article; zbMATH DE number 426358 (Why is no real title available?)
- Low distortion maps between point sets
- Low Distortion Maps Between Point Sets
- scientific article; zbMATH DE number 1241856 (Why is no real title available?)
- scientific article; zbMATH DE number 822312 (Why is no real title available?)
- A method for exact calculation of the discrepancy of low-dimensional finite point sets (II)
- Implementation and tests of low-discrepancy sequences
- 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)