Length H-sets for kernel-based spaces

被引:0
|
作者
Schaback, Robert [1 ]
机构
[1] Univ Gottingen, Inst Numer & Angew Math, Lotzestr 16-18, D-37083 Gottingen, Germany
关键词
Approximation; Error bounds; Uniqueness; Stability; Alternation; Radial basis functions; Kernels; Reproducing kernel Hilbert spaces; Duality;
D O I
10.1016/j.jat.2023.105942
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The concept of H-sets as introduced by Collatz in 1956 was very useful in univariate Chebyshev approximation by polynomials or Chebyshev spaces. In the multivariate setting, the situation is much worse, because there is no alternation, and H-sets exist, but are only rarely accessible by mathematical arguments. However, in Reproducing Kernel Hilbert spaces, H-sets are shown here to have a rather simple and complete characterization. As a byproduct, the strong connection of H-sets to Linear Programming is studied. But on the downside, it is explained why H-sets have a very limited range of applicability in the times of large-scale computing.& COPY; 2023 Elsevier Inc. All rights reserved.
引用
收藏
页数:11
相关论文
共 50 条