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

Eurasian Mathematical Journal

NEW CUBATURE FORMULAS FOR KOROBOV SPACES

Serzhan Bassarov, Nazerke Tulekovna Tleukhanova

Published Jan 1, 2026• 0 citations
Publisher

Abstract

In this paper we present new cubature formulas for the Korobov spaces with a smoothness parameter α > 1 and an estimate of the worst-case error of the cubature formulas.
DOI
10.32523/2077-9879-2026-17-3-81-84

Related papers

Optimal cubature in Besov spaces with dominating mixed smoothness on the unit square

Tino Ullrich

Journal of Complexity•Sep 27, 2013•14 citations

Tractability of Approximation in the Weighted Korobov Space in the Worst-Case Setting

Adrian Ebert, Peter Kritzer, Friedrich Pillichshammer

arXiv:2201.09940•Springer eBooks•Jan 1, 2022•0 citations

Tractability of approximation in the weighted Korobov space in the worst-case setting — a complete picture

Adrian Ebert, Friedrich Pillichshammer

arXiv:2102.01449•Journal of Complexity•Apr 17, 2021•13 citations

Approximation of Quasi-Monte Carlo worst case error in weighted spaces of infinitely times smooth functions

Makoto Matsumoto, Ryuichi Ohori, Takehito Yoshiki

arXiv:1611.00561•Journal of Computational and Applied Mathematics•Sep 1, 2017•4 citations

A note on approximation in weighted Korobov spaces via multiple rank-1 lattices

Mou Cai, Takashi Goda

This paper studies the multivariate approximation of functions in weighted Korobov spaces using multiple rank-1 lattice rules. It has been shown by Kämmerer and Volkmer (2019) that algorithms based on multiple rank-1 lattices achieve the optimal convergence rate for the L ∞ error in Wiener-type spaces, up to logarithmic factors. While this result was translated to weighted Korobov spaces in the recent monograph by Dick, Kritzer, and Pillichshammer (2022), the analysis requires the smoothness parameter α to be greater than 1 and is restricted to product weights. In this paper, we extend this result for multiple rank-1 lattice-based algorithms to the case where 1 / 2 < α ≤ 1 and for general weights, covering a broader range of periodic functions with low smoothness and general relative importance of variables. We also provide a summability condition on the weights to ensure strong polynomial tractability for any α > 1 / 2 . Furthermore, by incorporating random shifts into multiple rank-1 lattice-based algorithms, we prove that the resulting randomized algorithm achieves a nearly optimal convergence rate in terms of the worst-case root mean squared L 2 error, while retaining the same tractability property.

arXiv:2601.20290•Journal of Complexity•May 12, 2026•4 citations

Approximation of analytic functions in Korobov spaces

Josef Dick, Peter Kritzer, Friedrich Pillichshammer +1 more

arXiv:1211.5822•Journal of Complexity•May 13, 2013•50 citations
This paper studies the multivariate approximation of functions in weighted Korobov spaces using multiple rank-1 lattice rules. It has been shown by Kämmerer and Volkmer (2019) that algorithms based on multiple rank-1 lattices achieve the optimal convergence rate for the L ∞ error in Wiener-type spaces, up to logarithmic factors. While this result was translated to weighted Korobov spaces in the recent monograph by Dick, Kritzer, and Pillichshammer (2022), the analysis requires the smoothness parameter α to be greater than 1 and is restricted to product weights. In this paper, we extend this result for multiple rank-1 lattice-based algorithms to the case where 1 / 2 < α ≤ 1 and for general weights, covering a broader range of periodic functions with low smoothness and general relative importance of variables. We also provide a summability condition on the weights to ensure strong polynomial tractability for any α > 1 / 2 . Furthermore, by incorporating random shifts into multiple rank-1 lattice-based algorithms, we prove that the resulting randomized algorithm achieves a nearly optimal convergence rate in terms of the worst-case root mean squared L 2 error, while retaining the same tractability property.