Fast algorithms for spherical harmonic expansions, III

Journal of Computational Physics

Volumn 229, Issue 18, 2010, Pages 6181-6192

  Tygert, Mark ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

Algorithm; Butterfly; Interpolative decomposition; Spherical harmonic; Transform

Indexed keywords

DATA FLOW ANALYSIS; FLOW GRAPHS; SPHERES;

BUTTERFLY; CONVENIENT ALTERNATIVES; DEPTH FIRST; FAST ALGORITHMS; INTERPOLATIVE DECOMPOSITION; PRE-COMPUTATION; PROGRAM CONTROL; SPHERICAL HARMONIC EXPANSIONS; SPHERICAL HARMONIC TRANSFORMS; SPHERICAL HARMONICS;

HARMONIC ANALYSIS;

EID: 77954145553     PISSN: 00219991     EISSN: 10902716     Source Type: Journal    
DOI: 10.1016/j.jcp.2010.05.004     Document Type: Article

References (17)

1. Handbook of Mathematical Functions 1972, Dover Publications, New York. M. Abramowitz, I.A. Stegun (Eds.).
2. Adams J.C., Swarztrauber P.N. SPHEREPACK 3.0: A model development facility. Mon. Wea. Rev. 1999, 127:1872-1878.
3. Aho A., Hopcroft J., Ullman J. Data Structures and Algorithms 1987, Addison-Wesley.
4. Candès E., Demanet L., Ying L. A fast butterfly algorithm for the computation of Fourier integral operators. Multiscale Model. Simul. 2009, 7(4):1727-1750.
5. Cheng H., Gimbutas Z., Martinsson P.-G., Rokhlin V. On the compression of low rank matrices. SIAM J. Sci. Comput. 2005, 26(4):1389-1404.
6. S.A. Goreinov, E.E. Tyrtyshnikov, The maximal-volume concept in approximation by low-rank matrices, in: V. Olshevsky (Ed.), Structured Matrices in Mathematics, Computer Science, and Engineering I: Proceedings of an AMS-IMS-SIAM Joint Summer Research Conference, University of Colorado, Boulder, June 27-July 1, 1999, vol. 280 of Contemporary Mathematics, AMS Publications, Providence, RI, 2001, pp. 47-51.
7. Gu M., Eisenstat S.C. A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem. SIAM J. Matrix Anal. Appl. 1995, 16:172-191.
8. Gu M., Eisenstat S.C. Efficient algorithms for computing a strong rank-revealing QR factorization. SIAM J. Sci. Comput. 1996, 17(4):848-869.
9. Martinsson P.-G., Rokhlin V., Tygert M. On interpolation and integration in finite-dimensional spaces of bounded functions. Commun. Appl. Math. Comput. Sci. 2006, 1:133-142.
10. Michielssen E., Boag A. A multilevel matrix decomposition algorithm for analyzing scattering from large structures. IEEE Trans. Antennas Propag. 1996, 44(8):1086-1093.
11. O'Neil M., Woolfe F., Rokhlin V. An algorithm for the rapid evaluation of special function transforms. Appl. Comput. Harmon. Anal. 2010, 28(2):203-226.
12. Reuter M.G., Ratner M.A., Seideman T. A fast method for solving both the time-dependent Schrödinger equation in angular coordinates and its associated " m-mixing" problem. J. Chem. Phys. 2009, 131:094108-1-094108-6.
13. Swarztrauber P.N., Spotz W.F. Generalized discrete spherical harmonic transforms. J. Comput. Phys. 2000, 159(2):213-230.
14. Szegö G. Orthogonal Polynomials 2003, vol. 23. Colloquium Publications, American Mathematical Society, Providence, RI. eleventh ed.
15. Tygert M. Fast algorithms for spherical harmonic expansions, II. J. Comput. Phys. 2008, 227(8):4260-4279.
16. Tyrtyshnikov E.E. Incomplete cross approximation in the mosaic-skeleton method. Computing 2000, 64(4):367-380.
17. Ying L. Sparse Fourier transform via butterfly algorithm. SIAM J. Sci. Comput. 2009, 31(3):1678-1694.