Metraipolis › archive › dc_ad1ba36cc2da

A sharp bound for sampling widths in the uniform norm: kernel $D$-optimal designs and oversampling — arXiv:2609.15556

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.15556
License (as archived)
CC0-1.0
Archived
2026-10-16T01:22:40.498Z
SHA-256 of the archived text
0bb8b05a5b12ba8e2ab92e5d84e3cd3521bfae52c302791f8cd805b1661703e0
Stable URL of this page
https://metraipolis.com/documento/dc_ad1ba36cc2da

How to cite

A sharp bound for sampling widths in the uniform norm: kernel $D$-optimal designs and oversampling — arXiv:2609.15556 — arXiv (en), https://arxiv.org/abs/2609.15556 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ad1ba36cc2da (Metraipolis archive dc_ad1ba36cc2da, sha256 0bb8b05a5b12ba8e2ab92e5d84e3cd3521bfae52c302791f8cd805b1661703e0)
BibTeX
@misc{dcad1ba36cc2da,
  title = {A sharp bound for sampling widths in the uniform norm: kernel $D$-optimal designs and oversampling — arXiv:2609.15556},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.15556},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ad1ba36cc2da; sha256 0bb8b05a5b12ba8e2ab92e5d84e3cd3521bfae52c302791f8cd805b1661703e0},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.15556. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For every reproducing kernel Hilbert space $\mathcal{H}_K$ with bounded kernel $K$, we prove that the linear sampling widths $g_m^{\text{lin}}$ and Gelfand widths $c_n$ in the uniform norm satisfy $$ g_m^{\text{lin}}(B_{\mathcal H_K})_\infty \leq \frac{m+1}{m-n+1}\, c_n(B_{\mathcal H_K})_\infty\quad , \quad m\ge n. $$ In a certain sense, the leading factor $(m+1)/(m-n+1)$ on the right-hand side is sharp. We transfer the problem into the selection of a maximal volume subset of kernel translates (kernel $D$-optimal design). Apart from basic linear algebra, our proof employs low rank approximation techniques and a version of the Eckart-Young-Mirsky theorem. The same argument gives corresponding bounds for the selection of a reduced basis in Hilbert spaces.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.NA).
Categorie arXiv: Functional Analysis (math.FA) ; Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.15556 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T00:39:06.354Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).