Numerical Algorithms

, Volume 26, Issue 2, pp 93–109 | Cite as

Fast calculation of coefficients in the Smolyak algorithm

  • Knut Petras


For many numerical problems involving smooth multivariate functions on d-cubes, the so-called Smolyak algorithm (or Boolean method, sparse grid method, etc.) has proved to be very useful. The final form of the algorithm (see equation (12) below) requires functional evaluation as well as the computation of coefficients. The latter can be done in different ways that may have considerable influence on the total cost of the algorithm. In this paper, we try to diminish this influence as far as possible. For example, we present an algorithm for the integration problem that reduces the time for the calculation and exposition of the coefficients in such a way that for increasing dimension, this time is small compared to dn, where n is the number of involved function values.


Numerical Problem Functional Evaluation Considerable Influence Fast Calculation Grid Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    H. Brass, Quadraturverfahren (Vandenhoeck & Ruprecht, Göttingen, 1977).Google Scholar
  2. [2]
    R. Cools and B. Maerten, Experiments with Smolyak's algorithm for integration over a hypercube, Internal report, Department of Computer Science, Katholieke Universiteit Leuven (1997).Google Scholar
  3. [3]
    T. Gerstner and M. Griebel, Numerical integration using sparse grids, Numer. Algorithms 18 (1998) 209–232.Google Scholar
  4. [4]
    G. Hämmerlin and K.-H. Hoffmann, Numerische Mathematik (Springer, Berlin, 1989).Google Scholar
  5. [5]
    Th. Müller-Gronbach, Hyperbolic cross designs for approximatin of random fields, J. Statist. Plann. Inference 49 (1997) 371–385.Google Scholar
  6. [6]
    E. Novak and K. Ritter, High-dimensional integration of smooth functions over cubes, Numer. Math. 75 (1996) 79–97.Google Scholar
  7. [7]
    E. Novak and K. Ritter, Simple cubature formulas with high polynomial exactness, Constr. Approx. 15 (1999) 499–522.Google Scholar
  8. [8]
    E. Novak, K. Ritter and A. Steinbauer, A multiscale method for the evaluation of Wiener integrals, in: Approximation Theory IX, Vol. 2, eds. C.K. Chui and L.L. Schumaker (Vanderbilt Univ. Press, Nashville, TN, 1998) pp. 251–258.Google Scholar
  9. [9]
    T.N.L. Patterson, The optimum addition of points to quadrature formulae, Math. Comp. 22 (1968) 847–856.Google Scholar
  10. [10]
    K. Petras, On the Smolyak cubature error for analytic functions, Adv. Comput. Math. 12 (2000) 71–93.Google Scholar
  11. [11]
    K. Petras, Asymptotically minimal Smolyak cubature, preprint, available on http://wwwpublic.∼petras/software.html.Google Scholar
  12. [12]
    I.H. Sloan and S. Joe, Lattice Methods for Multiple Integration (Clarendon Press, Oxford, 1994).Google Scholar
  13. [13]
    S.A. Smolyak, Quadrature and interpolation formulas for tensor products of certain classes of functions, Soviet Math. Dokl. 4 (1963) 240–243.Google Scholar
  14. [14]
    S. Tezuka, Financial applications of Monte Carlo and quasi-Monte Carlo methods. Random and quasirandom point sets, in: Lecture Notes in Statistics, Vol. 138 (Springer, New York) pp. 303–332.Google Scholar
  15. [15]
    G.W. Wasilkowski and H. Woźniakowski, Explicit cost bounds of algorithms for multivariate tensor product problems, J. Complexity 11 (1995) 1–56.Google Scholar

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Knut Petras
    • 1
  1. 1.Institut für Angewandte MathematikTechnische Universität BraunschweigBraunschweigGermany

Personalised recommendations