Summary.
We construct a new algorithm for the numerical integration of functions that are defined on a \(d\)-dimensional cube. It is based on the Clenshaw-Curtis rule for \(d=1\) and on Smolyak's construction. This way we make the best use of the smoothness properties of any (nonperiodic) function. We prove error bounds showing that our algorithm is almost optimal (up to logarithmic factors) for different classes of functions with bounded mixed derivative. Numerical results show that the new method is very competitive, in particular for smooth integrands and \(d \ge 8\).
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received April 3, 1995 / Revised version received November 27, 1995
Rights and permissions
About this article
Cite this article
Novak, E., Ritter, K. High dimensional integration of smooth functions over cubes . Numer. Math. 75, 79–97 (1996). https://doi.org/10.1007/s002110050231
Issue Date:
DOI: https://doi.org/10.1007/s002110050231