The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Computing Fourier Transforms and Convolutions on the 2-Sphere
Open accessAbstract
This paper considers the problem of efficient computation of the spherical harmonic expansion, or Fourier transform, of functions defined on the two dimensional sphere, S2. The resulting algorithms are applied to the efficient computation of convolutions of functions on the sphere. We begin by proving convolution theorems generalizing well known and useful results from the abelian case. These convolution theorems are then used to develop a sampling theorem on the sphere. which reduces the calculation of Fourier transforms and convolutions of band-limited functions to discrete computations. We show how to perform these efficiently, starting with an O(n(log n)2) time algorithm for computing the Legendre transform of a function defined on the interval [−1,1] sampled at n points there. Theoretical and experimental results on the effects of finite precision arithmetic are presented. The Legendre transform algorithm is then generalized to obtain an algorithm for the Fourier transform, requiring O(n(log n)2) time, and an algorithm for its inverse in O(n1.5) time, where n is the number of points on the sphere at which the function is sampled. This improves the naive O(n2) bound, which is the best previously known. These transforms give an O(n1.5) algorithm for convolving two functions on the sphere.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
Goldstein, H. (1951) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 10,004
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Introduction to Numerical Analysis.
Froberg, C.-E., Stoer, J., & Bulirsch, R. (1981) · Mathematics of Computation · doi:10.2307/2007454 · Cited by 5,463
The Algebraic Eigenvalue Problem
I., E., & Wilkinson, J. H. (1966) · Mathematics of Computation · doi:10.2307/2003558 · Cited by 5,140
Angular Momentum in Quantum Mechanics
Edmonds, A. R., & Mendlowitz, H. (1958) · Physics Today · doi:10.1063/1.3062519 · Cited by 4,285
Schwartz, L. (1966) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 3,513
Scott, W. R. (1964) · Cited by 2,606
Special Functions and the Theory of Group Representations
Vilenkin, N. (1968) · Translations of Mathematical Monographs · doi:10.1090/mmono/022 · Cited by 2,072
Helgason, S. (2000) · Mathematical surveys and monographs · doi:10.1090/surv/083 · Cited by 2,035
Group representations in probability and statistics
Diaconis, P. (1988) · doi:10.1214/lnms/1215467407 · Cited by 1,381
On computing the discrete Fourier transform
Winograd, S. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0468306-4 · Cited by 613
Harmonic Analysis on Symmetric Spaces and Applications I
Terras, A. (1985) · Springer eBooks · doi:10.1007/978-1-4612-5128-6 · Cited by 565
Effects of finite register length in digital filtering and the fast Fourier transform
Oppenheim, A. V., & Weinstein, C. J. (1972) · Proceedings of the IEEE · doi:10.1109/proc.1972.8820 · Cited by 305
Is computing with the finite Fourier transform pure or applied mathematics?
Auslander, L., & Tolimieri, R. (1979) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-1979-14686-x · Cited by 155
Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
Morgenstern, J. (1973) · Journal of the ACM · doi:10.1145/321752.321761 · Cited by 108
Fixed-point fast Fourier transform error analysis
Tran-Thong, & Liu, B. (1976) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1976.1162875 · Cited by 97
Accumulation of Round-Off Error in Fast Fourier Transforms
Kaneko, T., & Liu, B. (1970) · Journal of the ACM · doi:10.1145/321607.321613 · Cited by 84
Efficient Computation of the Fourier Transform on Finite Groups
Diaconis, P. W., & Rockmore, D. N. (1990) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-1990-1030655-4 · Cited by 77
On the computational complexity of the general discrete fourier transform
Beth, T. (1987) · Theoretical Computer Science · doi:10.1016/0304-3975(87)90041-7 · Cited by 40
Optimality of the Fast Fourier transform
Papadimitriou, C. H. (1979) · Journal of the ACM · doi:10.1145/322108.322118 · Cited by 35
Computation of Fourier Transforms on the Symmetric Group
Rockrmore, D. (1989) · Springer eBooks · doi:10.1007/978-1-4613-9647-5_20 · Cited by 10
Error analysis of Good-Winograd algorithm assuming correlated truncation errors
Panda, G., Pal, R., & Chatterjee, B. (1983) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1983.1164077 · Cited by 4
Cited by
Gorski, K. M., Hivon, E., Banday, A. J., Wandelt, B. D., Hansen, F. K., Reinecke, M., & Bartelmann, M. (2005) · The Astrophysical Journal · doi:10.1086/427976 · Cited by 5,958
Learning skillful medium-range global weather forecasting
Lam, R., Sanchez-Gonzalez, A., Willson, M., Wirnsberger, P., Fortunato, M., Alet, F., Ravuri, S., Ewalds, T., Eaton-Rosen, Z., Hu, W., et al. (2023) · Science · doi:10.1126/science.adi2336 · Cited by 1,466
The Crust of the Moon as Seen by GRAIL
Wieczorek, M. A., Neumann, G. A., Nimmo, F., Kiefer, W. S., Taylor, G. J., Melosh, H. J., Phillips, R. J., Solomon, S. C., Andrews-Hanna, J. C., Asmar, S. W., et al. (2013) · Science · doi:10.1126/science.1231530 · Cited by 976
Analysis and design of spherical microphone arrays
Rafaely, B. (2005) · IEEE Transactions on Speech and Audio Processing · doi:10.1109/tsa.2004.839244 · Cited by 547
Characterization of anisotropy in high angular resolution diffusion‐weighted MRI
Frank, L. R. (2002) · Magnetic Resonance in Medicine · doi:10.1002/mrm.10156 · Cited by 510
Metadata
- Authors
- Driscoll, J. R., & Healy, D. M.
- Venue
- Advances in Applied Mathematics
- Publisher
- Elsevier BV
- Published
- 1994-06
- Volume
- 15
- Issue
- 2
- Pages
- 202-250
- ISSN
- 0196-8858 (ISSN-L)
- OpenAlex
- W2160615084
- Cited by
- 881
- References
- 23
- FWCI
- 4.21
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.