Sharp lower bounds on the manifold widths of Sobolev and Besov spaces

IF 1.8 2区 数学 Q1 MATHEMATICS Journal of Complexity Pub Date : 2024-06-20 DOI:10.1016/j.jco.2024.101884
Jonathan W. Siegel
{"title":"Sharp lower bounds on the manifold widths of Sobolev and Besov spaces","authors":"Jonathan W. Siegel","doi":"10.1016/j.jco.2024.101884","DOIUrl":null,"url":null,"abstract":"<div><p>We study the manifold <em>n</em>-widths of Sobolev and Besov spaces with error measured in the <span><math><msub><mrow><mi>L</mi></mrow><mrow><mi>p</mi></mrow></msub></math></span>-norm. The manifold widths measure how efficiently these spaces can be approximated by continuous non-linear parametric methods. Existing upper and lower bounds only match when the smoothness index <em>q</em> satisfies <span><math><mi>q</mi><mo>≤</mo><mi>p</mi></math></span> or <span><math><mn>1</mn><mo>≤</mo><mi>p</mi><mo>≤</mo><mn>2</mn></math></span>. We close this gap, obtaining sharp bounds for all <span><math><mn>1</mn><mo>≤</mo><mi>p</mi><mo>,</mo><mi>q</mi><mo>≤</mo><mo>∞</mo></math></span> for which a compact embedding holds. In the process, we determine the exact value of the manifold widths of finite dimensional <span><math><msubsup><mrow><mi>ℓ</mi></mrow><mrow><mi>q</mi></mrow><mrow><mi>M</mi></mrow></msubsup></math></span>-balls in the <span><math><msub><mrow><mi>ℓ</mi></mrow><mrow><mi>p</mi></mrow></msub></math></span>-norm when <span><math><mi>p</mi><mo>≤</mo><mi>q</mi></math></span>. Although this result is not new, we provide a new proof and apply it to lower bounding the manifold widths of Sobolev and Besov spaces. Our results show that the Bernstein widths, which are typically used to lower bound the manifold widths, decay asymptotically faster than the manifold widths in many cases.</p></div>","PeriodicalId":50227,"journal":{"name":"Journal of Complexity","volume":null,"pages":null},"PeriodicalIF":1.8000,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Complexity","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0885064X2400061X","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

We study the manifold n-widths of Sobolev and Besov spaces with error measured in the Lp-norm. The manifold widths measure how efficiently these spaces can be approximated by continuous non-linear parametric methods. Existing upper and lower bounds only match when the smoothness index q satisfies qp or 1p2. We close this gap, obtaining sharp bounds for all 1p,q for which a compact embedding holds. In the process, we determine the exact value of the manifold widths of finite dimensional qM-balls in the p-norm when pq. Although this result is not new, we provide a new proof and apply it to lower bounding the manifold widths of Sobolev and Besov spaces. Our results show that the Bernstein widths, which are typically used to lower bound the manifold widths, decay asymptotically faster than the manifold widths in many cases.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
索波列夫和贝索夫空间流形宽度的尖锐下限
我们研究了 Sobolev 和 Besov 空间的流形 n 宽度,误差以 Lp 值衡量。流形宽度衡量连续非线性参数方法逼近这些空间的效率。现有的上界和下界只有在平滑指数 q 满足 q≤p 或 1≤p≤2 时才能匹配。我们缩小了这一差距,获得了所有 1≤p,q≤∞的尖锐边界,对于这些边界,紧凑嵌入是成立的。在此过程中,我们确定了当 p≤q 时,有限维 ℓqM 球在ℓp 规范下的流形宽度的精确值。虽然这个结果并不新颖,但我们提供了一个新的证明,并将其应用于索波列夫和贝索夫空间流形宽度的下界。我们的结果表明,通常用来下限流形宽度的伯恩斯坦宽度在许多情况下会比流形宽度衰减得更快。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Complexity
Journal of Complexity 工程技术-计算机:理论方法
CiteScore
3.10
自引率
17.60%
发文量
57
审稿时长
>12 weeks
期刊介绍: The multidisciplinary Journal of Complexity publishes original research papers that contain substantial mathematical results on complexity as broadly conceived. Outstanding review papers will also be published. In the area of computational complexity, the focus is on complexity over the reals, with the emphasis on lower bounds and optimal algorithms. The Journal of Complexity also publishes articles that provide major new algorithms or make important progress on upper bounds. Other models of computation, such as the Turing machine model, are also of interest. Computational complexity results in a wide variety of areas are solicited. Areas Include: • Approximation theory • Biomedical computing • Compressed computing and sensing • Computational finance • Computational number theory • Computational stochastics • Control theory • Cryptography • Design of experiments • Differential equations • Discrete problems • Distributed and parallel computation • High and infinite-dimensional problems • Information-based complexity • Inverse and ill-posed problems • Machine learning • Markov chain Monte Carlo • Monte Carlo and quasi-Monte Carlo • Multivariate integration and approximation • Noisy data • Nonlinear and algebraic equations • Numerical analysis • Operator equations • Optimization • Quantum computing • Scientific computation • Tractability of multivariate problems • Vision and image understanding.
期刊最新文献
Stefan Heinrich is the Winner of the 2024 Best Paper Award of the Journal of Complexity Best Paper Award of the Journal of Complexity Matthieu Dolbeault is the winner of the 2024 Joseph F. Traub Information-Based Complexity Young Researcher Award Optimal recovery of linear operators from information of random functions Intractability results for integration in tensor product spaces
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1