Abstract
It has been shown by Hickernell and Niederreiter that there exist generating vectors for integration lattices which yield small integration errors for n = p, p 2 ,... for all integers p ≥ 2. This paper provides algorithms for the construction of generating vectors which are finitely extensible for n = p, p 2 ,... for all integers p ≥ 2. The proofs which show that our algorithms yield good extensible rank-1 lattices are based on a sieve principle. Particularly fast algorithms are obtained by using the fast component-by-component construction of Nuyens and Cools. Analogous results are presented for generating vectors with small weighted star discrepancy.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
