Exact asymptotic order for generalised adaptive approximations

被引:0
|
作者
Kesseboehmer, Marc [1 ]
Niemann, Aljoscha [1 ]
机构
[1] Univ Bremen, Inst Dynam Syst, Fac Math & Comp Sci 3, Bibliothekstr 5, D-28359 Bremen, Germany
关键词
Adaptive approximation algorithm; Approximation theory; Lq-spectrum; Partition functions; Minkowski dimension; (Coarse) multifractal formalism;
D O I
10.1016/j.jat.2025.106171
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this note, we present an abstract approach to study asymptotic orders for adaptive approximations with respect to a monotone set function J defined on dyadic cubes. We determine the exact upper order in terms of the critical value of the corresponding J-partition function, and we are able to provide upper and lower bounds in terms of fractal-geometric quantities. With properly chosen J, our new approach has applications in many different areas of mathematics, including the spectral theory of Krein-Feller operators, quantisation dimensions of compactly supported probability measures, and the exact asymptotic order for Kolmogorov, Gel'fand and linear widths for Sobolev embeddings into the Lebesgue space Lp nu. (c) 2025 The Authors. Published by Elsevier Inc. This is an open access article under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
引用
收藏
页数:22
相关论文
共 50 条