The quality parameter for digital (t, m, s)-nets

Authors:
Mary E. Flahive
Affiliations:
Department of Mathematics, Oregon State University, Corvallis, OR
Venue:
Mathematics and Computers in Simulation - Special issue: 3rd IMACS seminar on Monte Carlo methods - MCM 2001
Year:
2003

Citing 2
Cited 1

Random number generation and quasi-Monte Carlo methods

Random number generation and quasi-Monte Carlo methods
Optimal Polynomials for (t,m,s)-Nets and Numerical Integration of Multivariate Walsh Series

SIAM Journal on Numerical Analysis

Constructions of (t ,m,s)-nets and (t,s)-sequences

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The theory of continued fractions over finite fields has been used to identify good digital (t, m, 2)-nets. In this article, we generalize some techniques from real diophantine approximation which can be helpful for locating good candidates for (t, m, s)-nets for s ≥ 3. We include some computational results for binary (t, m, 3)-nets.