Continuous regularized least squares polynomial approximation on the sphere
Summary: In this paper, we consider the problem of polynomial reconstruction of smooth functions on the sphere from their noisy values at discrete nodes on the two-sphere. The method considered in this paper is a weighted least squares form with a continuous regularization. Preliminary error bounds in terms of regularization parameter, noise scale, and smoothness are proposed under two assumptions: the mesh norm of the data point set and the perturbation bound of the weight. Condition numbers of the linear systems derived by the problem are discussed. We also show that spherical \(t_\epsilon \)-designs, which can be seen as a generalization of spherical \(t\)-designs, are well applied to this model. Numerical results show that the method has good performance in view of both the computation time and the approximation quality.
- Regularized least squares approximations on the sphere using spherical designs
- Continuous and discrete least-squares approximation by radial basis functions on spheres
- Parameter choice strategies for least-squares approximation of noisy smooth functions on the sphere
- \(L_2\) error estimates for polynomial discrete penalized least-squares approximation on the sphere from noisy data
- Discrete least squares hybrid approximation with regularization on the two-sphere
- A smoothing trust region filter algorithm for nonsmooth least squares problems
- An augmented Lagrangian algorithm for solving semiinfinite programming
- Approximation algorithm for squared metric two-stage stochastic facility location problem
- Approximation algorithms for the robust facility leasing problem
- Extremal systems of points and numerical integration on the sphere
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- Isotropic sparse regularization for spherical harmonic representations of random fields on the sphere
- Multivariate interpolation of large sets of scattered data
- Parameter choice strategies for least-squares approximation of noisy smooth functions on the sphere
- Quadrature rules with neighborhood of spherical designs on the two-sphere
- Quadratures on a sphere
- Radial basis function approximation of noisy scattered data on the sphere
- Regularized least squares approximations on the sphere using spherical designs
- Spherical t_\epsilon -designs for approximations on the sphere
- Spherical harmonics
- The seeding algorithm for spherical \(k\)-means clustering with penalties
- The stochastic properties of \(\ell^1\)-regularized spherical Gaussian fields
- Efficient reconstruction of functions on the sphere from scattered data
- Uniform approximation on the sphere by least squares polynomials
- \(L_2\) error estimates for polynomial discrete penalized least-squares approximation on the sphere from noisy data
- Regularized least squares approximations on the sphere using spherical designs
- Corrigendum: ``Regularized least squares approximations on the sphere using spherical designs
- RBF-based penalized least-squares approximation of noisy scattered data on the sphere
- Discrete least squares hybrid approximation with regularization on the two-sphere
- Tikhonov regularization for polynomial approximation problems in Gauss quadrature points
- Parameter choice strategies for least-squares approximation of noisy smooth functions on the sphere
- Convergence of discrete and penalized least squares spherical splines
This page was built for publication: Continuous regularized least squares polynomial approximation on the sphere
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007163)
