Abstract
The quality of quasi-Monte Carlo methods mainly depends on the distribution properties of the underlying (deterministic) point set. The theory of digital nets provides a method for the construction of extremely well distributed point sets in thes-dimensional unit cube.
This article is an extension of the work in [LLNS96] where a special class of these point sets was introduced. We present improved existence results for digital nets over finite fields \({\mathbb{F}_q}\)of arbitrary prime-power orderq, and show great improvements for concrete constructions in the binary case.
Research supported by the projects P12441-MAT (FWF) and 6788 (OeNB)
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. T. Clayman, K. M. Lawrence, G. L. Mullen, H. Niederreiter, and N. J. A. Sloane. Updated tables of parameters of (£, ra, s)-nets. To appear in: J. Comb. Designs, 1999.
T. Hansen, G. L. Mullen, and H. Niederreiter. Good parameters for a class of node sets in quasi-Monte Carlo integration.Math. Comp.,61: 225–234, 1993.
G. Larcher, A. Lauß, H. Niederreiter, and W. Ch. Schmid. Optimal polynomials for (t, ra, s)-nets and numerical integration of multivariate Walsh series.SIAM J. Numer. Analysis,33: 2239–2253, 1996.
G. Larcher, H. Niederreiter, and W. Ch. Schmid. Digital nets and sequences constructed over finite rings and their application to quasi- Monte Carlo integration.Monatsh. Math.,121: 231–253, 1996.
G. Larcher, W. Ch. Schmid, and R. Wolf. Digital (t, ra, s)-nets, digital (T, s)-sequences, and numerical integration of multivariate Walsh series. In P. Hellekalek, G. Larcher, and P. Zinterhof, editors,Proceedings of the 1st Salzburg Minisymposium on Pseudorandom Number Generation and Quasi-Monte Carlo Methods, Salzburg, Nov. 18, 1994, volume 95–4 of Technical Report Series, pages 75–107. ACPC-Austrian Center for Parallel Computation, 1995.
H. Niederreiter. Point sets and sequences with small discrepancy.Monatsh. Math.,104: 273–337, 1987.
H. Niederreiter. Low-discrepancy point sets obtained by digital constructions over finite fields.Czechoslovak Math. J.,42: 143–166, 1992.
H. Niederreiter.Random Number Generation and Quasi-Monte Carlo Methods. Number63in CBMS-NSF Series in Applied Mathematics. SIAM, Philadelphia, 1992.
W. Ch. Schmid. Shift-nets: a new class of binary digital (t, ra, s)-nets. In H. Niederreiter et al., editor,Monte Carlo and Quasi-Monte Carlo Methods 1996, volume 127 ofLecture Notes in Statistics, pages 369–381. Springer, New York, 1997.
W. Ch. Schmid. The exact quality parameter of nets derived from Sobol’ and Niederreiter sequences. In O. Illiev et al., editor,Recent Advances in Numerical Methods and Applications, pages 287–295. World Scientific Pubi, 1999. To appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmid, W.C. (2000). Improvements and Extensions of the “Salzburg Tables” by Using Irreducible Polynomials. In: Niederreiter, H., Spanier, J. (eds) Monte-Carlo and Quasi-Monte Carlo Methods 1998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59657-5_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-59657-5_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66176-4
Online ISBN: 978-3-642-59657-5
eBook Packages: Springer Book Archive