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:2208.13610 · Journal of Complexity

A note on the CBC-DBD construction of lattice rules with general positive weights

Peter Kritzer

Published Dec 7, 2022• 1 citation
arXivHTMLPDF
DOI
10.1016/j.jco.2022.101721

Related papers

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

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

Josef Dick, Takashi Goda

arXiv:1912.10651•Journal of Computational and Applied Mathematics•Jun 11, 2020•14 citations

Fast CBC construction of randomly shifted lattice rules achieving O ( n − 1 + δ ) convergence for unbounded integrands over R s in weighted spaces with POD weights

James Nichols, Frances Y. Kuo

Journal of Complexity•Feb 11, 2014•50 citations

Exact results on a general lattice statistical model

Fa Yueh Wu

Solid State Communications•Jan 1, 1972•21 citations

QUASI-MONTE CARLO METHODS FOR HIGH-DIMENSIONAL INTEGRATION: THE STANDARD (WEIGHTED HILBERT SPACE) SETTING AND BEYOND

Frances Y. Kuo, Christoph Schwab, Ian H. Sloan

Abstract This paper is a contemporary review of quasi-Monte Carlo (QMC) methods, that is, equal-weight rules for the approximate evaluation of high-dimensional integrals over the unit cube [0,1] s . It first introduces the by-now standard setting of weighted Hilbert spaces of functions with square-integrable mixed first derivatives, and then indicates alternative settings, such as non-Hilbert spaces, that can sometimes be more suitable. Original contributions include the extension of the fast component-by-component (CBC) construction of lattice rules that achieve the optimal convergence order (a rate of almost 1/ N , where N is the number of points, independently of dimension) to so-called “product and order dependent” (POD) weights, as seen in some recent applications. Although the paper has a strong focus on lattice rules, the function space settings are applicable to all QMC methods. Furthermore, the error analysis and construction of lattice rules can be adapted to polynomial lattice rules from the family of digital nets.

ANZIAM Journal•Jul 1, 2011•87 citations

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
Abstract This paper is a contemporary review of quasi-Monte Carlo (QMC) methods, that is, equal-weight rules for the approximate evaluation of high-dimensional integrals over the unit cube [0,1] s . It first introduces the by-now standard setting of weighted Hilbert spaces of functions with square-integrable mixed first derivatives, and then indicates alternative settings, such as non-Hilbert spaces, that can sometimes be more suitable. Original contributions include the extension of the fast component-by-component (CBC) construction of lattice rules that achieve the optimal convergence order (a rate of almost 1/ N , where N is the number of points, independently of dimension) to so-called “product and order dependent” (POD) weights, as seen in some recent applications. Although the paper has a strong focus on lattice rules, the function space settings are applicable to all QMC methods. Furthermore, the error analysis and construction of lattice rules can be adapted to polynomial lattice rules from the family of digital nets.