arXiv:1901.05752 [math.NA]AbstractReferencesReviewsResources
Tractability of non-homogeneous tensor product problems in the worst case setting
Published 2019-01-17Version 1
We study multivariate linear tensor product problems with some special properties in the worst case setting. We consider algorithms that use finitely many continuous linear functionals. We use a unified method to investigate tractability of the above multivariate problems, and obtain necessary and sufficient conditions for strong polynomial tractability, polynomial tractability, quasi-polynomial tractability, uniformly weak tractability, $(s,t)$-weak tractability, and weak tractability. Our results can apply to multivariate approximation problems with kernels corresponding to Euler kernels, Wiener kernels, Korobov kernels, Gaussian kernels, and analytic Korobov kernels.
Comments: 23 pages
Categories: math.NA
Related articles: Most relevant | Search more
arXiv:2304.14748 [math.NA] (Published 2023-04-28)
On the power of standard information for tractability for $L_\infty$ approximation of periodic functions in the worst case setting
arXiv:1411.3466 [math.NA] (Published 2014-11-13)
Notes on $(s,t)$-weak tractability: A refined classification of problems with (sub)exponential information complexity
arXiv:1802.01829 [math.NA] (Published 2018-02-06)
Average Case $(s, t)$-weak tractability of non-homogenous tensor product problems