pith. sign in

arxiv: 1505.00631 · v3 · pith:JTME4UZFnew · submitted 2015-05-04 · 🧮 math.NA

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

classification 🧮 math.NA
keywords numbersspacesapproximationsobolevtypecdotconnectionentropy
0
0 comments X
read the original 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_\infty^d$. 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 $H^1$, 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.