Expansion of functions in a Fourier-Chebyshev series by shifted Chebyshev polynomials of the first kind
The paper considers an algorithm that develops functions in a Fourier—Chebyshev series by shifted Chebyshev polynomials of the first kind. The relationship of the algorithm with Fourier transform and discrete cosine transform is established.
KeywordsFourier Fourier Transform Chebyshev Polynomial Chebyshev Series Shift Chebyshev Polynomial
Unable to display preview. Download preview PDF.
- 1.N. Ahmed and C. R. Rao, Orthogonal Transforms for Digital Signal Processing [Russian translation], Moscow (1980).Google Scholar
- 2.V. V. Solodovnikov, A. G. Dmitriev, and N. D. Egupov, Spectral Methods for Control System Computation and Design [in Russian], Moscow (1986).Google Scholar
- 3.A. A. Sukhanov, “A method for solving nonlinear two-point boundary-value problems,” Zh. Vychisl. Mat. Mat. Fiz.,23, No. 1, 228–231 (1983).Google Scholar