Computing Fourier transforms and convolutions on the 2-sphere (Q1330934)

From MaRDI portal
Revision as of 12:39, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Computing Fourier transforms and convolutions on the 2-sphere
scientific article

    Statements

    Computing Fourier transforms and convolutions on the 2-sphere (English)
    0 references
    0 references
    0 references
    10 August 1994
    0 references
    This important paper deals with the efficient computation of the spherical harmonic expansion, or Fourier transform, of functions defined on the unit sphere \(S^ 2\). For example, the Fourier transform on \(S^ 2\) appears in tomography, geophysics, seismology, atmospheric science, and crystallography. The known Fourier analysis on \(S^ 2\) is used to prove a sampling theorem for band-limited functions. This sampling theorem allows the exact computation of the Fourier transforms of a band- limited function as finite sums of sampled data at an equiangular grid. In order to construct an efficient scheme for evaluating these sums, the authors describe an \(O(n( \log n)^ 2)\) time algorithm for the Legendre polynomial transform of a function sampled at the \(n = 2^ k\) nodes \(\cos (2 \pi j/n)\) \((j = 0, \dots, n - 1)\). Theoretical and experimental results concerning the effect of finite precision arithmetic on this algorithm are described, too. Finally, the procedure is extended to the associated Legendre functions to obtain a fast algorithm of the Fourier transforms on \(S^ 2\).
    0 references
    convolutions
    0 references
    Fourier transform on the sphere
    0 references
    numerical stability
    0 references
    spherical harmonic expansion
    0 references
    tomography
    0 references
    geophysics
    0 references
    seismology
    0 references
    atmospheric science
    0 references
    crystallography
    0 references
    sampling theorem
    0 references
    band-limited functions
    0 references
    Legendre polynomial transform
    0 references
    fast algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references