English

Localized bases for kernel spaces on the unit sphere

Numerical Analysis 2013-09-11 v1 Classical Analysis and ODEs

Abstract

Approximation/interpolation from spaces of positive definite or conditionally positive definite kernels is an increasingly popular tool for the analysis and synthesis of scattered data, and is central to many meshless methods. For a set of NN scattered sites, the standard basis for such a space utilizes NN \emph{globally} supported kernels; computing with it is prohibitively expensive for large NN. Easily computable, well-localized bases, with "small-footprint" basis elements - i.e., elements using only a small number of kernels -- have been unavailable. Working on \sphere\sphere, with focus on the restricted surface spline kernels (e.g. the thin-plate splines restricted to the sphere), we construct easily computable, spatially well-localized, small-footprint, robust bases for the associated kernel spaces. Our theory predicts that each element of the local basis is constructed by using a combination of only O((logN)2)\mathcal{O}((\log N)^2) kernels, which makes the construction computationally cheap. We prove that the new basis is LpL_p stable and satisfies polynomial decay estimates that are stationary with respect to the density of the data sites, and we present a quasi-interpolation scheme that provides optimal LpL_p approximation orders. Although our focus is on S2\mathbb{S}^2, much of the theory applies to other manifolds - Sd\mathbb{S}^d, the rotation group, and so on. Finally, we construct algorithms to implement these schemes and use them to conduct numerical experiments, which validate our theory for interpolation problems on S2\mathbb{S}^2 involving over one hundred fifty thousand data sites.

Keywords

Cite

@article{arxiv.1205.3255,
  title  = {Localized bases for kernel spaces on the unit sphere},
  author = {E. Fuselier and T. Hangelbroek and F. J. Narcowich and J. D. Ward and G. B. Wright},
  journal= {arXiv preprint arXiv:1205.3255},
  year   = {2013}
}

Comments

This article supersedes arXiv:1111.1013 "Better bases for kernel spaces," which proved existence of better bases for various kernel spaces. This article treats a smaller class of kernels, but presents an algorithm for constructing better bases and demonstrates its effectiveness with more elaborate examples. A quasi-interpolation scheme is introduced that provides optimal linear convergence rates

R2 v1 2026-06-21T21:04:09.830Z