Skip to main content
Log in

Polynomial approximations of multivariate smooth functions from quasi-random data

  • Published:
Statistics and Computing Aims and scope Submit manuscript

Abstract

We improve a Monte Carlo algorithm which computes accurate approximations of smooth functions on multidimensional Tchebychef polynomials by using quasi-random sequences. We first show that the convergence of the previous algorithm is twice faster using these sequences. Then, we slightly modify this algorithm to make it work from a single set of random or quasi-random points. This especially leads to a Quasi-Monte Carlo method with an increased rate of convergence for numerical integration.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Atanassov E.I. and Dimov I.T. 1999. A new optimal Monte Carlo method for calculating integral of smooth functions. Monte Carlo Methods and Appl. 5(2): 149–167.

    Google Scholar 

  • Bernardi C. and Maday Y. 1992. Approximations spectrales de problèmes aux limites elliptiques. Springer-Verlag.

  • Kalos M.H. and Whitlock P.A. 1986. Monte Carlo Methods. John Wiley & Sons.

  • Krommer A.R. and Ueberhuber A.R. 1998. Computational integration. SIAM.

  • Lapeyre B., Pardoux B., and Sentis B. 1998. Méthodes de Monte-Carlo pour les èquations de transport et de diffusion. Springer-Verlag.

  • Lepage G.P. 1978. A new algorithm for adaptative multidimensional integration. Journal of Computational Physics 27: 192–203.

    Article  Google Scholar 

  • Maire S. 2003a. Reducing variance using iterated control variates. The Journal of Statistical Computation and Simulation 73(1): 1–29.

    Article  Google Scholar 

  • Maire S. 2003b. An iterative computation of approximations on Korobov-like spaces. Journal of Computational and Applied Mathematics 157: 261–281.

    Article  Google Scholar 

  • Niederreiter H. 1987. Point sets and sequences with small discrepancy. Monatsh. Math. 104: 273–337.

    Google Scholar 

  • Niederreiter H. 1992. Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia.

    Google Scholar 

  • Pages G. 1997. A space vector quantization for numerical integration. Journal of Computational and Applied Mathematics 89: 1–38.

    Article  Google Scholar 

  • Sobol I.M. 1967. The distibutions of points in a cube and the approxiamate evaluation of integrals. Zh. Vychisl. Mat. I. Mat. Fiz 784–802.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maire, S. Polynomial approximations of multivariate smooth functions from quasi-random data. Statistics and Computing 14, 333–336 (2004). https://doi.org/10.1023/B:STCO.0000039482.91826.ce

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:STCO.0000039482.91826.ce

Navigation