Publication | Closed Access
Study of algorithmic properties of chebyshev coefficients
14
Citations
0
References
1968
Year
Numerical AnalysisPade ApproximantN Log2 N.EngineeringValidated NumericsFourier AnalysisAnalytic CombinatoricsChebyshev CoefficientsFourier ExpansionApproximation TheoryDiscrete Chebyshev PolynomialsFast Fourier Transform
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.