Optimal Korobov Coefficients for Good Lattice Points in Quasi Monte Carlo Algorithms
Papancheva R. Y.
Monte Carlo Methods and Applications, 2004, vol. 10, issue 3-4, 499-509
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.
Date: 2004
References: Add references at CitEc
Citations:
Downloads: (external link)
https://doi.org/10.1515/mcma.2004.10.3-4.499 (text/html)
For access to full text, subscription to the journal or payment for the individual article is required.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:bpj:mcmeap:v:10:y:2004:i:3-4:p:499-509:n:32
Ordering information: This journal article can be ordered from
https://www.degruyter.com/journal/key/mcma/html
DOI: 10.1515/mcma.2004.10.3-4.499
Access Statistics for this article
Monte Carlo Methods and Applications is currently edited by Karl K. Sabelfeld
More articles in Monte Carlo Methods and Applications from De Gruyter
Bibliographic data for series maintained by Peter Golla ().