Sparse grid quadrature on products of spheres

作者：Hegland Markus; Leopardi Paul^*

来源：Numerical Algorithms, 2015, 70(3): 485-517.

DOI：10.1007/s11075-015-9958-9

• Reproducing kernel Hilbert spaces
• Quadrature
• Tractability
• Sparse grids
• Knapsack problems
• Spherical designs

We examine sparse grid quadrature on weighted tensor products (wtp) of reproducing kernel Hilbert spaces on products of the unit sphere , in the case of worst case quadrature error for rules with arbitrary quadrature weights. We describe a dimension adaptive quadrature algorithm based on an algorithm of Hegland (ANZIAM J. 44 (E), C335-C353, 2003), and also formulate an adaptation of Wasilkowski and WoA(0)niakowski's wtp algorithm (Wasilkowski and WoA(0)niakowski: J. Complex. 15(3), 402-447, 1999), here called the ww algorithm. We prove that the dimension adaptive algorithm is optimal in the sense of Dantzig (Oper. Res. 5(2), 266-2777, 1957) and therefore no greater in cost than the ww algorithm. Both algorithms therefore have the optimal asymptotic rate of convergence of quadrature error given by Theorem 3 of Wasilkowski and WoA(0)niakowski (J. Complex. 15(3), 402-447, 1999). A numerical example shows that, even though the asymptotic convergence rate is optimal, if the dimension weights decay slowly enough, and the dimensionality of the problem is large enough, the initial convergence of the dimension adaptive algorithm can be slow.

• 出版日期2015-11