期刊
JOURNAL OF COMPLEXITY
卷 30, 期 6, 页码 735-749出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jco.2014.02.007
关键词
Quasi-polynomial tractability; Uniform weak tractability; Linear problem; Eigenvalue
资金
- National Natural Science Foundation of China [11271263]
We study d-variate approximation problems in the worst and average case settings. We consider algorithms that use finitely many evaluations of arbitrary linear functionals. In the worst case setting, we obtain necessary and sufficient conditions for quasi-polynomial tractability and uniform weak tractability. Furthermore, we give an estimate of the exponent of quasi-polynomial tractability which cannot be improved in general. In the average case setting, we obtain necessary and sufficient conditions for uniform weak tractability. As applications we discuss some examples. (C) 2014 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据