2008
DOI: 10.1007/s10208-008-9029-x
|View full text |Cite
|
Sign up to set email alerts
|

Infinite-Dimensional Quadrature and Approximation of Distributions

Abstract: We study numerical integration of Lipschitz functionals on a Banach space by means of deterministic and randomized (Monte Carlo) algorithms. This quadrature problem is shown to be closely related to the problem of quantization and to the average Kolmogorov widths of the underlying probability measure. In addition to the general setting, we analyze, in particular, integration with respect to Gaussian measures and distributions of diffusion processes. We derive lower bounds for the worst case error of every algo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
133
0

Year Published

2009
2009
2022
2022

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 69 publications
(136 citation statements)
references
References 36 publications
3
133
0
Order By: Relevance
“…Moreover, quadrature problems are linked to the quantization problem via estimates involving both quantities. Recent results in that direction can be found in [7] (see also [20] for earlier results).…”
Section: Statement Of the Problemmentioning
confidence: 90%
“…Moreover, quadrature problems are linked to the quantization problem via estimates involving both quantities. Recent results in that direction can be found in [7] (see also [20] for earlier results).…”
Section: Statement Of the Problemmentioning
confidence: 90%
“…Since K (x j , y j ) ∈ [0, 1], we note that K γ is well defined due to (1). The reproducing kernel Hilbert space H γ :…”
Section: The Settingmentioning
confidence: 99%
“…1), and let λ satisfy (12). The FD algorithm Q FD given by (6), with d and n given by (9) and (14), and with the sample points t (i) being randomly shifted rank-1 lattice points with the generating vector obtained from the CBC algorithm, has error at most ε and cost bounded by…”
Section: Fixed Dimension Algorithmmentioning
confidence: 99%
See 2 more Smart Citations