Localized bases for kernel spaces on the unit sphere
High Point University(海普特大学);University of Hawaii(夏威夷大学);Texas A&M University(德克萨斯农工大学);Boise State University(博伊西州立大学)
E. Fuselier, T. Hangelbroek, F. J. Narcowich, J. D. Ward, G. B. Wright
备注:
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
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 $N$ scattered sites, the standard basis for such a space utilizes $N$ \emph{globally} supported kernels; computing with it is prohibitively expensive for large $N$. 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$, 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 $\mathcal{O}((\log N)^2)$ kernels, which makes the construction computationally cheap. We prove that the new basis is $L_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 $L_p$ approximation orders. Although our focus is on $\mathbb{S}^2$, much of the theory applies to other manifolds - $\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 $\mathbb{S}^2$ involving over one hundred fifty thousand data sites.
AstroParticule et Cosmologie, CNRS and Université Paris 7(粒子物理与宇宙学,法国国家科学研究中心与巴黎第七大学);Laboratoire Probabilités et Modèles Aléatoires, CNRS and Universités Paris 6-7(概率与随机模型实验室,法国国家科学研究中心与巴黎第六至七大学);Laboratoire du Traitement et de la Communication de l’Information, CNRS and Télécom Paris(信息与通信处理实验室,法国国家科学研究中心与巴黎电信学院);Laboratoire Paul-Painlevé, Université Lille-1(保罗·潘勒韦实验室,里尔第一大学)
LoCCA: Localized Chebyshev Cross Approximation for Kernel Matrix Factorization via Nodal Perturbation Stability
Wadhwani School of Data Science and Artificial Intelligence, IIT Madras(瓦德万纳数据科学与人工智能学院,印度理工学院马德拉斯分校);Department of Mathematics, IIT Madras(数学系,印度理工学院马德拉斯分校);Robert Bosch Center for Data Science and Artificial Intelligence, IIT Madras(罗伯特·博世数据科学与人工智能中心,印度理工学院马德拉斯分校);Department of Data Science and Artificial Intelligence, IIT Madras(数据科学与人工智能系,印度理工学院马德拉斯分校)