Preasymptotics and asymptotics of approximation numbers of anisotropic Sobolev embeddings
JIa Chen, Heping Wang

TL;DR
This paper analyzes the approximation numbers of anisotropic Sobolev embeddings, revealing their asymptotic behavior, strong equivalences, and intractability, with implications for high-dimensional approximation problems.
Contribution
It provides the first detailed preasymptotic and asymptotic analysis of approximation numbers for anisotropic Sobolev embeddings, including limit spaces, showing intractability and absence of curse of dimensionality.
Findings
Approximation numbers exhibit specific asymptotic behaviors.
Embeddings are intractable but free from curse of dimensionality.
Preasymptotic behavior characterized for limit spaces.
Abstract
In this paper, we obtain the preasymptotic and asymptotic behavior and strong equivalences of the approximation numbers of the embeddings from the anisotropic Sobolev spaces to . We also get the preasymptotic behavior of the approximation numbers of the embeddings from the limit spaces of the anisotropic Sobolev spaces to . We show that both the above embedding problems are intractable and do not suffer from the curse of dimensionality.
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
