Parallel information-based complexity of numerical integration on holder class H^s,α_M (Ω)Footnote^∗

^∗ This work was supported by China State Major Key Projects for Basic Researchers.

References

• Babenko , K. I. 1985 . Some Problems in Approximation Theory and Numerical Analysis . Russian Math. Surv. , 40 ( 1 ) : 1 – 30 .
   Web of Science ®Google Scholar
• Bakhvalov , N.S. 1959 . On Approximate Computation of Integrals, (in Russian), Vestnik, MGV . Ser.Math.Mech.Astron.Phys.Chem.bf , 4 : 3 – 18 .
   Google Scholar
• Heinrich , S. and Kern , J.D . 1991 . Parallel Information-Based Complexity . J.Complexity, bf , 7 : 339 – 370 .
   Google Scholar
• Kern , J.D. 1991 . The Parallel Complexity of Function Approximation . J.Complexity , 7 : 184 – 199 .
   Google Scholar
• Novak , E. 1988 . “ Deterministic and Stochastic Error Bounds in Numerical Analysis ” . In Lecture Notes in Mathmatics , Vol. 1349 , Springer .
   Google Scholar
• Tikhomirov V.M. Some Problems of Approximation Theory, (in Russian) Mizd-vo, MGU 1976
   Google Scholar
• Tikhomirov V.M. Contemporary Problem of Mathematics (in Russian) M.rvinit, 14.(in Russian), M,: izdvo MGU 1987
   Google Scholar
• Traub , J.F. , Wasilkowski , G.W and Wozniakowski , H. 1988 . “ Information-Based Complexity ” . New York : Acad.Press, INC. .
   Google Scholar
• Traub , J.F. and Wozniakowski , H. 1991 . Information-Based Complexity: New Questions for Mathematicians . Mathematical Intelligencer , 13 : 34 – 43 .
   Google Scholar
• Vitushkin A.G. Estimation of the Complexity of the Tabulation Problem Fizmatgiz, Moscow[Russian] 1959
   Google Scholar