Computing discrepancies of Smolyak quadrature rules
From MaRDI portal
Publication:2365409
DOI10.1006/jcom.1996.0020zbMath0869.41022OpenAlexW1975881124MaRDI QIDQ2365409
Publication date: 3 August 1997
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/191897d12255a6bd0ed7b9568b77648bcb97c3f3
Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximate quadratures (41A55)
Related Items
Entropy, Randomization, Derandomization, and Discrepancy ⋮ On the expected \(\mathcal{L}_2\)-discrepancy of jittered sampling ⋮ On an interpolatory method for high dimensional integration ⋮ Fibonacci sets and symmetrization in discrepancy theory ⋮ Uniform distribution, discrepancy, and reproducing kernel Hilbert spaces ⋮ Discrepancy of stratified samples from partitions of the unit cube ⋮ Explicit error bounds for randomized Smolyak algorithms and an application to infinite-dimensional integration ⋮ When are quasi-Monte Carlo algorithms efficient for high dimensional integrals? ⋮ Asymptotically optimal weighted numerical integration ⋮ Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems ⋮ On the \(L_2\)-discrepancy for anchored boxes ⋮ Calculation of Discrepancy Measures and Applications