Fast and Stable Harmonic Approximation from Ill-distributed Data using Moving Least Squares

DOI10.48550/arXiv.2609.39200MaRDI QIDQ7361987zbMATH OpenarXivFDO

Authors Ralf Hielscher, Tim Pöschl, Erik Wünsche

Publication date 30 September 2026

Published in arXiv

Tldr We propose a fast and stable harmonic approximation from ill-distributed data using moving least squares (MLS). Our method works well in both overdetermined and underdetermined settings, avoiding the need for a large, potentially ill-conditioned global solve and achieving state-of-the-art runtime and stability on various manifolds.

Full work available at URL https://doi.org/10.48550/arXiv.2609.39200

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25) Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Algorithms for approximation of functions (65D15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical methods for discrete and fast Fourier transforms (65T50)

arXiv classification

math.NA

Cites work

• A fast algorithm for nonequispaced Fourier transforms on the rotation group
• An Optimal Ansatz Space for Moving Least Squares Approximation on Spheres
• Analysis of moving least squares approximation revisited
• Approximation of functions over manifolds: a moving least-squares approach
• Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
• Approximation properties of the double Fourier sphere method
• Approximation Theory and Harmonic Analysis on Spheres and Balls
• Computing Fourier transforms and convolutions on the 2-sphere
• Efficient reconstruction of functions on the sphere from scattered data
• Fast and stable algorithms for discrete spherical Fourier transforms
• Fast spherical Fourier algorithms.
• FFTs on the rotation group
• Fourier transform summation of Legendre series and \(D\)-functions
• Gauss-Legendre Sampling on the Rotation Group
• Improved Convergence of Multilevel Moving Least-Squares Approximation
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Moving least squares approximation on the sphere
• Norms of inverses and condition numbers for matrices associated with scattered data
• Numerical Fourier analysis
• On the computation of nonnegative quadrature weights on the sphere
• On the computation of spherical designs by a new optimization approach based on fast spherical Fourier transforms
• On the Role of the Double Fourier Sphere Method in Fast Algorithms on SO(3)
• On the sensitivity of radial basis interpolation to minimal data separation distance
• Orthogonal and nonorthogonal multiresolution analysis, scale discrete and exact fully discrete wavelet transform on the sphere
• Piecewise polynomial, positive definite and compactly supported radial functions of minimal degree
• Polynomial approximation on the sphere using scattered data
• Quadrature errors, discrepancies, and their relations to halftoning on the torus and the sphere
• Random sampling and unisolvent interpolation by almost everywhere analytic functions
• Reconstruction Algorithms in Irregular Sampling
• Sampling Sets and Quadrature Formulae on the Rotation Group
• Scattered Data Approximation
• Spherical Marcinkiewicz-Zygmund inequalities and positive quadrature
• Stability results for scattered data interpolation on the rotation group
• Stability results for scattered-data interpolation on Euclidean spheres
• Stable moving least-squares
• Surfaces Generated by Moving Least Squares Methods
• The approximation power of moving least-squares
• Using NFFT 3 -- a software library for various nonequispaced fast Fourier transforms
• WLS-ENO remap: superconvergent and non-oscillatory weighted least squares data transfer on surfaces

This page was built for publication: Fast and Stable Harmonic Approximation from Ill-distributed Data using Moving Least Squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7361987)