Metraipolis › archive › dc_8a3493143441

Optimal compression of kernel matrices by interpolets with application to high-dimensional approximation — arXiv:2608.22560

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.22560
License (as archived)
CC0-1.0
Archived
2026-10-18T08:27:36.211Z
SHA-256 of the archived text
987f45eee9cc2076d1f9d8474cd80811343221bfd7e3e475112f4ad7c8c8070b
Stable URL of this page
https://metraipolis.com/documento/dc_8a3493143441

How to cite

Optimal compression of kernel matrices by interpolets with application to high-dimensional approximation — arXiv:2608.22560 — arXiv (en), https://arxiv.org/abs/2608.22560 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8a3493143441 (Metraipolis archive dc_8a3493143441, sha256 987f45eee9cc2076d1f9d8474cd80811343221bfd7e3e475112f4ad7c8c8070b)
BibTeX
@misc{dc8a3493143441,
  title = {Optimal compression of kernel matrices by interpolets with application to high-dimensional approximation — arXiv:2608.22560},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.22560},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8a3493143441; sha256 987f45eee9cc2076d1f9d8474cd80811343221bfd7e3e475112f4ad7c8c8070b},
  year = {2026}
}

Archived text

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

We consider the compression of kernel matrices on the unit interval $[0,1]$ by interpolets that have sufficiently many vanishing moments. We define a compression rule which discards most matrix coefficients without compromising the accuracy offered by the underlying discretization. Since interpolets can be scaled such that the compressed kernel matrices are well conditioned, we derive a fully discrete scheme that solves a kernel interpolation problem under consideration in linear overall complexity. We finally generalize this approach to the unit $n$-cube $[0,1]^n$ by means of the sparse grid combination technique. Numerical experiments are carried out to validate the theoretical findings.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2608.22560 — 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-18T08:27:23.847Z dalla pagina https://arxiv.org/catchup/math.NA/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).