Back to Search
Start Over
Quasi-polynomial tractability of linear problems in the average case setting.
- Source :
-
Journal of Complexity . Feb2014, Vol. 30 Issue 1, p54-68. 15p. - Publication Year :
- 2014
-
Abstract
- Abstract: We study -variate approximation problems in the average case setting with respect to a zero-mean Gaussian measure. We consider algorithms that use finitely many evaluations of arbitrary linear functionals. For the absolute error criterion, we obtain the necessary and sufficient conditions in terms of the eigenvalues of its covariance operator and obtain an estimate of the exponent of quasi-polynomial tractability which cannot be improved in general. For the linear tensor product problems, we find that the quasi-polynomial tractability is equivalent to the strong polynomial tractability. For the normalized error criterion, we solve a problem related to the Korobov kernels, which is left open in Lifshits et al. (2012). [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0885064X
- Volume :
- 30
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Journal of Complexity
- Publication Type :
- Academic Journal
- Accession number :
- 92591320
- Full Text :
- https://doi.org/10.1016/j.jco.2013.10.006