Convergence rates of high dimensional Smolyak quadrature

We analyse convergence rates of Smolyak integration for parametric maps u : U  → X taking values in a Banach space X , defined on the parameter domain U  = [−1,1]N . For parametric maps which are sparse, as quantified by summability of their Taylor polynomial chaos coefficients, dimension-independent convergence rates superior to N -term approximation rates under the same sparsity are achievable. We propose a concrete Smolyak algorithm to a priori identify integrand-adapted sets of active multiindices (and thereby unisolvent sparse grids of quadrature points) via upper bounds for the integrands’ Taylor gpc coefficients. For so-called “(b ,e )-holomorphic” integrands u with b ∈lp (∕) for some p  ∈ (0, 1), we prove the dimension-independent convergence rate 2/p  − 1 in terms of the number of quadrature points. The proposed Smolyak algorithm is proved to yield (essentially) the same rate in terms of the total computational cost for both nested and non-nested univariate quadrature points. Numerical experiments and a mathematical sparsity analysis accounting for cancellations in quadratures and in the combination formula demonstrate that the asymptotic rate 2/p  − 1 is realized computationally for a moderate number of quadrature points under certain circumstances. By a refined analysis of model integrand classes we show that a generally large preasymptotic range otherwise precludes reaching the asymptotic rate 2/p  − 1 for practically relevant numbers of quadrature points.