IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v182y2021icp277-295.html
   My bibliography  Save this article

Walsh functions, scrambled (0,m,s)-nets, and negative covariance: Applying symbolic computation to quasi-Monte Carlo integration

Author

Listed:
  • Wiart, Jaspar
  • Wong, Elaine

Abstract

We investigate base b Walsh functions for which the variance of the integral estimator based on a scrambled (0,m,s)-net in base b is less than or equal to that of the Monte-Carlo estimator based on the same number of points. First we compute the Walsh decomposition for the joint probability density function of two distinct points randomly chosen from a scrambled (t,m,s)-net in base b in terms of certain counting numbers and simplify it in the special case t is zero. Using this, we obtain an expression for the covariance of the integral estimator in terms of the Walsh coefficients of the function. Finally, we prove that the covariance of the integral estimator is negative when the Walsh coefficients of the function satisfy a certain decay condition. To do this, we use creative telescoping and recurrence solving algorithms from symbolic computation to find a sign equivalent closed form expression for the covariance term.

Suggested Citation

  • Wiart, Jaspar & Wong, Elaine, 2021. "Walsh functions, scrambled (0,m,s)-nets, and negative covariance: Applying symbolic computation to quasi-Monte Carlo integration," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 182(C), pages 277-295.
    • Handle: RePEc:eee:matcom:v:182:y:2021:i:c:p:277-295
    DOI: 10.1016/j.matcom.2020.10.026
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475420303815
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2020.10.026?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:182:y:2021:i:c:p:277-295. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.