Skip to content
DraconiticResearch
Search Sources API
186,541 studies31 sourcesUpdated 14 min ago
PreprintCC BY-NC-ND 4.0arXiv

A higher order lattice-based method for high-dimensional numerical integration using periodization

Abstract

We present a novel numerical integration method for non-periodic functions over the high-dimensional unit cube [0,1]s by a specially crafted (unequally-)weighted quadrature rule using transformed lattice points, with the additional option of subsampling. The method is designed for integrands whose mixed derivatives up to order α are square-integrable with respect to a product Chebyshev density. The ingredients are (i) periodizing the integrand, (ii) approximating the smooth periodic function by a kernel interpolant at lattice points, (iii) integrating exactly the product of the kernel interpolant and the nonsmooth density, together with subsampling alternatives for (ii) and~(iii). With |J| corresponding to the number of function evaluations, we achieve the convergence rate close to the order |J|−(α−1/2) and |J|−α (1.110721)s, where the implied constants are independent of s under favorable conditions. We can interpolate these two results to trade between the convergence rate and the growth in s. We provide numerical experiments to demonstrate our theory.

Related

  1. A gentle introduction to approximating high-dimensional integrals with lattice rules and a maybe-not-so-gentle introduction to the relevant function spaces for QMC integration
    Dirk Nuyens
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  2. NUMERICAL ANALYSIS OF A LAX-WENDROFF TYPE LATTICE BOLTZMANN SCHEME FOR THE ADVECTION EQUATION
    Thomas Bellotti, Filipa Caetano, François Dubois +1
    HALPreprintCC BY-NC-ND 4.0Full textNumerical analysis & scientific computingHALarXiv
  3. Direct Vertex-Derivative Coefficient Propagation for Homogeneous Numerical Integration (HNI)
    Jean B Lasserre
    HALPreprintCC BY 4.0Full textOptimisation & controlHALarXiv
  4. Numerical Integration on Bounded Domains via Learned Reflected Diffusions
    Kirill Korolev, Artur Goldman, Timofei Gritsaev +2
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  5. Random Pullback Attractors and Numerical Approximation for Nonlocal Lattice Delay Equations Driven by Rough Noise
    Lijuan Zhang, Jiangwei Zhang, Jianhua Huang
    arXivPreprintarXiv licenceFull textDynamical systemsarXiv
BibTeX
@misc{bartel2026higher,
  title = {{A higher order lattice-based method for high-dimensional numerical integration using periodization}},
  author = {Felix Bartel and Alexander D. Gilbert and Michael Griebel and Frances Y. Kuo and Ian H. Sloan},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.01113},
  eprint = {2610.01113},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.01113},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - A higher order lattice-based method for high-dimensional numerical integration using periodization
AU  - Felix Bartel
AU  - Alexander D. Gilbert
AU  - Michael Griebel
AU  - Frances Y. Kuo
AU  - Ian H. Sloan
PY  - 2026
DA  - 2026/10/01
PB  - arXiv
DO  - 10.48550/arxiv.2610.01113
UR  - https://arxiv.org/abs/2610.01113
AB  - We present a novel numerical integration method for non-periodic functions over the high-dimensional unit cube [0,1]^s by a specially crafted (unequally-)weighted quadrature rule using transformed lattice points, with the additional option of subsampling. The method is designed for integrands whose mixed derivatives up to order α are square-integrable with respect to a product Chebyshev density. The ingredients are (i) periodizing the integrand, (ii) approximating the smooth periodic function by a kernel interpolant at lattice points, (iii) integrating exactly the product of the kernel interpolant and the nonsmooth density, together with subsampling alternatives for (ii) and~(iii). With |J| corresponding to the number of function evaluations, we achieve the convergence rate close to the order |J|^−(α−1/2) and |J|^−α (1.110721)^s, where the implied constants are independent of s under favorable conditions. We can interpolate these two results to trade between the convergence rate and the growth in s. We provide numerical experiments to demonstrate our theory.
ER  -