COMPUTATIONAL COMPLEXITY IN WORST, S

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  

【COMPUTATIONAL COMPLEXITY IN WORST, S】相关文章：

基于C/S/S+B/W/S/S混合模型安全系统的分析与设计04-26

Father‘s love06-03

学科术语 S05-04

5s的口号03-17

小S的介绍档案10-25

7S教案04-25

Overcoming Writer’s Block05-04

A Present for Father’s Day05-04

The King‘s Brother 国王的兄弟05-20

5s整改方案09-04