On a projection-corrected component-by-component construction

From MaRDI portal
Publication:895985

DOI10.1016/J.JCO.2015.08.001zbMATH Open1329.65007arXiv1502.04396OpenAlexW1679376338MaRDI QIDQ895985FDOQ895985


Authors: Josef Dick, Peter Kritzer Edit this on Wikidata


Publication date: 11 December 2015

Published in: Journal of Complexity (Search for Journal in Brave)

Abstract: The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes has repeated components. We study a variation of the classical component-by-component algorithm for the construction of lattice or polynomial lattice point sets where the components are forced to differ from each other. This avoids the problem of having projections where all quadrature points lie on the main diagonal. Since the previous results on the worst-case error do not apply to this modified algorithm, we prove such an error bound here. We also discuss further restrictions on the choice of components in the component-by-component algorithm.


Full work available at URL: https://arxiv.org/abs/1502.04396




Recommendations




Cites Work


Cited In (6)





This page was built for publication: On a projection-corrected component-by-component construction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q895985)