2012
DOI: 10.1007/978-3-642-27440-4_11
|View full text |Cite
|
Sign up to set email alerts
|

Scrambled Polynomial Lattice Rules for Infinite-Dimensional Integration

Abstract: In the random case setting, scrambled polynomial lattice rules as discussed in [1] 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 [5], 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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
26
0

Year Published

2013
2013
2017
2017

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 12 publications
(28 citation statements)
references
References 16 publications
2
26
0
Order By: Relevance
“…Obviously, the assumption (A1) and (A2) are satisfied, and we have equivalence of the norms · and · H , given by (2). It follows that H, equipped with · H , is a reproducing kernel Hilbert space, too.…”
Section: Embedding Results and Norm Estimatesmentioning
confidence: 88%
“…Obviously, the assumption (A1) and (A2) are satisfied, and we have equivalence of the norms · and · H , given by (2). It follows that H, equipped with · H , is a reproducing kernel Hilbert space, too.…”
Section: Embedding Results and Norm Estimatesmentioning
confidence: 88%
“…In a series of papers, see e.g. Gnewuch (2012aGnewuch ( , 2012b, Hickernell et al (2010), Niu et al (2011), Baldeaux (2012b, Baldeaux and Gnewuch (2012), it was shown how to combine biased qMC rules using a multilevel approach to recover the optimal qMC rate. We refer the reader to these references for details.…”
Section: Multilevel Quasi-monte Carlo Methodsmentioning
confidence: 99%
“…The Multivariate Decomposition Method (MDM) proposed in [35,43,44] is a generalisation of the Changing Dimension Algorithm in [28,34]. Here too it is assumed that an expansion of the form (1) exists, and that values of f u (x u ), while not available explicitly, can be obtained by a modest number of evaluations of f (x). In Section 5 we give specific examples in which values of f u (x u ) can be obtained from at most 2 |u| evaluations of f (x) -an acceptably small number if the cardinality |u| is small.…”
Section: Introductionmentioning
confidence: 99%
“…To approximate the integral (5), the MDM uses the decomposition of f given in (1). Indeed, assuming that the partial sums in (3) converge dominantly to f , we have…”
Section: Introductionmentioning
confidence: 99%