Construction algorithms for plane nets in base b

MaRDI QIDQ5379568zbMATH OpenFDO

Authors Gunther Leobacher, Thomas Schell, Friedrich Pillichshammer

Publication date 12 June 2019

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

zbMATH Keywords

$(t,m,s)$-netsdiscrepancyHammersley net

Mathematics Subject Classification ID

Special sequences (11K31) Irregularities of distribution, discrepancy (11K38) Random number generation in numerical analysis (65C10)

Abstract: The class of $(0,m,s)$-nets in base $b$ has been introduced by Niederreiter as examples of point sets in the $s$-dimensional unit cube with excellent uniform distribution properties. In particular such nets have been proved to have very low discrepancy. This property is essential for the use of nets in quasi-Monte Carlo rules for numerical integration. In this short note we propose two algorithms for the construction of plane $(0,m,2)$-nets in base~$b$.

Recommendations

• scientific article; zbMATH DE number 822305
• Constructions of digital nets
• A complete classification of digital \((0,m,3)\)-nets and digital \((0,2)\)-sequences in base 2
• Good Parameters for a Class of Node Sets in Quasi-Monte Carlo Integration
• scientific article; zbMATH DE number 1390098

Cited in

(4)

• A Small Taxonomy of Integration Node Sets
• A complete classification of digital \((0,m,3)\)-nets and digital \((0,2)\)-sequences in base 2
• scientific article; zbMATH DE number 972647 (Why is no real title available?)
• Hidden low-discrepancy structures in random point sets

This page was built for publication: Construction algorithms for plane nets in base $b$

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