Study of algorithmic properties of chebyshev coefficients

1 January 1968

journal article
research article
Published by Taylor & Francis in International Journal of Computer Mathematics

Vol. 2 (1-4) , 307-317
https://doi.org/10.1080/00207167008803043

Abstract

The problem of computing N Chebyshev coefficients is considered when . Two methods are discussed. The first method is related to the Fast Fourier Transform (FFT) and required a total number of operations proportional to N log² N. The second method, although not as efficient as efficient as the FFT exemplified interesting properties of the discrete Chebyshev polynomials.

Keywords

CHEBYSHEV COEFFICIENTS
EXEMPLIFIED
POLYNOMIALS
FOURIER
PROPORTIONAL
INTERESTING
DISCRETE

This publication has 0 references indexed in Scilit: