EC-tractability of \(\mathbb{L}_p\)-approximation in Korobov spaces with exponential weights (Q2007614)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7135034
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | EC-tractability of \(\mathbb{L}_p\)-approximation in Korobov spaces with exponential weights |
scientific article; zbMATH DE number 7135034 |
Statements
EC-tractability of \(\mathbb{L}_p\)-approximation in Korobov spaces with exponential weights (English)
0 references
22 November 2019
0 references
In this paper, the author studies the information complexity (so-called tractability) with respect to problems in arbitrary dimensions and with respect to a prescribed error demand (numerical error). Exponential convergence of this problem is called exponential convergence (EC) tractability. A characterisation is provided for all \(L^p\) spaces for all \(1\leq p\leq\infty\) which is new, in particular the generalisation for \(1\leq p\leq2\). The author uses normalised error criteria and the spaces for which these results apply are Korobov spaces.
0 references
EC-tractability
0 references
Korobov kernel
0 references
\( \mathbb{L}_p\)-approximation
0 references
worst case setting
0 references
0 references
0 references
0 references
0 references
0 references
0.9193280339241028
0 references
0.8676488995552063
0 references
0.8300895690917969
0 references
0.8295100331306458
0 references
0.8290643095970154
0 references
