您当前所在位置: 首页 > 学者

叶培新

  • 55浏览

  • 0点赞

  • 0收藏

  • 0分享

  • 277下载

  • 0评论

  • 引用

期刊论文

Computational complexity of the integration problem for anisotropic classes

叶培新Ye Peixin

Advances in Computational Mathematics (2005) 23: 375–392 ,-0001,():

URL:

摘要/描述

We determine the exact order of ε-complexity of the numerical integration problem for the anisotropic class Wr∞ (I d ) and Hr∞ (I d ) with respect to the worst case randomized methods and the average case deterministic methods. We prove this result by developing a decomposition technique of Borel measure on unit cube of d-dimensional Euclidean space. Moreover by the imbedding relationship between function classes we extend our results to the classes of functions W^ p (I d ) and H^ p (I d ). By the way we highlight some typical results and stress the importance of some open problems related to the complexity of numerical integration.

【免责声明】以下全部内容由[叶培新]上传于[2008年03月26日 09时49分19秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。

我要评论

全部评论 0

本学者其他成果

    同领域成果