On weak tractability of the Smolyak algorithm for approximation problems (Q2256626): Difference between revisions

The author studies the \(L^{p}\)-approximation problem of the class of infinitely differentiable functions \(f\) given by \(F_{d} = \{ f : [-1,1]^{d} \to \mathbb{R} | \sup_{k \in \mathbb{N}_{0}} \sup_{\theta \in S^{d-1}} \| D_{\theta}^{k}f \|_{\infty} \leq 1 \},\) where \(S^{d-1}\) denotes the unit sphere of \(\mathbb{R}^{d},\) and \(D_{\theta}f\) denotes the directional derivative of \(f\) in the direction of \(\theta \in S^{d-1}\). It is proved for \(1 \leq p < \infty\) that the Smolyak algorithm based on polynomial interpolation at the extrema of the Chebyshev polynomials leads to the weak tractability of \(L^{p}\)-approximation of the class \(F_{d}\).