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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of Complexity Vol. 34; pp. 30 - 41
Main Author:	Khartov, A.A.
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.06.2016
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!