Approximation numbers of Sobolev and Gevrey type embeddings on the sphere and on the ball -- Preasymptotics, asymptotics, and tractability
Jia Chen, Heping Wang

TL;DR
This paper analyzes the approximation numbers of Sobolev and Gevrey embeddings on spheres and balls, providing asymptotic behaviors, independence of dimension constants, and tractability results for high-dimensional approximation problems.
Contribution
It offers new asymptotic and preasymptotic estimates for approximation numbers, establishing tractability conditions independent of dimension for Sobolev and Gevrey spaces.
Findings
Approximation problems are weakly tractable if r > 1.
Gevrey space embeddings are uniformly weakly tractable for all positive parameters.
No curse of dimensionality occurs for Sobolev embeddings in the studied setting.
Abstract
In this paper, we investigate optimal linear approximations (-approximation numbers ) of the embeddings from the Sobolev spaces for various equivalent norms and the Gevrey type spaces on the sphere and on the ball , where the approximation error is measured in the -norm. We obtain preasymptotics, asymptotics, and strong equivalences of the above approximation numbers as a function in and the dimension . We emphasis that all equivalence constants in the above preasymptotics and asymptotics are independent of the dimension and . As a consequence we obtain that for the absolute error criterion the approximation problems are weakly tractable if and only if , not uniformly weakly tractable, and do not suffer from the curse of dimensionality. We also prove that for any…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Advanced Numerical Methods in Computational Mathematics · Advanced Mathematical Modeling in Engineering
