期刊文献+

THE RELATION BETWEEN nTH MINIMAL ERRORS OF TWO CLASSES OF INFORMATION FOR APPROXIMATION IN HOLDER SPACE

THE RELATION BETWEEN nTH MINIMAL ERRORS OF TWO CLASSES OF INFORMATION FOR APPROXIMATION IN HOLDER SPACE
原文传递
导出
摘要 Let H=C^r,α([0,1]^d)be Hoelder space and G=L2)[0,1]^d)with the inner product given by <g,h>G=∫[0,1]^dg(x)h(x)dx ↓Ag,h∈G.This paper considers the embedding operator S:H→G,S(f)=f,f∈H.We prove that en(S,∧^std)≤mink=0,1,…(ek(S,∧^all)^2+C·k/n·n^2(r+α)/d)^1/2,where en(S,∧^std)and en(S,∧^all)denote the nth minimal error of standard and linear information respectively in the worst case,average case and randomized settings,and C is a constant. Let be Holder space and G = L2([0, 1]d) with the inner product given byThis paper considers the embedding operator S : H →G,S(f) = f, f ∈ H . We prove thatwhere en(S,Astd ) and en(S, Aall ) denote the nth minimal error of standard and linear information respectively in the worst case, average case and randomized settings, and C is a constant.
作者 HUANGFanglun
出处 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2004年第2期197-206,共10页 系统科学与复杂性学报(英文版)
基金 This research is supported by the National Natural Science Foundation of China(Grant No. 10271001).
关键词 Hoelder空间 多元近似 MonteCarlo法 HILBERT空间 Multivariate approximation, Holder space, Monte Carlo methods and information-based complexity.
  • 相关文献

参考文献8

  • 1E. Novak, Deterministic and stochastic srror bounds in numerical analysis, Lecture Notes in Mathematics, 1988, 1349, Springer-Verlag, Berlin, 1988.
  • 2J. F. Traub and H.W'olniakowski, A General Theory of Optimal Algorithms, Academic Press, NewYork, 1980.
  • 3J. F. Traub, G. W. Wasilkowski and H. Wolniakowski, Information-Based Complexity, Academic Press, New York,.
  • 4G. W. Wasilkowski and H. Wolniakowski, On the Power of Standard Information for Weighted Approximation, Found. Comput. Math., 2001,1: 417-434.
  • 5E. Novak, Optimal Linear Randomization Methods for Linear Operators in Hilbert Spaces, J.Complexity, 1992, 8, 22-36.
  • 6S. Heinrich, Random approximation in numerical analysis, 132-171 of Functional Analysis, K. D.Bierstedt, et al., New York, Marcel Dekker, 1994.
  • 7A. Papageorgiou and G. W. Wasilkowski, On the average complexity of multivariate problems, J.Complexity, 1990, 6: 1-23.
  • 8G. W. Wasilkowski, Optimal algorithms for linear problems with gaussian measures, Rocky Mount.J. Math., 1986, 16: 727-749.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部