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:1311.1563

Lower and upper bounds for the error of optimal cubature in Besov spaces of mixed smoothness

Ðinh Dũng, Tino Ullrich

Published Nov 7, 2013• 0 citations
arXivHTMLPDF

Abstract

We prove lower bounds for the error of optimal cubature formulas for $d$-variate functions from Besov spaces of mixed smoothness $B^{\alpha}_{p,\theta}({\mathbb G}^d)$ in the case $0 1/p$, and upper bounds for QMC methods on the Fibonacci lattice for two-variate periodic functions from $B^{\alpha}_{p,\theta}({\mathbb G}^2)$ in the case $1\leq p \leq \infty$, $0 1/p$, where ${\mathbb G}^d$ is either the $d$-dimensional torus ${\mathbb T}^d$ or the $d$-dimensional cube $[0,1]^d$. In combination these results yield the correct asymptotic of the error of optimal cubature formulas for functions from $B^{\alpha}_{p,\theta}({\mathbb G}^2)$ and indicate that a corresponding results is most likely also true in case $d>2$. This is compared to the obtained correct asymptotic of optimal cubature formulas on Smolyak grids which results in the observation that any cubature formula on Smolyak grids is never optimal for the general setting.

Related papers

Quantum integration in Besov spaces with mixed smoothness

Bernd Käßemodel, Tino Ullrich

We study the complexity of high-dimensional integration of periodic functions from Besov spaces $S^r_{p,q}B(\mathbb{T}^d)$ with mixed smoothness in the quantum model of computation. We construct new quantum algorithms based on the multivariate Faber-Schauder decomposition of such functions and analyze their convergence rates. We show a gain of one convergence order compared to the well-known deterministic rates of convergence. We additionally obtain lower bounds showing the optimality of our results up to logarithms.

arXiv:2610.17204•Oct 12, 2026•0 citations

Optimal cubature in Besov spaces with dominating mixed smoothness on the unit square

Tino Ullrich

Journal of Complexity•Sep 27, 2013•14 citations

On the Randomization of Frolov's Algorithm for Multivariate Integration

David Krieg

We are concerned with the numerical integration of functions from the Sobolev space $H^{r,\text{mix}}([0,1]^d)$ of dominating mixed smoothness $r\in\mathbb{N}$ over the $d$-dimensional unit cube. In 1976, K. K. Frolov introduced a deterministic quadrature rule whose worst case error has the order $n^{-r} \, (\log n)^{(d-1)/2}$ with respect to the number $n$ of function evaluations. This is known to be optimal. 39 years later, Erich Novak and me introduced a randomized version of this algorithm using $d$ random dilations. We showed that its error is bounded above by a constant multiple of $n^{-r-1/2} \, (\log n)^{(d-1)/2}$ in expectation and by $n^{-r} \, (\log n)^{(d-1)/2}$ almost surely. The main term $n^{-r-1/2}$ is again optimal and it turns out that the very same algorithm is also optimal for the isotropic Sobolev space $H^s([0,1]^d)$ of smoothness $s>d/2$. We also added a random shift to this algorithm to make it unbiased. Just recently, Mario Ullrich proved that the expected error of the resulting algorithm on $H^{r,\text{mix}}([0,1]^d)$ is even bounded above by $n^{-r-1/2}$. This thesis is a review of the mentioned upper bounds and their proofs.

arXiv:1603.04637•Mar 15, 2016•1 citation

NEW CUBATURE FORMULAS FOR KOROBOV SPACES

Serzhan Bassarov, Nazerke Tulekovna Tleukhanova

In this paper we present new cubature formulas for the Korobov spaces with a smoothness parameter α > 1 and an estimate of the worst-case error of the cubature formulas.

Eurasian Mathematical Journal•Jan 1, 2026•0 citations

Advanced Quasi-Monte Carlo Algorithms for High-dimensional Integration and Approximation

Gowri Suryanarayana

The aim of this research is to develop algorithms to approximate the solutions of problems defined on spaces of d-variate functions, where d can be arbitrarily large. We study quasi-Monte Carlo methods, which in contrast to Monte Carlo methods, use deterministic point sets. These methods converge significantly faster with well chosen points that minimize deterministic error bounds. Additionally, we require that the computational hardness of these methods has only a moderate or no dependence on d. We study this using the information complexity n(d, epsilon), the minimal number of information operations required to achieve an approximation with an error of epsilon or less. If n(d, epsilon) grows exponentially in d, the problem is said to have the 'curse of dimension' and the goal is to vanquish this curse. Our research resulted in several contributions. We studied multivariate integration for a Hilbert space of functions that are invariant under permutations of the variables; this is inspired from the symmetry constraints induced on solutions of the Schrödinger equation for indistinguishable particles. We showed that there exist quasi-Monte Carlo methods that achieve a convergence rate of O(n^−1/2) with the implied constant depending only polynomially on d and under some conditions independent of d (and that shifted rank-1 lattice rules can attain the same). We then provided a construction algorithm for a shifted rank-1 lattice that obtains the (almost) optimal rate of convergence. Next, we extended the use of rank-1 lattice points, traditionally used for the cubature and approximation of periodic functions, to the non-periodic setting. We did this in the cosine space setting, where we extensively studied the use of tent-transformed lattice points for cubature and approximation of nonperiodic functions. We were able to reuse algorithms from the periodic setting by establishing relations between the cosine space and the Korobov space of periodic functions. Finally we studied some special cases of approximation in two dimensions. We derived explicit expressions for various degrees of exactness for the Fibonacci lattice points. We end the thesis with an insight on the Lebesgue constant of trigonometric interpolation using lattice points as interpolation nodes.

•May 27, 2016•0 citations

Randomized sparse grid algorithms for multivariate integration on Haar wavelet spaces

M Wnuk, Michael Gnewuch

Abstract The deterministic sparse grid method, also known as Smolyak’s method, is a well-established and widely used tool to tackle multivariate approximation problems, and there is a vast literature on it. Much less is known about randomized versions of the sparse grid method. In this paper we analyze randomized sparse grid algorithms, namely randomized sparse grid quadratures for multivariate integration on the $D$-dimensional unit cube $[0,1)^D$. Let $d,s \in {\mathbb {N}}$ be such that $D=d\cdot s$. The $s$-dimensional building blocks of the sparse grid quadratures are based on stratified sampling for $s=1$ and on scrambled $(0,m,s)$-nets for $s\ge 2$. The spaces of integrands and the error criterion we consider are Haar wavelet spaces with parameter $\alpha $ and the randomized error (i.e., the worst case root mean square error), respectively. We prove sharp (i.e., matching) upper and lower bounds for the convergence rates of the $N$th minimal errors for all possible combinations of the parameters $d$ and $s$. Our upper error bounds still hold if we consider as spaces of integrands Sobolev spaces of mixed dominated smoothness with smoothness parameters $1/2< \alpha < 1$ instead of Haar wavelet spaces.

arXiv:2001.08558•IMA Journal of Numerical Analysis•Dec 1, 2021•2 citations
We prove lower bounds for the error of optimal cubature formulas for ddd-variate functions from Besov spaces of mixed smoothness Bp,θα(Gd)B^{\alpha}_{p,\theta}({\mathbb G}^d)Bp,θα​(Gd) in the case 01/p0 1/p01/p, and upper bounds for QMC methods on the Fibonacci lattice for two-variate periodic functions from Bp,θα(G2)B^{\alpha}_{p,\theta}({\mathbb G}^2)Bp,θα​(G2) in the case 1≤p≤∞1\leq p \leq \infty1≤p≤∞, 01/p0 1/p01/p, where Gd{\mathbb G}^dGd is either the ddd-dimensional torus Td{\mathbb T}^dTd or the ddd-dimensional cube [0,1]d[0,1]^d[0,1]d. In combination these results yield the correct asymptotic of the error of optimal cubature formulas for functions from Bp,θα(G2)B^{\alpha}_{p,\theta}({\mathbb G}^2)Bp,θα​(G2) and indicate that a corresponding results is most likely also true in case d>2d>2d>2. This is compared to the obtained correct asymptotic of optimal cubature formulas on Smolyak grids which results in the observation that any cubature formula on Smolyak grids is never optimal for the general setting.
We study the complexity of high-dimensional integration of periodic functions from Besov spaces Sp,qrB(Td)S^r_{p,q}B(\mathbb{T}^d)Sp,qr​B(Td) with mixed smoothness in the quantum model of computation. We construct new quantum algorithms based on the multivariate Faber-Schauder decomposition of such functions and analyze their convergence rates. We show a gain of one convergence order compared to the well-known deterministic rates of convergence. We additionally obtain lower bounds showing the optimality of our results up to logarithms.
We are concerned with the numerical integration of functions from the Sobolev space Hr,mix([0,1]d)H^{r,\text{mix}}([0,1]^d)Hr,mix([0,1]d) of dominating mixed smoothness r∈Nr\in\mathbb{N}r∈N over the ddd-dimensional unit cube. In 1976, K. K. Frolov introduced a deterministic quadrature rule whose worst case error has the order n−r (log⁡n)(d−1)/2n^{-r} \, (\log n)^{(d-1)/2}n−r(logn)(d−1)/2 with respect to the number nnn of function evaluations. This is known to be optimal. 39 years later, Erich Novak and me introduced a randomized version of this algorithm using ddd random dilations. We showed that its error is bounded above by a constant multiple of n−r−1/2 (log⁡n)(d−1)/2n^{-r-1/2} \, (\log n)^{(d-1)/2}n−r−1/2(logn)(d−1)/2 in expectation and by n−r (log⁡n)(d−1)/2n^{-r} \, (\log n)^{(d-1)/2}n−r(logn)(d−1)/2 almost surely. The main term n−r−1/2n^{-r-1/2}n−r−1/2 is again optimal and it turns out that the very same algorithm is also optimal for the isotropic Sobolev space Hs([0,1]d)H^s([0,1]^d)Hs([0,1]d) of smoothness s>d/2s>d/2s>d/2. We also added a random shift to this algorithm to make it unbiased. Just recently, Mario Ullrich proved that the expected error of the resulting algorithm on Hr,mix([0,1]d)H^{r,\text{mix}}([0,1]^d)Hr,mix([0,1]d) is even bounded above by n−r−1/2n^{-r-1/2}n−r−1/2. This thesis is a review of the mentioned upper bounds and their proofs.
The aim of this research is to develop algorithms to approximate the solutions of problems defined on spaces of d-variate functions, where d can be arbitrarily large. We study quasi-Monte Carlo methods, which in contrast to Monte Carlo methods, use deterministic point sets. These methods converge significantly faster with well chosen points that minimize deterministic error bounds. Additionally, we require that the computational hardness of these methods has only a moderate or no dependence on d. We study this using the information complexity n(d, epsilon), the minimal number of information operations required to achieve an approximation with an error of epsilon or less. If n(d, epsilon) grows exponentially in d, the problem is said to have the 'curse of dimension' and the goal is to vanquish this curse. Our research resulted in several contributions. We studied multivariate integration for a Hilbert space of functions that are invariant under permutations of the variables; this is inspired from the symmetry constraints induced on solutions of the Schrödinger equation for indistinguishable particles. We showed that there exist quasi-Monte Carlo methods that achieve a convergence rate of O(n^−1/2) with the implied constant depending only polynomially on d and under some conditions independent of d (and that shifted rank-1 lattice rules can attain the same). We then provided a construction algorithm for a shifted rank-1 lattice that obtains the (almost) optimal rate of convergence. Next, we extended the use of rank-1 lattice points, traditionally used for the cubature and approximation of periodic functions, to the non-periodic setting. We did this in the cosine space setting, where we extensively studied the use of tent-transformed lattice points for cubature and approximation of nonperiodic functions. We were able to reuse algorithms from the periodic setting by establishing relations between the cosine space and the Korobov space of periodic functions. Finally we studied some special cases of approximation in two dimensions. We derived explicit expressions for various degrees of exactness for the Fibonacci lattice points. We end the thesis with an insight on the Lebesgue constant of trigonometric interpolation using lattice points as interpolation nodes.
Abstract The deterministic sparse grid method, also known as Smolyak’s method, is a well-established and widely used tool to tackle multivariate approximation problems, and there is a vast literature on it. Much less is known about randomized versions of the sparse grid method. In this paper we analyze randomized sparse grid algorithms, namely randomized sparse grid quadratures for multivariate integration on the DDD-dimensional unit cube [0,1)D[0,1)^D[0,1)D. Let d,s∈Nd,s \in {\mathbb {N}}d,s∈N be such that D=d⋅sD=d\cdot sD=d⋅s. The sss-dimensional building blocks of the sparse grid quadratures are based on stratified sampling for s=1s=1s=1 and on scrambled (0,m,s)(0,m,s)(0,m,s)-nets for s≥2s\ge 2s≥2. The spaces of integrands and the error criterion we consider are Haar wavelet spaces with parameter $\alpha $ and the randomized error (i.e., the worst case root mean square error), respectively. We prove sharp (i.e., matching) upper and lower bounds for the convergence rates of the NNNth minimal errors for all possible combinations of the parameters ddd and sss. Our upper error bounds still hold if we consider as spaces of integrands Sobolev spaces of mixed dominated smoothness with smoothness parameters 1/2<α<11/2< \alpha < 11/2<α<1 instead of Haar wavelet spaces.