Abstract
We study the complexity of high-dimensional approximation in the L2-norm when different classes of information are available; we compare the power of function evaluations with the power of arbitrary continuous linear measurements. Here, we discuss the situation when the number of linear measurements required to achieve an error ε ∈ (0,1) in dimension \(d\in \mathbb {N}\) depends only poly-logarithmically on ε− 1. This corresponds to an exponential order of convergence of the approximation error, which often happens in applications. However, it does not mean that the high-dimensional approximation problem is easy, the main difficulty usually lies within the dependence on the dimension d. We determine to which extent the required amount of information changes if we allow only function evaluation instead of arbitrary linear information. It turns out that in this case we only lose very little, and we can even restrict to linear algorithms. In particular, several notions of tractability hold simultaneously for both types of available information.
References
Adcock, B., Hansen, A.C., Shadrin, A.: A stability barrier for reconstructions from Fourier samples. SIAM J. Numer. Anal. 52(1), 125–139 (2014)
Adcock, B., Huybrechs, D., Martin-Vaquero, J.: On the numerical stability of Fourier extensions. Found. Comput. Math. 14, 635–687 (2014)
Adcock, B., Platte, R.B., Shadrin, A.: Optimal sampling rates for approximating analytic functions from pointwise samples. IMA J. Numer. Anal. 39(3), 1360–1390 (2018)
Binev, P., Cohen, A., Dahmen, W., DeVore, R., Petrova, G., Wojtaszczyk, P.: Convergence rates for greedy algorithms in reduced basis methods. SIAM J. Math. Anal. 43(3), 1457–1472 (2011)
Buffa, A., Maday, Y., Patera, A.T., Prud’homme C., Turinici, G.: A priori convergence of the greedy algorithm for the parametrized reduced basis method. ESAIM:, Mathematical modelling and numerical analysis – modélisation mathématique et analyse numérique 46(3), 595–603 (2012)
Creutzig, J., Wojtaszczyk, P.: Linear vs. nonlinear algorithms for linear problems. J. Complex. 20, 807–820 (2004)
Deimer, J.J.A., Sergio, A.T.: Estimates for n-widths of sets of smooth functions on complex spheres. J. Complex. 64, 101537 (2021)
Dick, J., Kritzer, P., Pillichshammer, F., Woźniakowski, H.: Approximation of analytic functions in Korobov spaces. J. Complex. 30(2), 2–28 (2014)
Dolbeault, M., Krieg, D., Ullrich, M.: A sharp upper bound for sampling numbers in l2. Appl. Comput. Harmon. Anal. 63, 113–134 (2023)
Dũng, D., Temlyakov, V.N., Ullrich, T.: Hyperbolic Cross Approximation. Advanced Courses in Mathematics - CRM Barcelona. Springer, Heidelberg (2018)
Ebert, A., Pillichshammer, F.: Tractability of approximation in the weighted Korobov space in the worst-case setting – a complete picture. J. Complex. 67, 101571 (2021)
Fasshauer, G.E., Hickernell, F.J., Woźniakowski, H.: On dimension-independent rates of convergence for function approximation with Gaussian kernels. SIAM J. Numer. Anal. 50(1), 247–271 (2012)
Gabcke, W.: Neue Herleitung Und Explizite Restabschätzung Der Riemann-Siegel-Formel PhD thesis. University of Göttingen (1979)
Griebel, M., Oettershagen, J.: On tensor product approximation of analytic functions. J. Approx. Theory 207, 348–379 (2016)
Haasdonk, B.: Convergence rates of the pod–greedy method. ESAIM:, Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique 47(3), 859–873 (2013)
Hackbusch, W., Khoromskij, B.N.: Tensor-product approximation to operators and functions in high dimensions. J. Complex. 23(4), 697–714 (2007). Festschrift for the 60th Birthday of Henryk Woźniakowski
Hangelbroek, T., Ron, A.: Nonlinear approximation using Gaussian kernels. J. Funct. Anal. 259(1), 203–219 (2010)
Hinrichs, A., Krieg, D., Novak, E., Prochno, J., Ullrich, M.: Random sections of ellipsoids and the power of random information. Trans. Am. Math. Soc. 374(12), 8691–8713 (2021)
Hinrichs, A., Krieg, D., Novak, E., Vybíral, J.: Lower bounds for the error of quadrature formulas for Hilbert spaces. J. Complex. 65, 101544 (2021)
Hinrichs, A., Novak, E., Ullrich, M.: On weak tractability of the clenshaw–Curtis Smolyak algorithm. J. Approx. Theory 183, 31–44 (2014)
Hinrichs, A., Novak, E., Ullrich, M., Woźniakowski, H.: The curse of dimensionality for numerical integration of smooth functions. Math. Comput. 83(290), 2853–2863 (2014)
Hinrichs, A., Novak, E., Ullrich, M., Woźniakowski, H.: Product rules are optimal for numerical integration in classical smoothness spaces. J. Complex. 38, 39–49 (2017)
Hinrichs, A., Prochno, J., Ullrich, M.: The curse of dimensionality for numerical integration on general domains. J. Complex. 50, 25–42 (2019)
Irrgeher, C., Kritzer, P., Pillichshammer, F., Woźniakowski, H.: Approximation in Hermite spaces of smooth functions. J. Approx. Theory 207, 98–126 (2016)
Irrgeher, C., Kritzer, P., Pillichshammer, F., Woźniakowski, H.: Tractability of multivariate approximation defined over Hilbert spaces with exponential weights. J. Approx. Theory 207, 301–338 (2016)
Karvonen, T., Särkkä, S.: Worst-case optimal approximation with increasingly flat Gaussian kernels. Adv. Comput. Math. 46, 1–17 (2020)
Krieg, D.: Uniform recovery of high-dimensional cr-functions. J. Complex. 50, 116–126 (2019)
Krieg, D., Ullrich, M.: Function values are enough for l2-approximation. Found. Comput. Math. 21(4), 1141–1151 (2021)
Krieg, D., Ullrich, M.: Function values are enough for l2-approximation: Part II. J. Complex. 66, 101569 (2021)
Kritzer, P., Woźniakowski, H.: Simple characterizations of exponential tractability for linear multivariate problems. J. Complex. 51, 110–128 (2019)
Mathé, P.: S-numbers in information-based complexity. J. Complex. 6(1), 41–66 (1990)
Nagel, N., Schäfer, M., Ullrich, T.: A new upper bound for sampling numbers. arXiv:2010.00327 (2020)
Novak, E., Woźniakowski, H: Tractability of Multivariate Problems. Vol 1: Linear information, volume 6 of EMS tracts in mathematics. European Mathematical Society (EMS), Zürich (2008)
Novak, E., Woźniakowski, H.: Approximation of infinitely differentiable multivariate functions is intractable. J. Complex. 25, 398–404 (2009)
Novak, E., Woźniakowski, H.: Tractability of multivariate problems volume II : Standard information for functionals, volume 12 of EMS tracts in mathematics. European Mathematical Society, (EMS), Zürich (2010)
Novak, E., Woźniakowski, H.: Tractability of multivariate problems volume III : Standard information for operators, volume 18 of EMS tracts in mathematics. European Mathematical Society, (EMS), Zürich (2012)
Novak, E., Woźniakowski, H.: Tractability of multivariate problems for standard and linear information in the worst case setting: part i. J. Approx. Theory 207, 177–192 (2016)
Pietsch, A.: Operator ideals. Deutscher Verlag, Wiss. Berlin (1978)
Platte, R.B., Trefethen, L.N., Kuijlaars, A.B.J.: Impossibility of fast stable approximation of analytic functions from equispaced samples. SIAM Rev. 53(2), 308–318 (2011)
Vybíral, J.: A variant of Schur’s product theorem and its applications. Adv. Math. 368, 107140 (2020)
Sloan, I., Woźniakowski, H.: Multivariate approximation for analytic functions with Gaussian kernels. J. Complex. 45, 1–21 (2018)
Temlyakov, V.N.: Approximation of periodic functions. Computational Mathematics and Analysis Series, Nova Science Publishers, Inc, Commack, NY (1993)
Temlyakov, V.N.: Multivariate Approximation, volume 32 of Cambridge Monographs on Applied and Computational Mathematics Cambridge University Press (2018)
Ullrich, M.: On the worst-case error of least squares algorithms for l2-approximation with high probability. Journal of Complexity, p. 60 (2020)
Wendland, H.: Scattered data approximation, vol. 17 of Cambridge monographs on applied and computational mathematics. Cambridge University Press, Cambridge (2005)
Xu, G.: On weak tractability of the Smolyak algorithm for approximation problems. J. Approx. Theory 192, 347–361 (2015)
Zhang, J.: A note on EC-tractability of multivariate approximation in weighted Korobov spaces for the standard information class. Journal of Complexity, p. 67 (2021)
Funding
David Krieg is supported by the Austrian Science Fund (FWF) Project F5506, which is part of the Special Research Program “Quasi-Monte Carlo Methods: Theory and Applications”.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare no competing interests.
Additional information
Communicated by: Holger Rauhut
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix: Technical Lemmas
Appendix: Technical Lemmas
The following lemmas are used in the proofs of our results.
Lemma 1
Let A and B be arbitrary positive real numbers. For n ≥A(B/2)B we have the following inequality
Proof
It is enough to show that the function \(f:(0,\infty )\to \mathbb {R}\) given by \(f(t)=t^{1/2}\exp (-(t/A)^{1/B})\) is decreasing on \((A(B/2)^{B},\infty )\). Indeed, for t > A(B/2)B we have
□
Lemma 2
Let A and B be arbitrary positive real numbers. For every \(n\ge A \max \limits (3B/2,1)^{B}\) we have the following inequality
Proof
Using integration by substitution, with u = (t/A)1/B, we obtain that
where, for \(a\in \mathbb {R}\) and x > 0, \({\Gamma }(a,x)={\int \limits }_{x}^{\infty } v^{a-1}\exp (-v)dv\) is the incomplete gamma function.
It is known (see, e.g., Satz 4.4.3 in [13]) that for a ≥ 1 and x > a we have
If, on the other hand, 0 < a < 1 and x > 1 then since va− 1 ≤xa− 1 for v ≥x we have
Therefore, for every a > 0 and \(x>\max \limits (a,1)\), the following bound holds
Thus for \(n>A \max \limits (3B/2,1)^{B}\), and taking a = 3B/2 and x = (n/A)1/B, we have
□
Lemma 3
For every A,B,n,δ,u > 0 we have the following inequality
Proof
Let x = δ(n/A)1/B. Then nu = Auδ−uBxuB. Using the fact that \(\ln (x)\leq x\) for all x > 0 we obtain that
Hence, taking exponentials of both sides we derive that
and thus
as claimed. □
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Krieg, D., Siedlecki, P., Ullrich, M. et al. Exponential tractability of L2-approximation with function values. Adv Comput Math 49, 18 (2023). https://doi.org/10.1007/s10444-023-10021-7
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10444-023-10021-7
Keywords
- Approximation
- Multivariate problems
- Tractability
- Complexity
Mathematics Subject Classification (2010)
- 65Y20
- 41A25
- 41A65
- 41A63