53
Views
8
CrossRef citations to date
0
Altmetric
Original Articles

Study of algorithmic properties of chebyshev coefficients

&
Pages 307-317 | Published online: 21 Dec 2010
 

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 log2 N. The second method, although not as efficient as efficient as the FFT exemplified interesting properties of the discrete Chebyshev polynomials.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.