Scrambled Polynomial Lattice Rules for Infinite-Dimensional Integration
Abstract
In the random case setting, scrambled polynomial lattice rules as discussed in BD10 enjoy more favourable strong tractablility properties than scrambled digital nets. This short note discusses the application of scrambled polynomial lattice rules to infinite-dimensional integration. In HMGNR10, infinite-dimensional integration in the random case setting was examined in detail, and results based on scrambled digital nets were presented. Exploiting these improved strong tractability properties of scrambled polynomial lattice rules and making use of the analysis presented in HMGNR10, we improve on the results that were achieved using scrambled digital nets.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.