Abstract
We investigate the rate of convergence of linear sampling numbers of the embedding . Here governs the mixed smoothness and the isotropic smoothness in the space of hybrid smoothness, whereas denotes the isotropic Sobolev space. If we obtain sharp polynomial decay rates for the first embedding realized by sampling operators based on "energy-norm based sparse grids" for the classical trigonometric interpolation. This complements earlier work by Griebel, Knapek and Dũng, Ullrich, where general linear approximations have been considered. In addition, we study the embedding and achieve optimality for Smolyak's algorithm applied to the classical trigonometric interpolation. This can be applied to investigate the sampling numbers for the embedding for where again Smolyak's algorithm yields the optimal order. The precise decay rates for the sampling numbers in the mentioned situations always coincide with those for the approximation numbers, except probably in the limiting situation (including the embedding into ). The best what we could prove there is a (probably) non-sharp results with a logarithmic gap between lower and upper bound.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.