Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1912.10651 · Journal of Computational and Applied Mathematics

Stability of lattice rules and polynomial lattice rules constructed by the component-by-component algorithm

Josef Dick, Takashi Goda

Published Jun 11, 2020• 12 citations
arXivHTMLPDF
DOI
10.1016/j.cam.2020.113062

Related papers

Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules

Jan F. Baldeaux, Josef Dick, Gunther Leobacher +2 more

arXiv:1105.2599•Numerical Algorithms•Sep 3, 2011•56 citations

Component-by-Component Digit-by-Digit Construction of Good Polynomial Lattice Rules in Weighted Walsh Spaces

Adrian Ebert, Peter Kritzer, Onyekachi Osisiogu +1 more

arXiv:2008.08966•Constructive Approximation•Aug 25, 2021•1 citation

Component-by-Component Construction of Good Lattice Rules with a Composite Number of Points

Frances Y. Kuo, Stephen Joe

Journal of Complexity•Dec 1, 2002•43 citations

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

Adrian Ebert, Peter Kritzer, Onyekachi Osisiogu +1 more

arXiv:2101.12586•Mathematics and Computers in Simulation•Sep 14, 2021•0 citations

Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness

Adrian Ebert, Peter Kritzer, Dirk Nuyens +1 more

arXiv:2001.02978•Journal of Complexity•Feb 22, 2021•13 citations

On a projection-corrected component-by-component construction

Josef Dick, Peter Kritzer

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.

arXiv:1502.04396•Feb 16, 2015•0 citations
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.