Filtered polynomial approximation on the sphere

by Yu Guang Wang

Institution: University of New South Wales
Department: Mathematics & Statistics
Year: 2015
Keywords: polynomials; sphere; filter; localization
Record ID: 1074118
Full text PDF: http://handle.unsw.edu.au/1959.4/54485


Localised polynomial approximations on the sphere have a variety of applications in areas such as signal processing, geomathematics and cosmology. Filtering is a simple and effective way of constructing a localised polynomial approximation. In this thesis we investigate the localisation properties of filtered polynomial approximations on the sphere. Using filtered polynomial kernels and a special numerical integration (quadrature) rule we construct a fully discrete needlet approximation. The localisation of the filtered approximation can be seen from the localisation properties of its convolution kernel. We investigate the localisation of the filtered Jacobi kernel, which includes the convolution kernel for filtered approximation on the sphere as a particular example. We prove the precise relation between the filter smoothness and the decay rate of the corresponding filtered Jacobi kernel over local and global regions. The difference in localisation properties between Fourier and filtered approximations can be illustrated by their Riemann localisation. We show that the Riemann localisation property holds for the Fourier-Laplace partial sum for sufficiently smooth functions on the two-dimensional sphere, but does not hold for spheres of higher dimensions. We then prove that the filtered approximation with sufficiently smooth filter has the Riemann localisation property for spheres of any dimensions. Filtered convolution kernels with a special filter become spherical needlets, which are highly localised zonal polynomials on the sphere with centres at the nodes of a suitable quadrature rule. The original semidiscrete spherical needlet approximation has coefficients defined by inner product integrals. We use an appropriate quadrature rule to construct a fully discrete version. We prove that the fully discrete spherical needlet approximation is equivalent to filtered hyperinterpolation, that is to a filtered Fourier-Laplace partial sum with inner products replaced by appropriate quadrature sums. From this we establish error bounds for the fully discrete needlet approximation of functions in Sobolev spaces on the sphere. The power of the needlet approximation for local approximation is shown by numerical experiments that use low-level needlets globally together with high-level needlets in a local region.