2000
DOI: 10.1137/s1064827599356638
|View full text |Cite
|
Sign up to set email alerts
|

Extensible Lattice Sequences for Quasi-Monte Carlo Quadrature

Abstract: Abstract. Integration lattices are one of the main types of low discrepancy sets used in quasiMonte Carlo methods. However, they have the disadvantage of being of fixed size. This article describes the construction of an infinite sequence of points, the first b m of which forms a lattice for any nonnegative integer m. Thus, if the quadrature error using an initial lattice is too large, the lattice can be extended without discarding the original points. Generating vectors for extensible lattices are found by mi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
82
0

Year Published

2002
2002
2012
2012

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 105 publications
(83 citation statements)
references
References 51 publications
1
82
0
Order By: Relevance
“…Secondarily, these sequences should be easy to generate and allow easy neighbor-finding, to fully exploit the advantages of regular structures. Examples of infinite sequences based on regular structures include the extensible grid sequence of the authors [48] and the extensible low-discrepancy lattices of Hickernell et al [31]. The derandomized version of the Lazy PRM (see [11]) also progressively increases the resolution of the grid used to build the roadmap [10].…”
Section: Lattices and Other Regular Structuresmentioning
confidence: 99%
“…Secondarily, these sequences should be easy to generate and allow easy neighbor-finding, to fully exploit the advantages of regular structures. Examples of infinite sequences based on regular structures include the extensible grid sequence of the authors [48] and the extensible low-discrepancy lattices of Hickernell et al [31]. The derandomized version of the Lazy PRM (see [11]) also progressively increases the resolution of the grid used to build the roadmap [10].…”
Section: Lattices and Other Regular Structuresmentioning
confidence: 99%
“…The images in Figure 2 have been computed using the Halton sequence. We also verified the theoretical results using fast implementations of (t, s)-sequences in base b, especially the Sobol' sequence [17,19], and rank-1 lattices sequences [4].…”
Section: Deterministic Sampling Using Quasi-monte Carlo Pointsmentioning
confidence: 56%
“…For a suitable generator vector h ∈ N s+1 , the points of a rank-1 lattice sequence [7] are computed by…”
Section: Rank-1 Lattice Sequencesmentioning
confidence: 99%
“…6.4] and reported in [2,12,18,9], transferring the approach to (t, s)-sequences in a straightforward way has defects and rank-1 lattice sequences [7] have not yet been considered.…”
Section: Introductionmentioning
confidence: 99%