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

Approximation of analytic functions in Korobov spaces

Josef Dick, Peter Kritzer, Friedrich Pillichshammer, Henryk Woźniakowski

Published May 13, 2013• 50 citations
arXivHTMLPDF
DOI
10.1016/j.jco.2013.05.001

Related papers

L∞ -Approximation in Korobov spaces with exponential weights

Peter Kritzer, Friedrich Pillichshammer, Henryk Woźniakowski

arXiv:1602.02572•Journal of Complexity•Jan 18, 2017•12 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 for Weighted Korobov Spaces on Classical and Quantum Computers

Erich Novak, Ian H. Sloan, Henryk Woźniakowski

arXiv:quant-ph/0206023•Foundations of Computational Mathematics•Aug 22, 2003•66 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

Numerical integration in log-Korobov and log-cosine spaces

Josef Dick, Peter Kritzer, Gunther Leobacher +1 more

arXiv:1411.2715•Numerical Algorithms•Mar 21, 2015•1 citation

A note on Korobov lattice rules for integration of analytic functions

Friedrich Pillichshammer

We study numerical integration for a weighted Korobov space of analytic periodic functions for which the Fourier coefficients decay exponentially fast. In particular, we are interested in how the error depends on the dimension d. Many recent papers deal with this problem or similar problems and provide matching necessary and sufficient conditions for various notions of tractability. In most cases even simple algorithms are known which allow to achieve these notions of tractability. However, there is a gap in the literature: while for the notion of exponential-weak tractability one knows matching necessary and sufficient conditions, so far no explicit algorithm has been known which yields the desired result. In this paper we close this gap and prove that Korobov lattice rules are suitable algorithms in order to achieve exponential-weak tractability for integration in weighted Korobov spaces of analytic periodic functions.

arXiv:2010.03286•Journal of Complexity•Oct 10, 2020•2 citations
We study numerical integration for a weighted Korobov space of analytic periodic functions for which the Fourier coefficients decay exponentially fast. In particular, we are interested in how the error depends on the dimension d. Many recent papers deal with this problem or similar problems and provide matching necessary and sufficient conditions for various notions of tractability. In most cases even simple algorithms are known which allow to achieve these notions of tractability. However, there is a gap in the literature: while for the notion of exponential-weak tractability one knows matching necessary and sufficient conditions, so far no explicit algorithm has been known which yields the desired result. In this paper we close this gap and prove that Korobov lattice rules are suitable algorithms in order to achieve exponential-weak tractability for integration in weighted Korobov spaces of analytic periodic functions.