Minimal subsampled rank-1 lattices for multivariate approximation with optimal convergence rate
Mathematics of Computation · 01.06.2026
DOI: 10.1090/mcom/4212 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics of Computation, online erschienen am 01.06.2026. Verfasst von Felix Bartel und 3 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 45 Literaturangaben.
Abstract (Originalsprache)
In this paper we show error bounds for randomly subsampled rank-1 lattices. We pay particular attention to the ratio of the size of the subset to the size of the initial lattice, which is decisive for the computational complexity. In the special case of Korobov spaces, we achieve the optimal polynomial sampling complexity whilst having the smallest initial lattice possible . We further characterize the frequency index set for which a given lattice is reconstructing by using the reciprocal of the worst-case error achieved using the lattice in question. This connects existing approaches used in proving error bounds for lattices. We make detailed comments on the implementation and test different algorithms using the subsampled lattice in numerical experiments.
Zitieren
APA
Bartel, F., Gilbert, A., Kuo, F., & Sloan, I. (2026). Minimal subsampled rank-1 lattices for multivariate approximation with optimal convergence rate. Mathematics of Computation. https://doi.org/10.1090/mcom/4212
Vancouver
Bartel F, Gilbert A, Kuo F, Sloan I. Minimal subsampled rank-1 lattices for multivariate approximation with optimal convergence rate. Mathematics of Computation. 2026. doi:10.1090/mcom/4212
BibTeX
@article{Bartel2026,
author = {Bartel, Felix and Gilbert, Alexander and Kuo, Frances and Sloan, Ian},
title = {Minimal subsampled rank-1 lattices for multivariate approximation with optimal convergence rate},
journal = {Mathematics of Computation},
year = {2026},
doi = {10.1090/mcom/4212}
}
EUVIMED