Recurrence relations and fast algorithms

Applied and Computational Harmonic Analysis

Volumn 28, Issue 1, 2010, Pages 121-128

  Tygert, Mark ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Fast algorithms; Pseudospectral; Recurrence; Special functions; Transforms

Indexed keywords

FAST ALGORITHMS; PSEUDOSPECTRAL; RECURRENCE; SPECIAL FUNCTIONS; TRANSFORMS;

ALGORITHMS; FUNCTION EVALUATION; MATHEMATICAL TRANSFORMATIONS;

COMPUTATIONAL EFFICIENCY;

EID: 70350721777     PISSN: 10635203     EISSN: 1096603X     Source Type: Journal    
DOI: 10.1016/j.acha.2009.07.005     Document Type: Letter

References (15)

1. Burrus C.S. Notes on the FFT, unpublished manuscript. available at (September 1997). http://www.fftw.org/burrus-notes.html
2. Frigo M., and Johnson S.G. The design and implementation of FFTW3. Proc. IEEE 93 (2005) 216-231
3. Glaser A., Liu X., and Rokhlin V. A fast algorithm for the calculation of the roots of special functions. SIAM J. Sci. Comput. 29 (2007) 1420-1438
4. Golub G.H., and Welsch J.H. Calculation of Gauss quadrature rules. Math. Comput. 23 (1969) 221-230 and s1-s10
5. Gu M., and Eisenstat S.C. A stable and efficient algorithm for the rank-1 modification of the symmetric eigenproblem. SIAM J. Matrix Anal. Appl. 15 (1994) 1266-1276
6. Gu M., and Eisenstat S.C. A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem. SIAM J. Matrix Anal. Appl. 16 (1995) 172-191
7. Jakob-Chien R., and Alpert B. A fast spherical filter with uniform resolution. J. Comput. Phys. 136 (1997) 580-584
8. Nabors K., Korsmeyer F.T., Leighton F.T., and White J. Preconditioned, adaptive, multipole-accelerated iterative methods for three-dimensional first-kind integral equations of potential theory. SIAM J. Sci. Comput. 15 (1994) 713-735
9. M. O'Neil, F. Woolfe, V. Rokhlin, An algorithm for the rapid evaluation of special function transforms, Technical report 1399, Dept. of Computer Science, Yale University, April 2008
10. Press W., Teukolsky S., Vetterling W., and Flannery B. Numerical Recipes. second ed. (1992), Cambridge Univ. Press, Cambridge, UK
11. Rokhlin V., and Tygert M. Fast algorithms for spherical harmonic expansions. SIAM J. Sci. Comput. 27 (2006) 1903-1928
12. Szegö G. Orthogonal Polynomials. Colloquium Publications. eleventh ed. vol. 23 (2003), Amer. Math. Soc., Providence, RI
13. Tygert M. Recurrence relations and fast algorithms. Technical report 1343, Dept. of Computer Science, Yale University, December 2005; also available in revised form as. cs.CE/0609081 at
14. Tygert M. Fast algorithms for spherical harmonic expansions, II. J. Comput. Phys. 227 (2008) 4260-4279
15. Wilf H.S. Mathematics for the Physical Sciences (1962), Wiley, New York