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:1903.02276 · Journal of Approximation Theory

Explicit error bounds for randomized Smolyak algorithms and an application to infinite-dimensional integration

Michael Gnewuch, M. Wnuk

Published Nov 23, 2019• 6 citations
arXivHTMLPDF
DOI
10.1016/j.jat.2019.105342

Related papers

Tractability of infinite-dimensional integration in the worst case and randomized settings

Leszek Plaskota, G.W. Wasilkowski

Journal of Complexity•Feb 4, 2011•45 citations

Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition

Josef Dick, Michael Gnewuch

arXiv:1306.2821•Journal of Approximation Theory•May 10, 2014•20 citations

Quantum Dynamics with a Smolyak scheme: numerical developments and applications

David Lauvergnat, Ahai Chen, Yohann Scribano

•Jun 3, 2019•0 citations

Exact Error Estimates and Optimal Randomized Algorithms for Integration

Ivan Dimov, Emanouil I. Atanassov

Lecture notes in computer science•Jan 1, 2007•9 citations

Randomized Algorithms for High-Dimensional Integration and Approximation

Marcin Wnuk

We prove upper and lower error bounds for error of the randomized Smolyak algorithm and provide a thorough case study of applying the randomized Smolyak algorithm with the building blocks being quadratures based on scrambled nets for integration of functions coming from Haar-wavelets spaces. Moreover, we discuss different notions of negative dependence of randomized point sets which find applications in discrepancy theory and randomized quasi-Monte Carlo integration.

•Dec 20, 2019•0 citations

Randomized Smolyak algorithms based on digital sequences for multivariate integration

Josef Dick, Gunther Leobacher, Friedrich Pillichshammer

In this paper, we consider Smolyak algorithms based on quasi-Monte Carlo rules for high-dimensional numerical integration. The quasi-Monte Carlo rules employed here use digital (t, α, β, σ, d)-sequences as quadrature points. We consider the worst-case error for multivariate integration in certain Sobolev spaces and show that our quadrature rules achieve the optimal rate of convergence. By randomizing the underlying digital sequences, we can also obtain a randomized Smolyak algorithm. The bound on the worst-case error holds also for the randomized algorithm in a statistical sense. Further, we also show that the randomized algorithm is unbiased and that the integration error can be approximated as well.

IMA Journal of Numerical Analysis•Feb 17, 2007•5 citations
In this paper, we consider Smolyak algorithms based on quasi-Monte Carlo rules for high-dimensional numerical integration. The quasi-Monte Carlo rules employed here use digital (t, α, β, σ, d)-sequences as quadrature points. We consider the worst-case error for multivariate integration in certain Sobolev spaces and show that our quadrature rules achieve the optimal rate of convergence. By randomizing the underlying digital sequences, we can also obtain a randomized Smolyak algorithm. The bound on the worst-case error holds also for the randomized algorithm in a statistical sense. Further, we also show that the randomized algorithm is unbiased and that the integration error can be approximated as well.