Paperlane

no. 16 · Tuesday 17 November 2026

Optimal Quadrature and the Curse of Dimensionality for a Veronese Class

Erich Novak and Esra Sengelen Sevim

math.NA

Abstract

We study integration on a $3^d$-dimensional trigonometric space whose unit ball has all coordinate mixed partial derivatives bounded by one. With evaluations anywhere in $\mathbb{R}^d$, we determine the exact minimal worst-case error among all deterministic algorithms using at most $n$ function values. An optimal quadrature formula is obtained by truncating an exact product quadrature formula on $\{1/2, 1/2+π\}^d$. All weights are positive. For each error tolerance $0<\varepsilon<1$, the information complexity grows exponentially in $d$ with the common base $Λ\approx 1.10546546$. The correction of order $\sqrt{d}$ to the logarithm of the information complexity and the corresponding error limit are determined by the standard normal distribution function. For $b\ge 1$ and $n=\lceil b^d\rceil$, the error tends to one, one half, or zero according as $b<Λ$, $b=Λ$, or $b>Λ$.

comments
16
fields
Numerical Analysis
pdf ↗ page arXiv:2611.21004 ↗