A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications

We study approximation properties of sequences of centered random elements Xd, d∈N, with values in separable Hilbert spaces. We focus on sequences of tensor product-type random elements, which have covariance operators of corresponding tensor product form. The average case approximation complexity n...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of Complexity Jg. 34; S. 30 - 41
1. Verfasser:	Khartov, A.A.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.06.2016
Schlagworte:	Approximation Average case approximation complexity Complexity Covariance Criteria Kernels Linear tensor product approximation problems Mathematical analysis Operators Quasi-polynomial tractability Random fields Tensors Linear tensor product approximation problems Quasi-polynomial tractability Random fields Average case approximation complexity
ISSN:	0885-064X, 1090-2708
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!