Parallel information-based complexity of numerical integration on Sobolev class \(W_ q^ s(\Omega)\). (English) Zbl 0854.65020
This paper discusses the parallel information-based complexity of numerical integrations on the Sobolev class \(W^s_q(\Omega)\). Meanwhile, sharp bounds of the complexity are given, in which the number of the processors and the required precision are considered as two variables.
Reviewer: Wang Xinhua (Hangzhou)
MSC:
65D32 | Numerical quadrature and cubature formulas |
65Y20 | Complexity and performance of numerical algorithms |