Metraipolis › archive › dc_ec8512839d28
Compressed Multiscale Kernel Collocation and Physics-Informed Kernel Learning for Elliptic BVPs — arXiv:2611.02832
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.02832
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:35:44.247Z
- SHA-256 of the archived text
8ae741e1d5b6f51c25b0c38faca55c4940ee5a4bff74ff3ce9d52a6fec5929da- Stable URL of this page
https://metraipolis.com/documento/dc_ec8512839d28
How to cite
Compressed Multiscale Kernel Collocation and Physics-Informed Kernel Learning for Elliptic BVPs — arXiv:2611.02832 — arXiv (en), https://arxiv.org/abs/2611.02832 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ec8512839d28 (Metraipolis archive dc_ec8512839d28, sha256 8ae741e1d5b6f51c25b0c38faca55c4940ee5a4bff74ff3ce9d52a6fec5929da)
BibTeX
@misc{dcec8512839d28,
title = {Compressed Multiscale Kernel Collocation and Physics-Informed Kernel Learning for Elliptic BVPs — arXiv:2611.02832},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.02832},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ec8512839d28; sha256 8ae741e1d5b6f51c25b0c38faca55c4940ee5a4bff74ff3ce9d52a6fec5929da},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02832. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Kernel collocation is a meshfree method for partial differential equations whose accuracy depends on the smoothness of the kernel and of the solution. For globally supported kernels, however, the collocation matrices are dense and severely ill-conditioned. We address both issues by combining a multiscale collocation scheme with samplets, a multiresolution basis of discrete signed measures with vanishing moments. In the samplet basis, the collocation matrix has only O(N log N) relevant entries, while the multiscale scheme adapts the kernel width to the spacing of the points on every level. Since the differential operator scales the equations at the interior points differently from those at the boundary points, the rescaling alone does not bound the condition number of the level systems. We therefore solve them by a Schur-complement reduction that is invariant under this scaling. For noisy data, we consider physics-informed kernel learning, which replaces the collocation system by a regularized least-squares fit. We show that it reduces to collocation as the regularization vanishes, and we solve it by a deflated conjugate gradient method that reuses the Schur-complement reduction. Numerical experiments in two and three dimensions, with exact and noisy boundary data, show that the method handles significantly more points than dense collocation. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.NA, nuovi lavori del giorno). Categorie arXiv: Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2611.02832 — 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-11-03T11:05:07.224Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).