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• 14 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•55 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

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

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•14 citations

The construction of good lattice rules and polynomial lattice rules

Dirk Nuyens

A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by the optimal rate of convergence for the function space. The focus is on algebraic rates of convergence $O(N^{-α+ε})$ for $α\ge 1$ and any $ε> 0$, where $α$ is the decay of a series representation of the integrand function. The dependence of the implied constant on the dimension can be controlled by weights which determine the influence of the different dimensions. Different types of weights are discussed. The construction of good lattice rules, and polynomial lattice rules, can be done using the same method for all $1 < p \le \infty$; but the case $p=1$ is special from the construction point of view. For $1 < p \le \infty$ the component-by-component construction and its fast algorithm for different weighted function spaces is then discussed.

arXiv:1308.3601•De Gruyter eBooks•Jul 25, 2014•47 citations
A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on ℓp\ell_pℓp​ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by the optimal rate of convergence for the function space. The focus is on algebraic rates of convergence O(N−α+ε)O(N^{-α+ε})O(N−α+ε) for α≥1α\ge 1α≥1 and any ε>0ε> 0ε>0, where ααα is the decay of a series representation of the integrand function. The dependence of the implied constant on the dimension can be controlled by weights which determine the influence of the different dimensions. Different types of weights are discussed. The construction of good lattice rules, and polynomial lattice rules, can be done using the same method for all 1<p≤∞1 < p \le \infty1<p≤∞; but the case p=1p=1p=1 is special from the construction point of view. For 1<p≤∞1 < p \le \infty1<p≤∞ the component-by-component construction and its fast algorithm for different weighted function spaces is then discussed.