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

Construction of good polynomial lattice rules in weighted Walsh spaces by an alternative component-by-component construction

Author

Listed:
  • Ebert, Adrian
  • Kritzer, Peter
  • Osisiogu, Onyekachi
  • Stepaniuk, Tetiana

Abstract

We study the efficient construction of good polynomial lattice rules, which are special instances of quasi-Monte Carlo (QMC) methods. The integration rules obtained are of particular interest for the approximation of multivariate integrals in weighted Walsh spaces. In particular, we study a construction algorithm which assembles the components of the generating vector, which is in this case a vector of polynomials over a finite field, of the polynomial lattice rule in a component-wise fashion. We show that the constructed QMC rules achieve the almost optimal error convergence order in the function spaces under consideration and prove that the obtained error bounds can, under certain conditions on the involved weights, be made independent of the dimension. We also demonstrate that our alternative component-by-component construction, which is independent of the underlying smoothness of the function space, can be implemented relatively easily in a fast manner. Numerical experiments confirm our theoretical findings.

Suggested Citation

  • Ebert, Adrian & Kritzer, Peter & Osisiogu, Onyekachi & Stepaniuk, Tetiana, 2022. "Construction of good polynomial lattice rules in weighted Walsh spaces by an alternative component-by-component construction," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 192(C), pages 399-419.
    • Handle: RePEc:eee:matcom:v:192:y:2022:i:c:p:399-419
    DOI: 10.1016/j.matcom.2021.09.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475421003220
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2021.09.007?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:192:y:2022:i:c:p:399-419. 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.