2011
DOI: 10.1016/j.jco.2011.01.006
|View full text |Cite
|
Sign up to set email alerts
|

Tractability of infinite-dimensional integration in the worst case and randomized settings

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
105
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
6
4

Relationship

2
8

Authors

Journals

citations
Cited by 44 publications
(105 citation statements)
references
References 14 publications
0
105
0
Order By: Relevance
“…The cost can be dramatically reduced if we use instead multi-level and/or changing dimension algorithms which have been analyzed in a number of recent papers, see e.g. [20,23,15,12,26] for infinite dimensional integration, and e.g. [4,1,2] for applications in PDEs.…”
Section: F Y Kuo Ch Schwab and I H Sloanmentioning
confidence: 99%
“…The cost can be dramatically reduced if we use instead multi-level and/or changing dimension algorithms which have been analyzed in a number of recent papers, see e.g. [20,23,15,12,26] for infinite dimensional integration, and e.g. [4,1,2] for applications in PDEs.…”
Section: F Y Kuo Ch Schwab and I H Sloanmentioning
confidence: 99%
“…Passing to a subsequence we may assume that f n → f almost surely. (13) Again passing to a subsequence we may assume…”
Section: Proof Of Uniqueness In Lemma 3 To Verify This Fact Letmentioning
confidence: 99%
“…The model considered here, as in [24], is infinite dimensional. Previous treatments of infinite-dimensional quadrature include [17,25,27] with QMC methods [21], with MC methods, and [30] with Smolyak (or sparse-grid) quadrature. Applications of QMC methods to the "lognormal case" are considered in [18,19].…”
mentioning
confidence: 99%