arXiv (All)
open access
Fast and Stable Harmonic Approximation from Ill-distributed Data using Moving Least Squares
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An adaptive localized orthogonal decomposition method for Helmholtz problems#1051179
- Order jumps in Spectral Deferred Corrections#1131499
- Extended Fourier analysis of signals#999136
- Voronoi-Assisted Optimization for Diffusing Unsigned Distance Fields from Unoriented Points#670401
- Voronoi-Assisted Optimization for Diffusing Unsigned Distance Fields from Unoriented Points#668336
Record · ID 1144167
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive