COMPUTATIONAL COMPLEXITY IN WORST, STOCHASTIC AND AVERAGE CASE SETTING ON FUNCTIONAL APPROXIMATION PROBLEM OF MULTIVARIA
The order of computational complexity of all bounded linear functional approximation problem is determined for the generalized Sobolev class Wp∧(Id), Nikolskii class Hk∞(Id) in the worst (deterministic), stochastic and average case setting, from which it is concluded that the bounded linear functional approximation problem for the classes stochastic and average case setting.
作 者： Fang Gensun YE Peixin 作者单位： Fang Gensun(School of Mathematical Sciences, Beijing Normal University, Beijing 100875, China)YE Peixin(School of Mathematical Sciences and LPMC, Nankai university, Tianjin 300071, China)
刊 名： 数学物理学报（英文版） ISTIC SCI 英文刊名： ACTA MATHEMATICA SCIENTIA 年，卷(期)： 2005 25(3) 分类号： O41 关键词： Worst (deterministic) case stochastic case average case setting bounded linear functional error estimate