Fast algorithms for discrete Chebyshev-Vandermonde transforms and applications
The discrete cosine transform (DCT) is introduced as an application of the discrete Chebyshev-Vandermonde transform (DCVT). With the divide-and- conquer technique and the d'Alembert functional equation, fast DCT algorithms are described. By the help of DCVT and DCT, numerically stable fast algorithms for simultaneous polynomial approximation and for a collocation method for the airfoil equations are derived.
discrete Chebyshev-Vandermonde transform
scientific article; zbMATH DE number 510220