期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
The information-based complexity of approximation problem by adaptive Monte Carlo methods 被引量:2
1
作者 FANG GenSun DUAN LiQin 《Science China Mathematics》 SCIE 2008年第9期1679-1689,共11页
In this paper, we study the complexity of information of approximation problem on the multivariate Sobolev space with bounded mixed derivative MW p,α r ( $ \mathbb{T}^d $ ), 1 < p < ∞, in the norm of L q ( $ \... In this paper, we study the complexity of information of approximation problem on the multivariate Sobolev space with bounded mixed derivative MW p,α r ( $ \mathbb{T}^d $ ), 1 < p < ∞, in the norm of L q ( $ \mathbb{T}^d $ ), 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. 展开更多
关键词 adaptive Monte carlo method Sobolev space with bounded mixed derivative asymptotic order 41A46 41A63 65c05 65D99
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部