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:1404.5497 · Journal of Computational and Applied Mathematics

A reduced fast component-by-component construction of lattice points for integration in weighted spaces with fast decreasing weights

Josef Dick, Peter Kritzer, Gunther Leobacher, Friedrich Pillichshammer

Published Aug 27, 2014• 19 citations
arXivHTMLPDF
DOI
10.1016/j.cam.2014.08.017

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

Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces

Frances Y. Kuo

Journal of Complexity•Mar 25, 2003•161 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

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

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

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
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.