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

Springer eBooks

Lattice Rules for Multivariate Approximation in the Worst Case Setting

Frances Y. Kuo, Ian H. Sloan, Henryk Woźniakowski

Published Feb 1, 2006• 62 citations
Publisher
DOI
10.1007/3-540-31186-6_18

Related papers

Lattice Algorithms for Multivariate L ∞ Approximation in the Worst-Case Setting

Frances Y. Kuo, G.W. Wasilkowski, Henryk Woźniakowski

Constructive Approximation•Sep 23, 2009•20 citations

Lattice rule algorithms for multivariate approximation in the average case setting

Frances Y. Kuo, Ian H. Sloan, Henryk Woźniakowski

Journal of Complexity•Apr 23, 2007•47 citations

Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions

Ronald F. A. Cools, Frances Y. Kuo, Dirk Nuyens +1 more

arXiv:1606.00648•Journal of Complexity•May 28, 2016•24 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

Constructing Embedded Lattice-Based Algorithms for Multivariate Function Approximation with a Composite Number of Points

Frances Y. Kuo, Weiwen Mo, Dirk Nuyens

arXiv:2209.01002•Constructive Approximation•Apr 29, 2024•8 citations

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