摘要
This paper deals with the parallel information-based complexity of numerical integration on Sobolev class. We obtain tight bounds on the complexity, considered as a function of two variables simultaneously:the number of processors, the rquired precision. This result seems to be new even in serial case.
This paper deals with the parallel information-based complexity of numerical integration on Sobolev class. We obtain tight bounds on the complexity, considered as a function of two variables simultaneously:the number of processors, the rquired precision. This result seems to be new even in serial case.
基金
this work was supported by china State Major Key Project for Basic Researchers
