The information-based complexity of approximation problem by adaptive Monte Carlo methods

• 来源期刊: 中国科学A辑(英文版)
• 年，卷（期）: 2008,（9）
• 页码范围: 1679-1689
• 页数: 11页
• 语种: 英文
• DOI: 10.1007/s11425-008-0008-0

摘要

In this paper,we study the complexity of information of approximation problem on the multivariate Sobolev space with bounded mixed derivative MWTp,α(Td),1＜p＜∞,in the norm of Lq(Td),1＜q＜∞,by adaptive Monte Carlo methods.Applying the discretization technique and some properties of pseudo-s-scale,we determine the exact asymptotic orders of this problem.