Fully discrete needlet approximation on the sphere
Yu Guang Wang, Quoc T. Le Gia, Ian H. Sloan, Robert S. Womersley

TL;DR
This paper develops a fully discrete needlet approximation on the sphere by approximating integrals with quadrature, proving optimal convergence rates, and demonstrating practical effectiveness through numerical experiments.
Contribution
It introduces a fully computable needlet approximation on the sphere using quadrature, with proven optimal convergence and reduced errors in local refinement scenarios.
Findings
Achieves optimal convergence rate of O(2^{-Js}) for Sobolev functions.
Uses a filter of class C^{loor{rac{d+3}{2}}} instead of smooth C^{} filters.
Numerical experiments show near-identical errors to semidiscrete needlet approximation and benefits of local refinement.
Abstract
Spherical needlets are highly localized radial polynomials on the sphere , , with centers at the nodes of a suitable cubature rule. The original semidiscrete spherical needlet approximation of Narcowich, Petrushev and Ward is not computable, in that the needlet coefficients depend on inner product integrals. In this work we approximate these integrals by a second quadrature rule with an appropriate degree of precision, to construct a fully discrete needlet approximation. We prove that the resulting approximation is equivalent to filtered hyperinterpolation, that is to a filtered Fourier-Laplace series partial sum with inner products replaced by appropriate cubature sums. It follows that the -error of discrete needlet approximation of order for and has for a function in the Sobolev…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
