IDEAS home Printed from https://ideas.repec.org/a/bpj/mcmeap/v10y2004i3-4p499-509n32.html
   My bibliography  Save this article

Optimal Korobov Coefficients for Good Lattice Points in Quasi Monte Carlo Algorithms

Author

Listed:
  • Papancheva R. Y.

Abstract

The optimal coefficients in the sense of Korobov serve for obtaining good lattice points sets. By using these sets for multidimensional numerical integration, numerical solution of integral equation and other related applications, the relative error of corresponding Quasi Monte Carlo algorithms can be kept relatively small. This study deals with finding optimal coefficients for good lattice points for high dimensional problems in weighted Sobolev and Korobov spaces. Two Quasi Monte Carlo algorithms for boundary value problems are proposed and analyzed. For the first of them the coefficients that characterize the good lattice points are found “component-by-component”: the (k + l)th coefficient is obtained by one-dimensional search with all previous k coefficients kept unchanged. For the second algorithm, the coefficients depending on single parameter are found in Korobov's form. Some numerical experiments are made to illustrate the obtained results.

Suggested Citation

  • Papancheva R. Y., 2004. "Optimal Korobov Coefficients for Good Lattice Points in Quasi Monte Carlo Algorithms," Monte Carlo Methods and Applications, De Gruyter, vol. 10(3-4), pages 499-509, December.
    • Handle: RePEc:bpj:mcmeap:v:10:y:2004:i:3-4:p:499-509:n:32
    DOI: 10.1515/mcma.2004.10.3-4.499
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/mcma.2004.10.3-4.499
    Download Restriction: For access to full text, subscription to the journal or payment for the individual article is required.
    File URL: https://libkey.io/10.1515/mcma.2004.10.3-4.499?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.

    More about this item

    Statistics

    Access and download statistics

    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:bpj:mcmeap:v:10:y:2004:i:3-4:p:499-509:n:32. 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: Peter Golla (email available below). General contact details of provider: https://www.degruyter.com .

    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.