Efficient reconstruction of functions on the sphere from scattered data (Q2384707): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: FFTW / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00041-006-6915-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2040013301 / rank
 
Normal rank

Revision as of 18:54, 19 March 2024

scientific article
Language Label Description Also known as
English
Efficient reconstruction of functions on the sphere from scattered data
scientific article

    Statements

    Efficient reconstruction of functions on the sphere from scattered data (English)
    0 references
    0 references
    0 references
    0 references
    10 October 2007
    0 references
    In this interesting paper, the authors consider the problem of reconstructing a spherical polynomial of degree \(N\) from \(M\) sample values at scattered nodes on the unit sphere. A main result is that for given sampling nodes the polynomial degree \(N\) can either be chosen small enough with respect to the inverse mesh norm or large enough with respect to the inverse separation distance of the sampling set to ensure a well conditioned spherical Fourier matrix. For the overdetermined case \(M>(N+1)^2\), the authors present a fast iterative solution of the least squares approximation problem. Using results of \textit{H. G. Feichtinger, K. Gröchenig} and \textit{T. Strohmer} [Numer. Math. 69, No. 4, 423--440 (1995; Zbl 0837.65148)], the idea of adaptive weights is generalized to the sphere and an \(L^2\)-Marcinkiewicz-Zygmund inequality for dense sampling sets is proven. In the underdetermined case \(M<(N+1)^2\), the authors show stable interpolation for well separated sampling sets. In both cases, the rate of convergence of the fast iterative solvers depends only on the mesh norm and the separation distance of the nodes. For both iterative methods, the total number of floating point operations is \({\mathcal O}(N^2\, \log^2 N + M)\) by the use of spherical fast Fourier transforms [see \textit{S. Kunis} and \textit{D. Potts}, J. Comput. Appl. Math. 161, No.~1, 75--98 (2003; Zbl 1033.65123)]. Finally, several numerical experiments are presented.
    0 references
    fast Fourier transform
    0 references
    fast spherical Fourier transform
    0 references
    spherical harmonics
    0 references
    spherical polynomial
    0 references
    scattered date
    0 references
    nonequispaced FFT on the sphere
    0 references
    least square approximation
    0 references
    interpolation
    0 references
    iterative methods
    0 references
    numerical experiments
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references