【摘要】 该文主要研究最坏框架下加权Korobov空间中多元L_∞-逼近问题的指数易处理性.多元逼近问题中的算法使用的信息取自由线性泛函组成的线性信息类Λ^all和函数值组成的标准信息类Λ^std.该问题的指数收敛-拟多项式易处理性和指数收敛-一致弱易处理性之前并没有被研究,该文最终通过两个权参数序列给出使得多元L_∞-逼近问题具有这两种指数收敛易处理性的充分必要条件.更多还原

【Abstract】 In this paper we study exponential tractability of multivariate L_∞-approximation for weighted Korobov spaces in the worst case setting.We consider all algorithms that use the classΛ^all of all linear functionals and the class Λ^std of only function evaluations as information.We give matching necessary and sufficient conditions for notions of EC-quasi-polynomial tractability and ECuniform weak tractability which have not been discussed before in terms of two weight parameters of the problem.更多还原