Fast evaluation of quadrature formulae on the sphere |
| |
Authors: | Jens Keiner Daniel Potts. |
| |
Affiliation: | Institute of Mathematics, University of Lübeck, Wallstrasse 40, 23560 Lübeck, Germany ; Department of Mathematics, Chemnitz University of Technology, Reichenhainer Strasse 39, 09107 Chemnitz, Germany |
| |
Abstract: | Recently, a fast approximate algorithm for the evaluation of expansions in terms of standard -orthonormal spherical harmonics at arbitrary nodes on the sphere has been proposed in [S. Kunis and D. Potts. Fast spherical Fourier algorithms. J. Comput. Appl. Math., 161:75-98, 2003]. The aim of this paper is to develop a new fast algorithm for the adjoint problem which can be used to compute expansion coefficients from sampled data by means of quadrature rules. We give a formulation in matrix-vector notation and an explicit factorisation of the spherical Fourier matrix based on the former algorithm. Starting from this, we obtain the corresponding factorisation of the adjoint spherical Fourier matrix and are able to describe the associated algorithm for the adjoint transformation which can be employed to evaluate quadrature rules for arbitrary weights and nodes on the sphere. We provide results of numerical tests showing the stability of the obtained algorithm using as examples classical Gauß-Legendre and Clenshaw-Curtis quadrature rules as well as the HEALPix pixelation scheme and an equidistribution. |
| |
Keywords: | Two-sphere quadrature nonequispaced fast spherical Fourier transform NFFT FFT |
|
| 点击此处可从《Mathematics of Computation》浏览原始摘要信息 |
|
点击此处可从《Mathematics of Computation》下载全文 |
|