High-Discrepancy Sequences for High-Dimensional Numerical Integration

  • Shu Tezuka
Conference paper
Part of the Springer Proceedings in Mathematics & Statistics book series (PROMS, volume 23)


In this paper, we consider a sequence of points in [0, 1] d , which are distributed only on the diagonal line between \((0,\ldots ,0)\) and \((1,\ldots ,1)\). The sequence is constructed based on a one-dimensional low-discrepancy sequence. We apply such sequences to d-dimensional numerical integration for two classes of integrals. The first class includes isotropic integrals. Under a certain condition, we prove that the integration error for this class is \(O(\sqrt{\log N}/N)\), where N is the number of points. The second class is called as Kolmogorov superposition integrals for which, under a certain condition, we prove that the integration error for this class is \(O((\log N)/N)\).


Option Price Diagonal Line Software Implementation Normal Distribution Function Risk Free Rate 
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.



The author thanks the anonymous referees for their valuable comments. This research was supported by KAKENHI(22540141).


  1. 1.
    J. Braun amd M. Griebel, On a Constructive Proof of Kolmogorov’s Superposition Theorem, Constructive Approximation, 30 (2009), 653–675.Google Scholar
  2. 2.
    B. D. Keister, Multidimensional Quadrature Algorithms, Computers in Physics, 10(20) (1996), 119–122.Google Scholar
  3. 3.
    C. Lemieux, Monte Carlo and Quasi-Monte Carlo Sampling, Springer, 2009.Google Scholar
  4. 4.
    H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, CBMS-NSF Regional Conference Series in Applied Mathematics, No. 63, SIAM, 1992.Google Scholar
  5. 5.
    E. Novak and H. Woźniakowski, Tractability of Multivariate Problems, Volume II: Standard Information for Functionals, European Mathematical Society, 2010.Google Scholar
  6. 6.
    O. Strauch and Š. Porubský, Distribution of Sequences: A Sampler, Peter Lang, 2005.Google Scholar
  7. 7.
    A. Papageorgiou, Fast Convergence of Quasi-Monte Carlo for a Class of Isotropic Integrals, Mathematics of Computation 70 (2001), 297–306.Google Scholar
  8. 8.
    A. Papageorgiou, Sufficient Conditions for Fast Quasi-Monte Carlo Convergence, Journal of Complexity, 19 (2003), 332–351.Google Scholar
  9. 9.
    A. Papageorgiou and J. F. Traub, Faster Evaluation of Multidimensional Integrals, Computers in Phyics, 11(6) (1997), 574–578.Google Scholar
  10. 10.
    S. Tezuka, Uniform Random Numbers: Theory and Practice, Kluwer Academic Publishers, 1995.Google Scholar
  11. 11.
    S. Tezuka, High-Discrepancy Sequences, Kyushu Journal of Mathematics, 61 (2007), 431–441.Google Scholar
  12. 12.
    S. Tezuka, Scrambling Non-Uniform Nets, Mathematica Slovaca, 59 (2009), 379–386.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Faculty of MathematicsKyushu UniversityFukuoka-shiJapan

Personalised recommendations