Monte Carlo quasi-interpolation of spherical data
Zhengjie Sun, Mengyuan Lv, Xingping Sun
TL;DR
This work develops a robust framework for spherical function approximation that blends deterministic and stochastic discretizations via scaled zonal kernels. By combining convolution-based quasi-interpolation with both quasi-Monte Carlo and Monte Carlo quadrature, and by introducing a multilevel scheme, the authors achieve stable, high-order Sobolev-space approximations on the sphere without solving linear systems. They establish Sobolev error bounds, probabilistic concentration results for MCQI, and convergence guarantees for the multilevel construction, including noisy-data scenarios. Numerical experiments on diverse point sets and kernel orders demonstrate superior noise robustness and computational efficiency compared with hyperinterpolation-based methods, highlighting practical impact for spherical data analysis in geophysics, astronomy, and graphics.
Abstract
We establish a deterministic and stochastic spherical quasi-interpolation framework featuring scaled zonal kernels derived from radial basis functions on the ambient Euclidean space. The method incorporates both quasi-Monte Carlo and Monte Carlo quadrature rules to construct easily computable quasi-interpolants, which provide efficient approximation to Sobolev-space functions for both clean and noisy data. To enhance the approximation power and robustness of our quasi-interpolants, we develop a multilevel method in which quasi-interpolants constructed with graded resolutions join force to reduce the error of approximation. In addition, we derive probabilistic concentration inequalities for our quasi-interpolants in pertinent stochastic settings. The construction of our quasi-interpolants does not require solving any linear system of equations. Numerical experiments show that our quasi-interpolation algorithm is more stable and robust against noise than comparable ones in the literature.
