Refined rates of convergence for target-data dependent greedy generalized interpolation with Sobolev kernels
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910003301974016 |
|---|---|
| author | Haasdonk, Bernard Santin, Gabriele Wenzel, Tizian Winkle, Daniel |
| author_facet | Haasdonk, Bernard Santin, Gabriele Wenzel, Tizian Winkle, Daniel |
| contents | Greedy methods have recently been successfully applied to generalized kernel interpolation, or the recovery of a function from data stemming from the evaluation of linear functionals, including the approximation of solutions of linear PDEs by symmetric collocation. When applied to kernels generating Sobolev spaces as their native Hilbert spaces, some of these greedy methods can provide the same error guarantee of generalized interpolation on quasi-uniform points. More importantly, certain target-data-adaptive methods even give a dimension- and smoothness-independent improvement in the speed of convergence over quasi-uniform points, thus offering advantages for high-dimensional problems. These convergence rates however contain a spurious logarithmic term that limits this beneficial effect. The goal of this note is to remove this factor, and this is possible by using estimates on metric entropy numbers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_20407 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Refined rates of convergence for target-data dependent greedy generalized interpolation with Sobolev kernels Haasdonk, Bernard Santin, Gabriele Wenzel, Tizian Winkle, Daniel Numerical Analysis Greedy methods have recently been successfully applied to generalized kernel interpolation, or the recovery of a function from data stemming from the evaluation of linear functionals, including the approximation of solutions of linear PDEs by symmetric collocation. When applied to kernels generating Sobolev spaces as their native Hilbert spaces, some of these greedy methods can provide the same error guarantee of generalized interpolation on quasi-uniform points. More importantly, certain target-data-adaptive methods even give a dimension- and smoothness-independent improvement in the speed of convergence over quasi-uniform points, thus offering advantages for high-dimensional problems. These convergence rates however contain a spurious logarithmic term that limits this beneficial effect. The goal of this note is to remove this factor, and this is possible by using estimates on metric entropy numbers. |
| title | Refined rates of convergence for target-data dependent greedy generalized interpolation with Sobolev kernels |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2601.20407 |