On weak tractability of the Clenshaw-Curtis Smolyak algorithm

详细信息    查看全文

• 作者：Aicke Hinrichs^a ; ^{aicke.hinrichs@uni-rostock.de" class="auth_mail} ; Erich Novak^b ; ^{erich.novak@uni-jena.de" class="auth_mail} ; Mario Ullrich^b ; ^{ullrich.mario@gmail.com" class="auth_mail}
• 刊名：Journal of Approximation Theory
• 出版年：July 2014
• 年：2014
• 卷：183
• 期：Complete
• 页码：31-44
• 全文大小：221 K

文摘

We consider the problem of integration of dden">de">$d$-variate analytic functions defined on the unit cube with directional derivatives of all orders bounded by 1. We prove that the Clenshaw–Curtis Smolyak algorithm leads to weak tractability of the problem. This seems to be the first positive tractability result for the Smolyak algorithm for a normalized and unweighted problem. The space of integrands is not a tensor product space and therefore we have to develop a different proof technique. We use the polynomial exactness of the algorithm as well as an explicit bound on the operator norm of the algorithm.