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

Hiding the weights—CBC black box algorithms with a guaranteed error bound

Author

Listed:
  • Gilbert, Alexander D.
  • Kuo, Frances Y.
  • Sloan, Ian H.

Abstract

The component-by-component (CBC) algorithm is a method for constructing good generating vectors for lattice rules for the efficient computation of high-dimensional integrals in the “weighted” function space setting introduced by Sloan and Woźniakowski. The “weights” that define such spaces are needed as inputs into the CBC algorithm, and so a natural question is, for a given problem how does one choose the weights? This paper introduces two new CBC algorithms which, given bounds on the mixed first derivatives of the integrand, produce a randomly shifted lattice rule with a guaranteed bound on the root-mean-square error. This alleviates the need for the user to specify the weights. We deal with “product weights” and “product and order dependent (POD) weights”. Numerical tables compare the two algorithms under various assumed bounds on the mixed first derivatives, and provide rigorous upper bounds on the root-mean-square integration error.

Suggested Citation

  • Gilbert, Alexander D. & Kuo, Frances Y. & Sloan, Ian H., 2018. "Hiding the weights—CBC black box algorithms with a guaranteed error bound," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 143(C), pages 202-214.
    • Handle: RePEc:eee:matcom:v:143:y:2018:i:c:p:202-214
    DOI: 10.1016/j.matcom.2016.06.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037847541630091X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2016.06.005?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:143:y:2018:i:c:p:202-214. 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.