Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4583201 | Finite Fields and Their Applications | 2011 | 17 Pages |
Abstract
Extensible (polynomial) lattice point sets have the property that the number N of points in the node set of a quasi-Monte Carlo algorithm may be increased while retaining the existing points. Explicit constructions for extensible (polynomial) lattice point sets have been presented recently by Niederreiter and Pillichshammer. It is the aim of this paper to establish extensibility for a powerful generalization of polynomial lattice point sets, the so-called hyperplane nets.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory