A deterministic multiple-shift lattice algorithm for function approximation in Korobov and half-period Cosine spaces

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Du, Jiarui, Dick, Josef
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918426114523136
author Du, Jiarui
Dick, Josef
author_facet Du, Jiarui
Dick, Josef
contents Approximating multivariate periodic functions in weighted Korobov spaces via rank-1 lattices is fundamentally limited by frequency aliasing. Existing optimal-rate methods rely on randomized constructions or large pre-computations. We propose a fully deterministic multiple-shift lattice algorithm without pre-computation. First, we develop a simplified multiple shift framework for aliased frequency fibers that reduces sampling costs. Second, leveraging the Chinese Remainder Theorem and the Weil bound, we introduce an adaptive hybrid construction that algebraically guarantees the full rank and bounded condition number of the reconstruction matrix. We rigorously prove that this deterministic method maintains the optimal convergence rate in the worst-case setting. Furthermore, we extend this framework to non-periodic, half-period cosine spaces via the tent transformation. By establishing a strict projection equivalence, we prove that the algorithm attains optimal $L_2$ and $L_\infty$ approximation orders in the half-period cosine space, successfully resolving an open theoretical problem posed by Suryanarayana et al. (2016). This mathematically also validates the proposed algorithm as a generic meshless spectral solver for high-dimensional boundary value problems, such as the Poisson equation with Neumann conditions. Numerical experiments corroborate the theoretical bounds, demonstrating an order-of-magnitude reduction in sampling complexity over probabilistic baselines while ensuring absolute deterministic stability.
format Preprint
id arxiv_https___arxiv_org_abs_2604_01146
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle A deterministic multiple-shift lattice algorithm for function approximation in Korobov and half-period Cosine spaces
Du, Jiarui
Dick, Josef
Numerical Analysis
65D15, 65D40, 65M70, 65T50
Approximating multivariate periodic functions in weighted Korobov spaces via rank-1 lattices is fundamentally limited by frequency aliasing. Existing optimal-rate methods rely on randomized constructions or large pre-computations. We propose a fully deterministic multiple-shift lattice algorithm without pre-computation. First, we develop a simplified multiple shift framework for aliased frequency fibers that reduces sampling costs. Second, leveraging the Chinese Remainder Theorem and the Weil bound, we introduce an adaptive hybrid construction that algebraically guarantees the full rank and bounded condition number of the reconstruction matrix. We rigorously prove that this deterministic method maintains the optimal convergence rate in the worst-case setting. Furthermore, we extend this framework to non-periodic, half-period cosine spaces via the tent transformation. By establishing a strict projection equivalence, we prove that the algorithm attains optimal $L_2$ and $L_\infty$ approximation orders in the half-period cosine space, successfully resolving an open theoretical problem posed by Suryanarayana et al. (2016). This mathematically also validates the proposed algorithm as a generic meshless spectral solver for high-dimensional boundary value problems, such as the Poisson equation with Neumann conditions. Numerical experiments corroborate the theoretical bounds, demonstrating an order-of-magnitude reduction in sampling complexity over probabilistic baselines while ensuring absolute deterministic stability.
title A deterministic multiple-shift lattice algorithm for function approximation in Korobov and half-period Cosine spaces
topic Numerical Analysis
65D15, 65D40, 65M70, 65T50
url https://arxiv.org/abs/2604.01146