首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   6篇
  完全免费   1篇
  数学   7篇
  2018年   1篇
  2014年   2篇
  2012年   1篇
  2010年   1篇
  2002年   1篇
  2001年   1篇
排序方式: 共有7条查询结果,搜索用时 69 毫秒
1
1.
In this paper, we obtain some Gel'fand widths of anisotropic Sobolev periodic classes of smooth functions, and average Gel'fand widths of anisotropic Sobolev classes of smooth functions.  相似文献
2.
We constructed a kind of continuous multivariate spline operators as the approximation tools of the multivariate functions on the (ℝd instead of the usual multivariate cardinal interpolation operators of splines, and obtained the approximation error by this kind of spline operators. Meantime, by the results, we also obtained that the spaces of multivariate polynomial splines are weakly asyrnptotically optimal for the Kolrnogorov widths and the linear widths of some anisotropic Sobolev classes of smooth functions on (ℝd in the metric Lp((ℝd).  相似文献
3.
We study dd-variate approximation problems in the average case setting with respect to a zero-mean Gaussian measure. We consider algorithms that use finitely many evaluations of arbitrary linear functionals. For the absolute error criterion, we obtain the necessary and sufficient conditions in terms of the eigenvalues of its covariance operator and obtain an estimate of the exponent tqpol-avgtqpol-avg of quasi-polynomial tractability which cannot be improved in general. For the linear tensor product problems, we find that the quasi-polynomial tractability is equivalent to the strong polynomial tractability. For the normalized error criterion, we solve a problem related to the Korobov kernels, which is left open in Lifshits et al. (2012).  相似文献
4.
We study dd-variate approximation problems in the worst and average case settings. We consider algorithms that use finitely many evaluations of arbitrary linear functionals. In the worst case setting, we obtain necessary and sufficient conditions for quasi-polynomial tractability and uniform weak tractability. Furthermore, we give an estimate of the exponent of quasi-polynomial tractability which cannot be improved in general. In the average case setting, we obtain necessary and sufficient conditions for uniform weak tractability. As applications we discuss some examples.  相似文献
5.
For 1 ? p < ∞, firstly we prove that for an arbitrary set of distinct nodes in [?1, 1], it is impossible that the errors of the Hermite-Fejér interpolation approximation in L p -norm are weakly equivalent to the corresponding errors of the best polynomial approximation for all continuous functions on [?1, 1]. Secondly, on the ground of probability theory, we discuss the p-average errors of Hermite-Fejér interpolation sequence based on the extended Chebyshev nodes of the second kind on the Wiener space. By our results we know that for 1 ? p < ∞ and 2 ? q < ∞, the p-average errors of Hermite-Fejér interpolation approximation sequence based on the extended Chebyshev nodes of the second kind are weakly equivalent to the p-average errors of the corresponding best polynomial approximation sequence for L q -norm approximation. In comparison with these results, we discuss the p-average errors of Hermite-Fejér interpolation approximation sequence based on the Chebyshev nodes of the second kind and the p-average errors of the well-known Bernstein polynomial approximation sequence on the Wiener space.  相似文献
6.
We study approximation problems for infinitely differentiable multivariate functions in the worst-case setting. Using a series of information-based algorithms as approximation tools, in which each algorithm is constructed by performing finitely many standard information operations, we prove that the L-approximation problem is exponentially convergent. As a corollary, we show that the corresponding integral problem is exponentially convergent as well.  相似文献
7.
For the weighted approximation in Lp-norm,the authors determine the weakly asymptotic order for the p-average errors of the sequence of Hermite interpolation based on the Chebyshev nodes on the 1-fold integrated Wiener space.By this result,it is known that in the sense of information-based complexity,if permissible information functionals are Hermite data,then the p-average errors of this sequence are weakly equivalent to those of the corresponding sequence of the minimal p-average radius of nonadaptive information.  相似文献
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号