Fast algorithms for discrete polynomial transforms

Mathematics of Computation

Volumn 67, Issue 224, 1998, Pages 1577-1590

  Potts, Daniel ^a   Steidl, Gabriele ^b   Tasche, Manfred ^a  

^a UNIVERSITY OF ROSTOCK   (Germany)

^b UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

Cascade summation; Chebyshev knots; Discrete polynomial transform; Fast cosine transform; Fast polynomial transform; Vandermonde like matrix

Indexed keywords

EID: 0032367851     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/s0025-5718-98-00975-2     Document Type: Article

References (20)

1. B. K. Alpert and V. Rokhlin, A fast algorithm for the evaluation of Legendre expansions, SIAM J. Sci. Statist. Comput. 12 (1991), 158 - 179. MR 91i:65042
2. G. Baszenski and M. Tasche, Fast polynomial multiplication and convolutions related to the discrete cosine transform, Linear Algebra Appl. 252 (1997), 1 - 25. CMP 97:06
3. S. Belmehdi, On the associated orthogonal polynomials, J. Comput. Appl. Math. 32 (1991), 311 - 319. MR 92e:33007
4. T. S. Chihara, An Introduction to Orthogonal Polynomials, Gordon and Breach, New York, 1978. MR 58:1979
5. C. W. Clenshaw, A note on the summation of Chebyshev series. Math. Comp. 9 (1955), 118 - 120. MR 17:194e
6. J. R. Driscoll and D.M. Healy, Computing Fourier transforms and convolutions on the 2-sphere, Adv. in Appl. Math. 15 (1994), 202 - 240. MR 95h:65108
7. J. R. Driscoll, D. M. Healy and D. Rockmore, Fast discrete polynomial transforms with applications to data analysis for distance transitive graphs, SIAM J. Sci. Comput. 26 (1997), 1066-1099. CMP 97:15
8. A. Dutt, M. Gu and V. Rokhlin, Fast algorithms for polynomial interpolation, integration and differentiation, SIAM J. Numer. Anal. 33 (1996), 1689-1711. MR 97h:65015
9. W. Gautschi, The condition of Vandermonde-like matrices involving orthogonal polynomials, Linear Algebra Appl. 52/53 (1983), 293 - 300. MR 84i:65043
10. D. M. Healy, S. Moore and D. Rockmore, Efficiency and stability issues in the numerical convolution of Fourier transforms and convolutions on the 2-sphere, Technical Report, Dartmouth College, 1994.
11. N. J. Higham, Fast solution of Vandermonde-like systems involving orthogonal polynomials, IMA J. Numer. Anal. 8 (1988), 473 - 486. MR 89k:65067
12. D. Maslen, A polynomial approach to orthogonal polynomial transforms, Research Report, Max-Planck-Institute of Mathematics, Bonn, 1994.
13. S. S. B. Moore, Efficient stabilization methods for fast polynomial transforms, Thesis, Dartmouth College, 1994.
14. S. S. B. Moore, D.M. Healy and D.N. Rockmore, Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation, Linear Algebra Appl. 192 (1993), 249 -299. MR 94g:65148
15. S. A. Orszag, Fast eigenfunction transforms, in: Science and Computers (G.C. Rota, ed.), Academic Press, New York, 1986, 23 - 30.
16. V. Pan, Fast evaluation and interpolation at the Chebyshev sets of points, Appl. Math. Lett. 34 (1989), 255 - 258. CMP 21:17
17. K. R. Rao and P. Yip, Discrete Cosine Transform, Academic Press, Boston, 1990. MR 92b:94003
18. G. Steidl, Fast radix-p discrete cosine transform, Appl. Algebra, in Engrg. Comm. Comput. 3 (1992), 39 - 46. MR 95m:65221
19. G. Steidl and M. Tasche, A polynomial approach to fast algorithms for discrete Fourier-cosine and Fourier-sine transforms, Math. Comp. 56 (1991), 281 - 296. MR 91h:65225
20. J. Wimp, Computation with Recurrence Relations, Pitman Press, Boston, 1984. MR 85f:65001