An algorithm for the evaluation of multidimensional (direct and inverse) discrete Chebyshev transforms
DOI10.1016/0771-050X(82)90055-9zbMath0494.65003MaRDI QIDQ1169241
Michel O. Deville, Gérard Labrosse
Publication date: 1982
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Chebyshev polynomialsfast Fourier transformcollocation pointsChebyshev coefficientsimbricated sums of direct and inverse discrete Chebyshev transformssummation of Chebyshev series
Trigonometric interpolation (42A15) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Numerical methods for trigonometric approximation and interpolation (65T40) Numerical summation of series (65B10) Software, source code, etc. for problems pertaining to numerical analysis (65-04)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extension of Clenshaw-Curtis quadrature
- Interpolation by fast Fourier and Chebyshev transforms
- The fast Fourier transform algorithm: Programming considerations in the calculation of sine, cosine and Laplace transforms
- Implementing Clenshaw-Curtis quadrature, I methodology and experience
- Numerical Simulation of Incompressible Flows Within Simple Boundaries. I. Galerkin (Spectral) Representations
- On Double Chebyshev Series Approximation
This page was built for publication: An algorithm for the evaluation of multidimensional (direct and inverse) discrete Chebyshev transforms