Metraipolis › archive › dc_429c547102bc
Fast and Stable Harmonic Approximation from Ill-distributed Data using Moving Least Squares — arXiv:2609.39200
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.39200
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T14:17:06.574Z
- SHA-256 of the archived text
2faaf080bcd8f2ff92c422d404c7cc6ce5e0a2d56032a2d44cf5e6cab64215c6- Stable URL of this page
https://metraipolis.com/documento/dc_429c547102bc
How to cite
Fast and Stable Harmonic Approximation from Ill-distributed Data using Moving Least Squares — arXiv:2609.39200 — arXiv (en), https://arxiv.org/abs/2609.39200 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_429c547102bc (Metraipolis archive dc_429c547102bc, sha256 2faaf080bcd8f2ff92c422d404c7cc6ce5e0a2d56032a2d44cf5e6cab64215c6)
BibTeX
@misc{dc429c547102bc,
title = {Fast and Stable Harmonic Approximation from Ill-distributed Data using Moving Least Squares — arXiv:2609.39200},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.39200},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_429c547102bc; sha256 2faaf080bcd8f2ff92c422d404c7cc6ce5e0a2d56032a2d44cf5e6cab64215c6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39200. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We consider harmonic approximation on the torus $\mathbb{T}^d$, the sphere $\mathcal{S}^d$, and the rotation group $\mathrm{SO}(3)$. While several global approaches are available for computing a harmonic expansion from scattered data, their stability and, especially, their runtime depend strongly on the geometry of the nodes, in particular on a sufficiently small fill distance. Even a single large hole in the data may cause instability and long runtimes. We propose harmonic approximation via moving least squares (HAMLS), a global harmonic approximation scheme that avoids the ill-conditioned global solve and works well in both the overdetermined and the underdetermined settings. The main idea is an intermediate transition from the scattered data to a quadrature grid, which is realized via moving least squares (MLS). This replaces one large global problem by many small local ones that can be regularized individually. The global harmonic approximation is then obtained via quadrature using a fast Fourier transform. This makes the global stage fast, stable and non-iterative. For sufficiently smooth functions sampled at well-distributed nodes with small fill distance $h$, we bound the resulting $\mathrm{L}^2$-error by the error of the harmonic approximation obtained from exact values on the quadrature grid, plus a term of order $h^{K+1}$, where $K$ is the polynomial degree employed in the MLS step. Numerical experiments on $\mathcal{S}^2$ with ill-distributed nodes show that HAMLS achieves errors comparable to those of global least-squares approximation, while being significantly faster, especially for larger bandwidths.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.39200 — 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-07T14:04:46.023Z dalla pagina https://arxiv.org/catchup/math.NA/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).