New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set

AbstractFor a polynomial p(x) of a degree n, we study its interpolation and evaluation on a set of Chebyshev nodes, xκ = cos((2κ + 1)π(2n + 2)), κ = 0, 1, …, n. This is easily reduced to applying discrete Fourier transforms (DFTs) to the auxiliary polynomial q(ω) = ωnp(x), where 2x = αω + (αω)−1, α = exp(π⇔−1(2n)). We show the back and forth transition between p(x) and q(ω) based on the respective back and forth transformations of the variable: αω = (1 − z)(1 + z), y = (x − 1)(x + 1), y = z2. All these transformations (like the DFTs) are performed by using O(n log n) arithmetic operations, which thus suffice in order to support both interpolation and evaluation of p(x) on the Chebychev set, as well as on some related sets of nodes. This improves, by factor log n, the known arithmetic time bound for Chebyshev interpolation and gives an alternative supporting algorithm for the record estimate of O(n log n) for Chebyshev evaluation, obtained by Gerasoulis in 1987 and based on a distinct algorithm