Papers
Topics
Authors
Recent
Search
2000 character limit reached

Counting via entropy: new preasymptotics for the approximation numbers of Sobolev embeddings

Published 4 May 2015 in math.NA | (1505.00631v3)

Abstract: In this paper, we reveal a new connection between approximation numbers of periodic Sobolev type spaces, where the smoothness weights on the Fourier coefficients are induced by a (quasi-)norm $|\cdot|$ on $\mathbb{R}d$, and entropy numbers of the embedding $\textrm{id}: \ell_{|\cdot|}d \to \ell_\inftyd$. This connection yields preasymptotic error bounds for approximation numbers of isotropic Sobolev spaces, spaces of analytic functions, and spaces of Gevrey type in $L_2$ and $H1$, which find application in the context of Galerkin methods. Moreover, we observe that approximation numbers of certain Gevrey type spaces behave preasymptotically almost identical to approximation numbers of spaces of dominating mixed smoothness. This observation can be exploited, for instance, for Galerkin schemes for the electronic Schr\"odinger equation, where mixed regularity is present.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.